YES(?,POLY) * Step 1: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F) -> evalfentryin(A,B,C,D,E,F) True (1,1) 1. evalfentryin(A,B,C,D,E,F) -> evalfbb7in(B,C,D,A,E,F) True (?,1) 2. evalfbb7in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,B,F) [A >= D] (?,1) 3. evalfbb7in(A,B,C,D,E,F) -> evalfreturnin(A,B,C,D,E,F) [D >= 1 + A] (?,1) 4. evalfbb5in(A,B,C,D,E,F) -> evalfbb1in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] (?,1) 5. evalfbb5in(A,B,C,D,E,F) -> evalfbb6in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] (?,1) 6. evalfbb1in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] (?,1) 7. evalfbb3in(A,B,C,D,E,F) -> evalfbb2in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] (?,1) 8. evalfbb3in(A,B,C,D,E,F) -> evalfbb4in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] (?,1) 9. evalfbb2in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] (?,1) 10. evalfbb4in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] (?,1) 11. evalfbb6in(A,B,C,D,E,F) -> evalfbb7in(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] (?,1) 12. evalfreturnin(A,B,C,D,E,F) -> evalfstop(A,B,C,D,E,F) [-1 + -1*A + D >= 0] (?,1) Signature: {(evalfbb1in,6) ;(evalfbb2in,6) ;(evalfbb3in,6) ;(evalfbb4in,6) ;(evalfbb5in,6) ;(evalfbb6in,6) ;(evalfbb7in,6) ;(evalfentryin,6) ;(evalfreturnin,6) ;(evalfstart,6) ;(evalfstop,6)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{12},4->{6},5->{11},6->{7,8},7->{9},8->{10},9->{7,8},10->{4,5},11->{2,3} ,12->{}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: evalfstart(A,B,C,D,E,F) -> evalfentryin(A,B,C,D,E,F) True evalfentryin(A,B,C,D,E,F) -> evalfbb7in(B,C,D,A,E,F) True evalfbb7in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,B,F) [A >= D] evalfbb7in(A,B,C,D,E,F) -> evalfreturnin(A,B,C,D,E,F) [D >= 1 + A] evalfbb5in(A,B,C,D,E,F) -> evalfbb1in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] evalfbb5in(A,B,C,D,E,F) -> evalfbb6in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] evalfbb1in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb3in(A,B,C,D,E,F) -> evalfbb2in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] evalfbb3in(A,B,C,D,E,F) -> evalfbb4in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] evalfbb2in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb6in(A,B,C,D,E,F) -> evalfbb7in(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfreturnin(A,B,C,D,E,F) -> evalfstop(A,B,C,D,E,F) [-1 + -1*A + D >= 0] Signature: {(evalfbb1in,6) ;(evalfbb2in,6) ;(evalfbb3in,6) ;(evalfbb4in,6) ;(evalfbb5in,6) ;(evalfbb6in,6) ;(evalfbb7in,6) ;(evalfentryin,6) ;(evalfreturnin,6) ;(evalfstart,6) ;(evalfstop,6)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{12},4->{6},5->{11},6->{7,8},7->{9},8->{10},9->{7,8},10->{4,5},11->{2,3} ,12->{}] + Applied Processor: AddSinks + Details: () * Step 3: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: evalfstart(A,B,C,D,E,F) -> evalfentryin(A,B,C,D,E,F) True evalfentryin(A,B,C,D,E,F) -> evalfbb7in(B,C,D,A,E,F) True evalfbb7in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,B,F) [A >= D] evalfbb7in(A,B,C,D,E,F) -> evalfreturnin(A,B,C,D,E,F) [D >= 1 + A] evalfbb5in(A,B,C,D,E,F) -> evalfbb1in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] evalfbb5in(A,B,C,D,E,F) -> evalfbb6in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] evalfbb1in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb3in(A,B,C,D,E,F) -> evalfbb2in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] evalfbb3in(A,B,C,D,E,F) -> evalfbb4in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] evalfbb2in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb6in(A,B,C,D,E,F) -> evalfbb7in(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfreturnin(A,B,C,D,E,F) -> evalfstop(A,B,C,D,E,F) [-1 + -1*A + D >= 0] evalfstop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(evalfbb1in,6) ;(evalfbb2in,6) ;(evalfbb3in,6) ;(evalfbb4in,6) ;(evalfbb5in,6) ;(evalfbb6in,6) ;(evalfbb7in,6) ;(evalfentryin,6) ;(evalfreturnin,6) ;(evalfstart,6) ;(evalfstop,6) ;(exitus616,6)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{12},4->{6},5->{11},6->{7,8},7->{9},8->{10},9->{7,8},10->{4,5},11->{2,3} ,12->{13}] + Applied Processor: Unfold + Details: () * Step 4: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: evalfstart.0(A,B,C,D,E,F) -> evalfentryin.1(A,B,C,D,E,F) True evalfentryin.1(A,B,C,D,E,F) -> evalfbb7in.2(B,C,D,A,E,F) True evalfentryin.1(A,B,C,D,E,F) -> evalfbb7in.3(B,C,D,A,E,F) True evalfbb7in.2(A,B,C,D,E,F) -> evalfbb5in.4(A,B,C,D,B,F) [A >= D] evalfbb7in.2(A,B,C,D,E,F) -> evalfbb5in.5(A,B,C,D,B,F) [A >= D] evalfbb7in.3(A,B,C,D,E,F) -> evalfreturnin.12(A,B,C,D,E,F) [D >= 1 + A] evalfbb5in.4(A,B,C,D,E,F) -> evalfbb1in.6(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] evalfbb5in.5(A,B,C,D,E,F) -> evalfbb6in.11(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] evalfbb1in.6(A,B,C,D,E,F) -> evalfbb3in.7(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb1in.6(A,B,C,D,E,F) -> evalfbb3in.8(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb3in.7(A,B,C,D,E,F) -> evalfbb2in.9(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] evalfbb3in.8(A,B,C,D,E,F) -> evalfbb4in.10(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] evalfbb2in.9(A,B,C,D,E,F) -> evalfbb3in.7(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb2in.9(A,B,C,D,E,F) -> evalfbb3in.8(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in.10(A,B,C,D,E,F) -> evalfbb5in.4(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in.10(A,B,C,D,E,F) -> evalfbb5in.5(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb6in.11(A,B,C,D,E,F) -> evalfbb7in.2(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfbb6in.11(A,B,C,D,E,F) -> evalfbb7in.3(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfreturnin.12(A,B,C,D,E,F) -> evalfstop.13(A,B,C,D,E,F) [-1 + -1*A + D >= 0] evalfstop.13(A,B,C,D,E,F) -> exitus616.14(A,B,C,D,E,F) True Signature: {(evalfbb1in.6,6) ;(evalfbb2in.9,6) ;(evalfbb3in.7,6) ;(evalfbb3in.8,6) ;(evalfbb4in.10,6) ;(evalfbb5in.4,6) ;(evalfbb5in.5,6) ;(evalfbb6in.11,6) ;(evalfbb7in.2,6) ;(evalfbb7in.3,6) ;(evalfentryin.1,6) ;(evalfreturnin.12,6) ;(evalfstart.0,6) ;(evalfstop.13,6) ;(exitus616.14,6)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{18},6->{8,9},7->{16,17},8->{10},9->{11},10->{12,13},11->{14 ,15},12->{10},13->{11},14->{6},15->{7},16->{3,4},17->{5},18->{19},19->{}] + 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] | `- p:[3,16,7,4,15,11,9,6,14,13,10,8,12] c: [3,4,7,15,16] | `- p:[6,14,11,9,13,10,8,12] c: [6,8,9,11,13,14] | `- p:[10,12] c: [10,12] * Step 5: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: evalfstart.0(A,B,C,D,E,F) -> evalfentryin.1(A,B,C,D,E,F) True evalfentryin.1(A,B,C,D,E,F) -> evalfbb7in.2(B,C,D,A,E,F) True evalfentryin.1(A,B,C,D,E,F) -> evalfbb7in.3(B,C,D,A,E,F) True evalfbb7in.2(A,B,C,D,E,F) -> evalfbb5in.4(A,B,C,D,B,F) [A >= D] evalfbb7in.2(A,B,C,D,E,F) -> evalfbb5in.5(A,B,C,D,B,F) [A >= D] evalfbb7in.3(A,B,C,D,E,F) -> evalfreturnin.12(A,B,C,D,E,F) [D >= 1 + A] evalfbb5in.4(A,B,C,D,E,F) -> evalfbb1in.6(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] evalfbb5in.5(A,B,C,D,E,F) -> evalfbb6in.11(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] evalfbb1in.6(A,B,C,D,E,F) -> evalfbb3in.7(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb1in.6(A,B,C,D,E,F) -> evalfbb3in.8(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb3in.7(A,B,C,D,E,F) -> evalfbb2in.9(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] evalfbb3in.8(A,B,C,D,E,F) -> evalfbb4in.10(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] evalfbb2in.9(A,B,C,D,E,F) -> evalfbb3in.7(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb2in.9(A,B,C,D,E,F) -> evalfbb3in.8(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in.10(A,B,C,D,E,F) -> evalfbb5in.4(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in.10(A,B,C,D,E,F) -> evalfbb5in.5(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb6in.11(A,B,C,D,E,F) -> evalfbb7in.2(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfbb6in.11(A,B,C,D,E,F) -> evalfbb7in.3(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfreturnin.12(A,B,C,D,E,F) -> evalfstop.13(A,B,C,D,E,F) [-1 + -1*A + D >= 0] evalfstop.13(A,B,C,D,E,F) -> exitus616.14(A,B,C,D,E,F) True Signature: {(evalfbb1in.6,6) ;(evalfbb2in.9,6) ;(evalfbb3in.7,6) ;(evalfbb3in.8,6) ;(evalfbb4in.10,6) ;(evalfbb5in.4,6) ;(evalfbb5in.5,6) ;(evalfbb6in.11,6) ;(evalfbb7in.2,6) ;(evalfbb7in.3,6) ;(evalfentryin.1,6) ;(evalfreturnin.12,6) ;(evalfstart.0,6) ;(evalfstop.13,6) ;(exitus616.14,6)} Rule Graph: [0->{1,2},1->{3,4},2->{5},3->{6},4->{7},5->{18},6->{8,9},7->{16,17},8->{10},9->{11},10->{12,13},11->{14 ,15},12->{10},13->{11},14->{6},15->{7},16->{3,4},17->{5},18->{19},19->{}] ,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] | `- p:[3,16,7,4,15,11,9,6,14,13,10,8,12] c: [3,4,7,15,16] | `- p:[6,14,11,9,13,10,8,12] c: [6,8,9,11,13,14] | `- p:[10,12] c: [10,12]) + Applied Processor: AbstractSize Minimize + Details: () * Step 6: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.0.0,0.0.0.0] evalfstart.0 ~> evalfentryin.1 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfentryin.1 ~> evalfbb7in.2 [A <= B, B <= C, C <= D, D <= A, E <= E, F <= F] evalfentryin.1 ~> evalfbb7in.3 [A <= B, B <= C, C <= D, D <= A, E <= E, F <= F] evalfbb7in.2 ~> evalfbb5in.4 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] evalfbb7in.2 ~> evalfbb5in.5 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] evalfbb7in.3 ~> evalfreturnin.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb5in.4 ~> evalfbb1in.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb5in.5 ~> evalfbb6in.11 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb1in.6 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= D + E] evalfbb1in.6 ~> evalfbb3in.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= D + E] evalfbb3in.7 ~> evalfbb2in.9 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb3in.8 ~> evalfbb4in.10 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb2in.9 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] evalfbb2in.9 ~> evalfbb3in.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] evalfbb4in.10 ~> evalfbb5in.4 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F] evalfbb4in.10 ~> evalfbb5in.5 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F] evalfbb6in.11 ~> evalfbb7in.2 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F] evalfbb6in.11 ~> evalfbb7in.3 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F] evalfreturnin.12 ~> evalfstop.13 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfstop.13 ~> exitus616.14 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= A + D] evalfbb7in.2 ~> evalfbb5in.4 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] evalfbb6in.11 ~> evalfbb7in.2 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F] evalfbb5in.5 ~> evalfbb6in.11 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb7in.2 ~> evalfbb5in.5 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] evalfbb4in.10 ~> evalfbb5in.5 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F] evalfbb3in.8 ~> evalfbb4in.10 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb1in.6 ~> evalfbb3in.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= D + E] evalfbb5in.4 ~> evalfbb1in.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb4in.10 ~> evalfbb5in.4 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F] evalfbb2in.9 ~> evalfbb3in.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] evalfbb3in.7 ~> evalfbb2in.9 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb1in.6 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= D + E] evalfbb2in.9 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] + Loop: [0.0.0 <= C + E] evalfbb5in.4 ~> evalfbb1in.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb4in.10 ~> evalfbb5in.4 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F] evalfbb3in.8 ~> evalfbb4in.10 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb1in.6 ~> evalfbb3in.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= D + E] evalfbb2in.9 ~> evalfbb3in.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] evalfbb3in.7 ~> evalfbb2in.9 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb1in.6 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= D + E] evalfbb2in.9 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] + Loop: [0.0.0.0 <= K + D + E + F] evalfbb3in.7 ~> evalfbb2in.9 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] evalfbb2in.9 ~> evalfbb3in.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F] + Applied Processor: AbstractFlow + Details: () * Step 7: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.0.0,0.0.0.0] evalfstart.0 ~> evalfentryin.1 [] evalfentryin.1 ~> evalfbb7in.2 [A ~=> D,B ~=> A,C ~=> B,D ~=> C] evalfentryin.1 ~> evalfbb7in.3 [A ~=> D,B ~=> A,C ~=> B,D ~=> C] evalfbb7in.2 ~> evalfbb5in.4 [B ~=> E] evalfbb7in.2 ~> evalfbb5in.5 [B ~=> E] evalfbb7in.3 ~> evalfreturnin.12 [] evalfbb5in.4 ~> evalfbb1in.6 [] evalfbb5in.5 ~> evalfbb6in.11 [] evalfbb1in.6 ~> evalfbb3in.7 [D ~+> F,E ~+> F] evalfbb1in.6 ~> evalfbb3in.8 [D ~+> F,E ~+> F] evalfbb3in.7 ~> evalfbb2in.9 [] evalfbb3in.8 ~> evalfbb4in.10 [] evalfbb2in.9 ~> evalfbb3in.7 [F ~+> F,K ~+> F] evalfbb2in.9 ~> evalfbb3in.8 [F ~+> F,K ~+> F] evalfbb4in.10 ~> evalfbb5in.4 [E ~+> E,K ~+> E] evalfbb4in.10 ~> evalfbb5in.5 [E ~+> E,K ~+> E] evalfbb6in.11 ~> evalfbb7in.2 [D ~+> D,K ~+> D] evalfbb6in.11 ~> evalfbb7in.3 [D ~+> D,K ~+> D] evalfreturnin.12 ~> evalfstop.13 [] evalfstop.13 ~> exitus616.14 [] + Loop: [A ~+> 0.0,D ~+> 0.0] evalfbb7in.2 ~> evalfbb5in.4 [B ~=> E] evalfbb6in.11 ~> evalfbb7in.2 [D ~+> D,K ~+> D] evalfbb5in.5 ~> evalfbb6in.11 [] evalfbb7in.2 ~> evalfbb5in.5 [B ~=> E] evalfbb4in.10 ~> evalfbb5in.5 [E ~+> E,K ~+> E] evalfbb3in.8 ~> evalfbb4in.10 [] evalfbb1in.6 ~> evalfbb3in.8 [D ~+> F,E ~+> F] evalfbb5in.4 ~> evalfbb1in.6 [] evalfbb4in.10 ~> evalfbb5in.4 [E ~+> E,K ~+> E] evalfbb2in.9 ~> evalfbb3in.8 [F ~+> F,K ~+> F] evalfbb3in.7 ~> evalfbb2in.9 [] evalfbb1in.6 ~> evalfbb3in.7 [D ~+> F,E ~+> F] evalfbb2in.9 ~> evalfbb3in.7 [F ~+> F,K ~+> F] + Loop: [C ~+> 0.0.0,E ~+> 0.0.0] evalfbb5in.4 ~> evalfbb1in.6 [] evalfbb4in.10 ~> evalfbb5in.4 [E ~+> E,K ~+> E] evalfbb3in.8 ~> evalfbb4in.10 [] evalfbb1in.6 ~> evalfbb3in.8 [D ~+> F,E ~+> F] evalfbb2in.9 ~> evalfbb3in.8 [F ~+> F,K ~+> F] evalfbb3in.7 ~> evalfbb2in.9 [] evalfbb1in.6 ~> evalfbb3in.7 [D ~+> F,E ~+> F] evalfbb2in.9 ~> evalfbb3in.7 [F ~+> F,K ~+> F] + Loop: [D ~+> 0.0.0.0,E ~+> 0.0.0.0,F ~+> 0.0.0.0,K ~+> 0.0.0.0] evalfbb3in.7 ~> evalfbb2in.9 [] evalfbb2in.9 ~> evalfbb3in.7 [F ~+> F,K ~+> F] + Applied Processor: Lare + Details: evalfstart.0 ~> exitus616.14 [A ~=> D ,B ~=> A ,C ~=> B ,C ~=> E ,D ~=> C ,A ~+> D ,A ~+> F ,A ~+> 0.0 ,A ~+> 0.0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,C ~+> E ,C ~+> F ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> 0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> F ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> D ,A ~*> F ,A ~*> 0.0.0.0 ,A ~*> tick ,B ~*> D ,B ~*> F ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> E ,C ~*> F ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> E ,D ~*> F ,D ~*> 0.0.0.0 ,D ~*> tick ,K ~*> D ,K ~*> E ,K ~*> F ,K ~*> 0.0.0.0 ,K ~*> tick] + evalfbb6in.11> [B ~=> E ,A ~+> 0.0 ,A ~+> tick ,B ~+> E ,B ~+> F ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> F ,D ~+> 0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> F ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> D ,A ~*> F ,A ~*> 0.0.0.0 ,A ~*> tick ,B ~*> E ,B ~*> F ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> E ,C ~*> F ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> D ,D ~*> F ,D ~*> 0.0.0.0 ,D ~*> tick ,K ~*> D ,K ~*> E ,K ~*> F ,K ~*> 0.0.0.0 ,K ~*> tick] + evalfbb4in.10> [C ~+> 0.0.0 ,C ~+> tick ,D ~+> F ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> E ,E ~+> F ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> E ,K ~+> F ,K ~+> 0.0.0.0 ,K ~+> tick ,C ~*> E ,C ~*> F ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> F ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> E ,E ~*> F ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> E ,K ~*> F ,K ~*> 0.0.0.0 ,K ~*> tick] + evalfbb2in.9> [D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> 0.0.0.0 ,E ~+> tick ,F ~+> F ,F ~+> 0.0.0.0 ,F ~+> tick ,tick ~+> tick ,K ~+> F ,K ~+> 0.0.0.0 ,K ~+> tick ,D ~*> F ,E ~*> F ,F ~*> F ,K ~*> F] YES(?,POLY)