YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True (1,1) 1. evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True (?,1) 2. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] (?,1) 3. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] (?,1) 4. evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) [-30 + B >= 0] (?,1) 5. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [-1*B + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && C >= D] (?,1) 6. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [-1*B + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && D >= 1 + C] (?,1) 7. evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) [C + -1*D >= 0 && -1*B + D >= 0 && -1*B + C >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0] (?,1) 8. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [-1 + -1*C + D >= 0 (?,1) && -1*B + D >= 0 && -1 + -1*A + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && 5 >= C && 7 >= C] 9. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [-1 + -1*C + D >= 0 && -1*B + D >= 0 && -1 + -1*A + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && C >= 6] (?,1) 10. evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) [6 + D + -1*E >= 0 (?,1) && 7 + C + -1*E >= 0 && -2 + -1*C + E >= 0 && -2 + -1*A + E >= 0 && -1 + -1*C + D >= 0 && -1*B + D >= 0 && -1 + -1*A + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0] Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{5,6},4->{},5->{7},6->{8,9},7->{2,3},8->{10},9->{10},10->{5,6}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: Looptree YES + Considered Problem: Rules: 0. evalcomplexstart(A,B,C,D,E) -> evalcomplexentryin(A,B,C,D,E) True (1,1) 1. evalcomplexentryin(A,B,C,D,E) -> evalcomplexbb10in(B,A,C,D,E) True (1,1) 2. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexreturnin(A,B,C,D,E) [B >= 30] (1,1) 3. evalcomplexbb10in(A,B,C,D,E) -> evalcomplexbb8in(A,B,A,B,E) [29 >= B] (?,1) 4. evalcomplexreturnin(A,B,C,D,E) -> evalcomplexstop(A,B,C,D,E) [-30 + B >= 0] (1,1) 5. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb9in(A,B,C,D,E) [-1*B + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && C >= D] (?,1) 6. evalcomplexbb8in(A,B,C,D,E) -> evalcomplexbb1in(A,B,C,D,E) [-1*B + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && D >= 1 + C] (?,1) 7. evalcomplexbb9in(A,B,C,D,E) -> evalcomplexbb10in(-10 + C,2 + D,C,D,E) [C + -1*D >= 0 && -1*B + D >= 0 && -1*B + C >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0] (?,1) 8. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,2 + C) [-1 + -1*C + D >= 0 (?,1) && -1*B + D >= 0 && -1 + -1*A + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && 5 >= C && 7 >= C] 9. evalcomplexbb1in(A,B,C,D,E) -> evalcomplexbb7in(A,B,C,D,7 + C) [-1 + -1*C + D >= 0 && -1*B + D >= 0 && -1 + -1*A + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0 && C >= 6] (?,1) 10. evalcomplexbb7in(A,B,C,D,E) -> evalcomplexbb8in(A,B,E,1 + D,E) [6 + D + -1*E >= 0 (?,1) && 7 + C + -1*E >= 0 && -2 + -1*C + E >= 0 && -2 + -1*A + E >= 0 && -1 + -1*C + D >= 0 && -1*B + D >= 0 && -1 + -1*A + D >= 0 && -1*A + C >= 0 && 29 + -1*B >= 0] Signature: {(evalcomplexbb10in,5) ;(evalcomplexbb1in,5) ;(evalcomplexbb7in,5) ;(evalcomplexbb8in,5) ;(evalcomplexbb9in,5) ;(evalcomplexentryin,5) ;(evalcomplexreturnin,5) ;(evalcomplexstart,5) ;(evalcomplexstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{5,6},4->{},5->{7},6->{8,9},7->{2,3},8->{10},9->{10},10->{5,6}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[3,7,5,10,8,6,9] c: [10] | `- p:[3,7,5] c: [7] YES