YES(?,POLY) * Step 1: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,7),(6,9)] * Step 2: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6},5->{13},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7},12->{4 ,5},13->{2,3},14->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6},5->{13},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7},12->{4 ,5},13->{2,3},14->{}] + Applied Processor: AddSinks + Details: () * Step 4: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] evalfstop(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6},5->{13},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7},12->{4 ,5},13->{2,3},14->{15}] + Applied Processor: Unfold + Details: () * Step 5: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: evalfstart.0(A,B,C,D,E) -> evalfentryin.1(A,B,C,D,E) True evalfentryin.1(A,B,C,D,E) -> evalfbb10in.2(B,A,C,D,E) True evalfentryin.1(A,B,C,D,E) -> evalfbb10in.3(B,A,C,D,E) True evalfbb10in.2(A,B,C,D,E) -> evalfbb8in.4(A,B,1,D,E) [B >= 1] evalfbb10in.2(A,B,C,D,E) -> evalfbb8in.5(A,B,1,D,E) [B >= 1] evalfbb10in.3(A,B,C,D,E) -> evalfreturnin.14(A,B,C,D,E) [0 >= B] evalfbb8in.4(A,B,C,D,E) -> evalfbb6in.6(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] evalfbb8in.5(A,B,C,D,E) -> evalfbb9in.13(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] evalfbb6in.6(A,B,C,D,E) -> evalfbb4in.8(A,B,C,D,1) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] evalfbb6in.7(A,B,C,D,E) -> evalfbb7in.12(A,B,C,D,E) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] evalfbb4in.8(A,B,C,D,E) -> evalfbb3in.10(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] evalfbb4in.9(A,B,C,D,E) -> evalfbb5in.11(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] evalfbb3in.10(A,B,C,D,E) -> evalfbb4in.8(A,B,C,D,1 + E) [D + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb3in.10(A,B,C,D,E) -> evalfbb4in.9(A,B,C,D,1 + E) [D + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in.11(A,B,C,D,E) -> evalfbb6in.6(A,B,C,1 + D,E) [-2 + E >= 0 && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in.11(A,B,C,D,E) -> evalfbb6in.7(A,B,C,1 + D,E) [-2 + E >= 0 && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb7in.12(A,B,C,D,E) -> evalfbb8in.4(A,B,1 + C,D,E) [-3 + D >= 0 && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb7in.12(A,B,C,D,E) -> evalfbb8in.5(A,B,1 + C,D,E) [-3 + D >= 0 && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb9in.13(A,B,C,D,E) -> evalfbb10in.2(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] evalfbb9in.13(A,B,C,D,E) -> evalfbb10in.3(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] evalfreturnin.14(A,B,C,D,E) -> evalfstop.15(A,B,C,D,E) [-1*B >= 0] evalfstop.15(A,B,C,D,E) -> exitus616.16(A,B,C,D,E) True Signature: {(evalfbb10in.2,5) ;(evalfbb10in.3,5) ;(evalfbb3in.10,5) ;(evalfbb4in.8,5) ;(evalfbb4in.9,5) ;(evalfbb5in.11,5) ;(evalfbb6in.6,5) ;(evalfbb6in.7,5) ;(evalfbb7in.12,5) ;(evalfbb8in.4,5) ;(evalfbb8in.5,5) ;(evalfbb9in.13,5) ;(evalfentryin.1,5) ;(evalfreturnin.14,5) ;(evalfstart.0,5) ;(evalfstop.15,5) ;(exitus616.16,5)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{20},6->{8},7->{18,19},8->{10},9->{16,17},10->{12,13},11->{14 ,15},12->{10},13->{11},14->{8},15->{9},16->{6},17->{7},18->{3,4},19->{5},20->{21},21->{}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21] | `- p:[3,18,7,4,17,9,15,11,13,10,8,6,16,14,12] c: [3,4,7,17,18] | `- p:[6,16,9,15,11,13,10,8,14,12] c: [6,9,15,16] | `- p:[8,14,11,13,10,12] c: [8,11,13,14] | `- p:[10,12] c: [10,12] * Step 6: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: evalfstart.0(A,B,C,D,E) -> evalfentryin.1(A,B,C,D,E) True evalfentryin.1(A,B,C,D,E) -> evalfbb10in.2(B,A,C,D,E) True evalfentryin.1(A,B,C,D,E) -> evalfbb10in.3(B,A,C,D,E) True evalfbb10in.2(A,B,C,D,E) -> evalfbb8in.4(A,B,1,D,E) [B >= 1] evalfbb10in.2(A,B,C,D,E) -> evalfbb8in.5(A,B,1,D,E) [B >= 1] evalfbb10in.3(A,B,C,D,E) -> evalfreturnin.14(A,B,C,D,E) [0 >= B] evalfbb8in.4(A,B,C,D,E) -> evalfbb6in.6(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] evalfbb8in.5(A,B,C,D,E) -> evalfbb9in.13(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] evalfbb6in.6(A,B,C,D,E) -> evalfbb4in.8(A,B,C,D,1) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] evalfbb6in.7(A,B,C,D,E) -> evalfbb7in.12(A,B,C,D,E) [-1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] evalfbb4in.8(A,B,C,D,E) -> evalfbb3in.10(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] evalfbb4in.9(A,B,C,D,E) -> evalfbb5in.11(A,B,C,D,E) [-1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] evalfbb3in.10(A,B,C,D,E) -> evalfbb4in.8(A,B,C,D,1 + E) [D + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb3in.10(A,B,C,D,E) -> evalfbb4in.9(A,B,C,D,1 + E) [D + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in.11(A,B,C,D,E) -> evalfbb6in.6(A,B,C,1 + D,E) [-2 + E >= 0 && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in.11(A,B,C,D,E) -> evalfbb6in.7(A,B,C,1 + D,E) [-2 + E >= 0 && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb7in.12(A,B,C,D,E) -> evalfbb8in.4(A,B,1 + C,D,E) [-3 + D >= 0 && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb7in.12(A,B,C,D,E) -> evalfbb8in.5(A,B,1 + C,D,E) [-3 + D >= 0 && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb9in.13(A,B,C,D,E) -> evalfbb10in.2(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] evalfbb9in.13(A,B,C,D,E) -> evalfbb10in.3(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] evalfreturnin.14(A,B,C,D,E) -> evalfstop.15(A,B,C,D,E) [-1*B >= 0] evalfstop.15(A,B,C,D,E) -> exitus616.16(A,B,C,D,E) True Signature: {(evalfbb10in.2,5) ;(evalfbb10in.3,5) ;(evalfbb3in.10,5) ;(evalfbb4in.8,5) ;(evalfbb4in.9,5) ;(evalfbb5in.11,5) ;(evalfbb6in.6,5) ;(evalfbb6in.7,5) ;(evalfbb7in.12,5) ;(evalfbb8in.4,5) ;(evalfbb8in.5,5) ;(evalfbb9in.13,5) ;(evalfentryin.1,5) ;(evalfreturnin.14,5) ;(evalfstart.0,5) ;(evalfstop.15,5) ;(exitus616.16,5)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{20},6->{8},7->{18,19},8->{10},9->{16,17},10->{12,13},11->{14 ,15},12->{10},13->{11},14->{8},15->{9},16->{6},17->{7},18->{3,4},19->{5},20->{21},21->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21] | `- p:[3,18,7,4,17,9,15,11,13,10,8,6,16,14,12] c: [3,4,7,17,18] | `- p:[6,16,9,15,11,13,10,8,14,12] c: [6,9,15,16] | `- p:[8,14,11,13,10,12] c: [8,11,13,14] | `- p:[10,12] c: [10,12]) + Applied Processor: AbstractSize NoMinimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalfstart.0 ~> evalfentryin.1 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfentryin.1 ~> evalfbb10in.2 [A <= B, B <= A, C <= C, D <= D, E <= E] evalfentryin.1 ~> evalfbb10in.3 [A <= B, B <= A, C <= C, D <= D, E <= E] evalfbb10in.2 ~> evalfbb8in.4 [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb10in.2 ~> evalfbb8in.5 [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb10in.3 ~> evalfreturnin.14 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb8in.4 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= B, E <= E] evalfbb8in.5 ~> evalfbb9in.13 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in.6 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb6in.7 ~> evalfbb7in.12 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in.8 ~> evalfbb3in.10 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in.9 ~> evalfbb5in.11 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in.10 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb3in.10 ~> evalfbb4in.9 [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb5in.11 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb5in.11 ~> evalfbb6in.7 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb7in.12 ~> evalfbb8in.4 [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb7in.12 ~> evalfbb8in.5 [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb9in.13 ~> evalfbb10in.2 [A <= A, B <= K + B, C <= C, D <= D, E <= E] evalfbb9in.13 ~> evalfbb10in.3 [A <= A, B <= K + B, C <= C, D <= D, E <= E] evalfreturnin.14 ~> evalfstop.15 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfstop.15 ~> exitus616.16 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= B] evalfbb10in.2 ~> evalfbb8in.4 [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb9in.13 ~> evalfbb10in.2 [A <= A, B <= K + B, C <= C, D <= D, E <= E] evalfbb8in.5 ~> evalfbb9in.13 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb10in.2 ~> evalfbb8in.5 [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb7in.12 ~> evalfbb8in.5 [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb6in.7 ~> evalfbb7in.12 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb5in.11 ~> evalfbb6in.7 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in.9 ~> evalfbb5in.11 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in.10 ~> evalfbb4in.9 [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb4in.8 ~> evalfbb3in.10 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in.6 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb8in.4 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= B, E <= E] evalfbb7in.12 ~> evalfbb8in.4 [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb5in.11 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb3in.10 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K + E] + Loop: [0.0.0 <= A + C] evalfbb8in.4 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= B, E <= E] evalfbb7in.12 ~> evalfbb8in.4 [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb6in.7 ~> evalfbb7in.12 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb5in.11 ~> evalfbb6in.7 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in.9 ~> evalfbb5in.11 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in.10 ~> evalfbb4in.9 [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb4in.8 ~> evalfbb3in.10 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in.6 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb5in.11 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb3in.10 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K + E] + Loop: [0.0.0.0 <= K + B + C + D] evalfbb6in.6 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb5in.11 ~> evalfbb6in.6 [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in.9 ~> evalfbb5in.11 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in.10 ~> evalfbb4in.9 [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb4in.8 ~> evalfbb3in.10 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in.10 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K + E] + Loop: [0.0.0.0.0 <= D + E] evalfbb4in.8 ~> evalfbb3in.10 [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in.10 ~> evalfbb4in.8 [A <= A, B <= B, C <= C, D <= D, E <= K + E] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalfstart.0 ~> evalfentryin.1 [] evalfentryin.1 ~> evalfbb10in.2 [A ~=> B,B ~=> A] evalfentryin.1 ~> evalfbb10in.3 [A ~=> B,B ~=> A] evalfbb10in.2 ~> evalfbb8in.4 [K ~=> C] evalfbb10in.2 ~> evalfbb8in.5 [K ~=> C] evalfbb10in.3 ~> evalfreturnin.14 [] evalfbb8in.4 ~> evalfbb6in.6 [B ~=> D] evalfbb8in.5 ~> evalfbb9in.13 [] evalfbb6in.6 ~> evalfbb4in.8 [K ~=> E] evalfbb6in.7 ~> evalfbb7in.12 [] evalfbb4in.8 ~> evalfbb3in.10 [] evalfbb4in.9 ~> evalfbb5in.11 [] evalfbb3in.10 ~> evalfbb4in.8 [E ~+> E,K ~+> E] evalfbb3in.10 ~> evalfbb4in.9 [E ~+> E,K ~+> E] evalfbb5in.11 ~> evalfbb6in.6 [D ~+> D,K ~+> D] evalfbb5in.11 ~> evalfbb6in.7 [D ~+> D,K ~+> D] evalfbb7in.12 ~> evalfbb8in.4 [C ~+> C,K ~*> C] evalfbb7in.12 ~> evalfbb8in.5 [C ~+> C,K ~*> C] evalfbb9in.13 ~> evalfbb10in.2 [B ~+> B,K ~+> B] evalfbb9in.13 ~> evalfbb10in.3 [B ~+> B,K ~+> B] evalfreturnin.14 ~> evalfstop.15 [] evalfstop.15 ~> exitus616.16 [] + Loop: [B ~=> 0.0] evalfbb10in.2 ~> evalfbb8in.4 [K ~=> C] evalfbb9in.13 ~> evalfbb10in.2 [B ~+> B,K ~+> B] evalfbb8in.5 ~> evalfbb9in.13 [] evalfbb10in.2 ~> evalfbb8in.5 [K ~=> C] evalfbb7in.12 ~> evalfbb8in.5 [C ~+> C,K ~*> C] evalfbb6in.7 ~> evalfbb7in.12 [] evalfbb5in.11 ~> evalfbb6in.7 [D ~+> D,K ~+> D] evalfbb4in.9 ~> evalfbb5in.11 [] evalfbb3in.10 ~> evalfbb4in.9 [E ~+> E,K ~+> E] evalfbb4in.8 ~> evalfbb3in.10 [] evalfbb6in.6 ~> evalfbb4in.8 [K ~=> E] evalfbb8in.4 ~> evalfbb6in.6 [B ~=> D] evalfbb7in.12 ~> evalfbb8in.4 [C ~+> C,K ~*> C] evalfbb5in.11 ~> evalfbb6in.6 [D ~+> D,K ~+> D] evalfbb3in.10 ~> evalfbb4in.8 [E ~+> E,K ~+> E] + Loop: [A ~+> 0.0.0,C ~+> 0.0.0] evalfbb8in.4 ~> evalfbb6in.6 [B ~=> D] evalfbb7in.12 ~> evalfbb8in.4 [C ~+> C,K ~*> C] evalfbb6in.7 ~> evalfbb7in.12 [] evalfbb5in.11 ~> evalfbb6in.7 [D ~+> D,K ~+> D] evalfbb4in.9 ~> evalfbb5in.11 [] evalfbb3in.10 ~> evalfbb4in.9 [E ~+> E,K ~+> E] evalfbb4in.8 ~> evalfbb3in.10 [] evalfbb6in.6 ~> evalfbb4in.8 [K ~=> E] evalfbb5in.11 ~> evalfbb6in.6 [D ~+> D,K ~+> D] evalfbb3in.10 ~> evalfbb4in.8 [E ~+> E,K ~+> E] + Loop: [B ~+> 0.0.0.0,C ~+> 0.0.0.0,D ~+> 0.0.0.0,K ~+> 0.0.0.0] evalfbb6in.6 ~> evalfbb4in.8 [K ~=> E] evalfbb5in.11 ~> evalfbb6in.6 [D ~+> D,K ~+> D] evalfbb4in.9 ~> evalfbb5in.11 [] evalfbb3in.10 ~> evalfbb4in.9 [E ~+> E,K ~+> E] evalfbb4in.8 ~> evalfbb3in.10 [] evalfbb3in.10 ~> evalfbb4in.8 [E ~+> E,K ~+> E] + Loop: [D ~+> 0.0.0.0.0,E ~+> 0.0.0.0.0] evalfbb4in.8 ~> evalfbb3in.10 [] evalfbb3in.10 ~> evalfbb4in.8 [E ~+> E,K ~+> E] + Applied Processor: Lare + Details: evalfstart.0 ~> exitus616.16 [A ~=> B ,A ~=> 0.0 ,B ~=> A ,K ~=> C ,A ~+> B ,A ~+> D ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> D ,A ~*> E ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick] + evalfbb9in.13> [B ~=> 0.0 ,K ~=> C ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> D ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> B ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick] + evalfbb7in.12> [A ~+> 0.0.0 ,A ~+> tick ,B ~+> D ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,C ~*> C ,C ~*> D ,C ~*> E ,C ~*> 0.0.0.0 ,C ~*> 0.0.0.0.0 ,C ~*> tick ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick] + evalfbb5in.11> [B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> 0.0.0.0 ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0.0 ,B ~*> tick ,C ~*> D ,C ~*> E ,C ~*> 0.0.0.0.0 ,C ~*> tick ,D ~*> D ,D ~*> E ,D ~*> 0.0.0.0.0 ,D ~*> tick ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0.0 ,K ~*> tick] + evalfbb3in.10> [D ~+> 0.0.0.0.0 ,D ~+> tick ,E ~+> E ,E ~+> 0.0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> E ,D ~*> E ,E ~*> E ,K ~*> E] YES(?,POLY)