YES(?,O(n^1)) * Step 1: FromIts WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb5in(0,0,0,D,E,F,G) True (?,1) 2. evalfbb5in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= D] (?,1) 3. evalfbb5in(A,B,C,D,E,F,G) -> evalfbbin(A,B,C,D,1 + C,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && D >= 1 + C] (?,1) 4. evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 (?,1) && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= 1 + H] 5. evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 (?,1) && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && H >= 1] 6. evalfbbin(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,A,G) [D + -1*E >= 0 (?,1) && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] 7. evalfbb1in(A,B,C,D,E,F,G) -> evalfbb5in(A,1 + F,E,D,E,F,G) [F >= 0 (?,1) && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] 8. evalfbb1in(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] 9. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb5in(1 + F,B,E,D,E,F,G) [F >= 0 (?,1) && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] 11. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [C + -1*D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] (?,1) Signature: {(evalfbb1in,7) ;(evalfbb3in,7) ;(evalfbb5in,7) ;(evalfbbin,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{9,10},7->{2,3},8->{7,8},9->{2,3},10->{9,10} ,11->{}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True evalfentryin(A,B,C,D,E,F,G) -> evalfbb5in(0,0,0,D,E,F,G) True evalfbb5in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= D] evalfbb5in(A,B,C,D,E,F,G) -> evalfbbin(A,B,C,D,1 + C,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && D >= 1 + C] evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= 1 + H] evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && H >= 1] evalfbbin(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,A,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] evalfbb1in(A,B,C,D,E,F,G) -> evalfbb5in(A,1 + F,E,D,E,F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] evalfbb1in(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,1 + F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] evalfbb3in(A,B,C,D,E,F,G) -> evalfbb5in(1 + F,B,E,D,E,F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] evalfbb3in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,1 + F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [C + -1*D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] Signature: {(evalfbb1in,7) ;(evalfbb3in,7) ;(evalfbb5in,7) ;(evalfbbin,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Rule Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{9,10},7->{2,3},8->{7,8},9->{2,3},10->{9,10} ,11->{}] + Applied Processor: AddSinks + Details: () * Step 3: Decompose WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True evalfentryin(A,B,C,D,E,F,G) -> evalfbb5in(0,0,0,D,E,F,G) True evalfbb5in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= D] evalfbb5in(A,B,C,D,E,F,G) -> evalfbbin(A,B,C,D,1 + C,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && D >= 1 + C] evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= 1 + H] evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && H >= 1] evalfbbin(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,A,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] evalfbb1in(A,B,C,D,E,F,G) -> evalfbb5in(A,1 + F,E,D,E,F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] evalfbb1in(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,1 + F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] evalfbb3in(A,B,C,D,E,F,G) -> evalfbb5in(1 + F,B,E,D,E,F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] evalfbb3in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,1 + F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [C + -1*D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] evalfstop(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(evalfbb1in,7) ;(evalfbb3in,7) ;(evalfbb5in,7) ;(evalfbbin,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7) ;(exitus616,7)} Rule Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{9,10},7->{2,3},8->{7,8},9->{2,3},10->{9,10} ,11->{12}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[3,7,4,5,8,9,6,10] c: [3,4,5,6,7,8,9,10] * Step 4: AbstractSize WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True evalfentryin(A,B,C,D,E,F,G) -> evalfbb5in(0,0,0,D,E,F,G) True evalfbb5in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= D] evalfbb5in(A,B,C,D,E,F,G) -> evalfbbin(A,B,C,D,1 + C,F,G) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && D >= 1 + C] evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= 1 + H] evalfbbin(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,B,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && H >= 1] evalfbbin(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,A,G) [D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] evalfbb1in(A,B,C,D,E,F,G) -> evalfbb5in(A,1 + F,E,D,E,F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] evalfbb1in(A,B,C,D,E,F,G) -> evalfbb1in(A,B,C,D,E,1 + F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && -1*B + F >= 0 && A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] evalfbb3in(A,B,C,D,E,F,G) -> evalfbb5in(1 + F,B,E,D,E,F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && F >= G] evalfbb3in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,1 + F,G) [F >= 0 && -1 + E + F >= 0 && -1 + D + F >= 0 && C + F >= 0 && B + F >= 0 && A + F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && 1 + C + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -1 + C + E >= 0 && -1 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + A + E >= 0 && -1 + D >= 0 && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -1 + A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0 && G >= 1 + F] evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [C + -1*D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && A >= 0] evalfstop(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(evalfbb1in,7) ;(evalfbb3in,7) ;(evalfbb5in,7) ;(evalfbbin,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7) ;(exitus616,7)} Rule Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{9,10},7->{2,3},8->{7,8},9->{2,3},10->{9,10} ,11->{12}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[3,7,4,5,8,9,6,10] c: [3,4,5,6,7,8,9,10]) + Applied Processor: AbstractSize Minimize + Details: () * Step 5: AbstractFlow WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,0.0] evalfstart ~> evalfentryin [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] evalfentryin ~> evalfbb5in [A <= 0*K, B <= 0*K, C <= 0*K, D <= D, E <= E, F <= F, G <= G] evalfbb5in ~> evalfreturnin [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] evalfbb5in ~> evalfbbin [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= A, G <= G] evalfbb1in ~> evalfbb5in [A <= A, B <= E + F, C <= E, D <= D, E <= E, F <= F, G <= G] evalfbb1in ~> evalfbb1in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= G, G <= G] evalfbb3in ~> evalfbb5in [A <= E + F, B <= B, C <= E, D <= D, E <= E, F <= F, G <= G] evalfbb3in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= G, G <= G] evalfreturnin ~> evalfstop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] evalfstop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0 <= A + B + C + D + G] evalfbb5in ~> evalfbbin [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G] evalfbb1in ~> evalfbb5in [A <= A, B <= E + F, C <= E, D <= D, E <= E, F <= F, G <= G] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] evalfbb1in ~> evalfbb1in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= G, G <= G] evalfbb3in ~> evalfbb5in [A <= E + F, B <= B, C <= E, D <= D, E <= E, F <= F, G <= G] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= A, G <= G] evalfbb3in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E, F <= G, G <= G] + Applied Processor: AbstractFlow + Details: () * Step 6: Lare WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,0.0] evalfstart ~> evalfentryin [] evalfentryin ~> evalfbb5in [K ~=> A,K ~=> B,K ~=> C] evalfbb5in ~> evalfreturnin [] evalfbb5in ~> evalfbbin [D ~=> E] evalfbbin ~> evalfbb1in [B ~=> F] evalfbbin ~> evalfbb1in [B ~=> F] evalfbbin ~> evalfbb3in [A ~=> F] evalfbb1in ~> evalfbb5in [E ~=> C,E ~+> B,F ~+> B] evalfbb1in ~> evalfbb1in [G ~=> F] evalfbb3in ~> evalfbb5in [E ~=> C,E ~+> A,F ~+> A] evalfbb3in ~> evalfbb3in [G ~=> F] evalfreturnin ~> evalfstop [] evalfstop ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,C ~+> 0.0,D ~+> 0.0,G ~+> 0.0] evalfbb5in ~> evalfbbin [D ~=> E] evalfbb1in ~> evalfbb5in [E ~=> C,E ~+> B,F ~+> B] evalfbbin ~> evalfbb1in [B ~=> F] evalfbbin ~> evalfbb1in [B ~=> F] evalfbb1in ~> evalfbb1in [G ~=> F] evalfbb3in ~> evalfbb5in [E ~=> C,E ~+> A,F ~+> A] evalfbbin ~> evalfbb3in [A ~=> F] evalfbb3in ~> evalfbb3in [G ~=> F] + Applied Processor: Lare + Details: evalfstart ~> exitus616 [D ~=> C ,D ~=> E ,G ~=> F ,K ~=> A ,K ~=> B ,K ~=> C ,K ~=> F ,D ~+> A ,D ~+> B ,D ~+> F ,D ~+> 0.0 ,D ~+> tick ,G ~+> A ,G ~+> B ,G ~+> F ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> F ,K ~+> 0.0 ,K ~+> tick ,D ~*> A ,D ~*> B ,D ~*> F ,G ~*> A ,G ~*> B ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> tick] + evalfbb5in> [A ~=> F ,B ~=> F ,D ~=> C ,D ~=> E ,G ~=> F ,A ~+> A ,A ~+> F ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> F ,B ~+> 0.0 ,B ~+> tick ,C ~+> 0.0 ,C ~+> tick ,D ~+> A ,D ~+> B ,D ~+> F ,D ~+> 0.0 ,D ~+> tick ,G ~+> A ,G ~+> B ,G ~+> F ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,A ~*> A ,A ~*> B ,B ~*> A ,B ~*> B ,C ~*> A ,C ~*> B ,D ~*> A ,D ~*> B ,D ~*> F ,G ~*> A ,G ~*> B] YES(?,O(n^1))