YES(?,POLY) * Step 1: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl111(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] (?,1) 2. lbl16(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] (?,1) 3. lbl111(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 4. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && 0 >= 1 + D && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 5. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 6. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] (?,1) 7. lbl82(A,B,C,D,E,F,G,H) -> lbl16(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] (?,1) 8. lbl82(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] (?,1) 9. lbl82(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 + A && A >= 1 && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] (?,1) 10. lbl82(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 && 0 >= 1 + A && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] (?,1) 11. lbl82(A,B,C,D,E,F,G,H) -> lbl82(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && F >= 0 && 0 >= 2 + F && 0 >= B && F >= 1 + B && D = 0 && H = 0 && A = 0] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lbl111,8);(lbl16,8);(lbl82,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3,4,5,6},2->{},3->{3,4,5,6},4->{7,8,9,10,11},5->{7,8,9,10,11},6->{7,8,9,10,11},7->{2},8->{3,4,5 ,6},9->{7,8,9,10,11},10->{7,8,9,10,11},11->{7,8,9,10,11},12->{0,1}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [4,9,10,11] * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl111(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] (?,1) 2. lbl16(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] (?,1) 3. lbl111(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 5. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 6. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] (?,1) 7. lbl82(A,B,C,D,E,F,G,H) -> lbl16(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] (?,1) 8. lbl82(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lbl111,8);(lbl16,8);(lbl82,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3,5,6},2->{},3->{3,5,6},5->{7,8},6->{7,8},7->{2},8->{3,5,6},12->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,6),(5,7),(8,6)] * Step 3: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl111(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] (?,1) 2. lbl16(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] (?,1) 3. lbl111(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 5. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] (?,1) 6. lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] (?,1) 7. lbl82(A,B,C,D,E,F,G,H) -> lbl16(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] (?,1) 8. lbl82(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] (?,1) 12. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True (1,1) Signature: {(lbl111,8);(lbl16,8);(lbl82,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3,5},2->{},3->{3,5,6},5->{8},6->{7,8},7->{2},8->{3,5},12->{0,1}] + Applied Processor: FromIts + Details: () * Step 4: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] start(A,B,C,D,E,F,G,H) -> lbl111(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] lbl16(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] lbl111(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111(A,B,C,D,E,F,G,H) -> lbl82(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl82(A,B,C,D,E,F,G,H) -> lbl16(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] lbl82(A,B,C,D,E,F,G,H) -> lbl111(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,G,G,A) True Signature: {(lbl111,8);(lbl16,8);(lbl82,8);(start,8);(start0,8);(stop,8)} Rule Graph: [0->{},1->{3,5},2->{},3->{3,5,6},5->{8},6->{7,8},7->{2},8->{3,5},12->{0,1}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F,G,H) -> stop.13(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] start.1(A,B,C,D,E,F,G,H) -> lbl111.3(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] start.1(A,B,C,D,E,F,G,H) -> lbl111.5(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] lbl16.2(A,B,C,D,E,F,G,H) -> stop.13(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.3(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.5(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.6(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.5(A,B,C,D,E,F,G,H) -> lbl82.8(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.6(A,B,C,D,E,F,G,H) -> lbl82.7(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl111.6(A,B,C,D,E,F,G,H) -> lbl82.8(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl82.7(A,B,C,D,E,F,G,H) -> lbl16.2(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] lbl82.8(A,B,C,D,E,F,G,H) -> lbl111.3(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] lbl82.8(A,B,C,D,E,F,G,H) -> lbl111.5(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] start0.12(A,B,C,D,E,F,G,H) -> start.0(A,C,C,E,E,G,G,A) True start0.12(A,B,C,D,E,F,G,H) -> start.1(A,C,C,E,E,G,G,A) True Signature: {(lbl111.3,8) ;(lbl111.5,8) ;(lbl111.6,8) ;(lbl16.2,8) ;(lbl82.7,8) ;(lbl82.8,8) ;(start.0,8) ;(start.1,8) ;(start0.12,8) ;(stop.13,8)} Rule Graph: [0->{},1->{4,5,6},2->{7},3->{},4->{4,5,6},5->{7},6->{8,9},7->{11,12},8->{10},9->{11,12},10->{3},11->{4,5 ,6},12->{7},13->{0},14->{1,2}] + Applied Processor: AddSinks + Details: () * Step 6: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F,G,H) -> stop.13(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] start.1(A,B,C,D,E,F,G,H) -> lbl111.3(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] start.1(A,B,C,D,E,F,G,H) -> lbl111.5(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] lbl16.2(A,B,C,D,E,F,G,H) -> stop.13(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.3(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.5(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.6(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.5(A,B,C,D,E,F,G,H) -> lbl82.8(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.6(A,B,C,D,E,F,G,H) -> lbl82.7(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl111.6(A,B,C,D,E,F,G,H) -> lbl82.8(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl82.7(A,B,C,D,E,F,G,H) -> lbl16.2(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] lbl82.8(A,B,C,D,E,F,G,H) -> lbl111.3(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] lbl82.8(A,B,C,D,E,F,G,H) -> lbl111.5(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] start0.12(A,B,C,D,E,F,G,H) -> start.0(A,C,C,E,E,G,G,A) True start0.12(A,B,C,D,E,F,G,H) -> start.1(A,C,C,E,E,G,G,A) True stop.13(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.13(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.13(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True Signature: {(exitus616,8) ;(lbl111.3,8) ;(lbl111.5,8) ;(lbl111.6,8) ;(lbl16.2,8) ;(lbl82.7,8) ;(lbl82.8,8) ;(start.0,8) ;(start.1,8) ;(start0.12,8) ;(stop.13,8)} Rule Graph: [0->{17},1->{4,5,6},2->{7},3->{15,16},4->{4,5,6},5->{7},6->{8,9},7->{11,12},8->{10},9->{11,12},10->{3} ,11->{4,5,6},12->{7},13->{0},14->{1,2}] + 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] | `- p:[4,11,7,5,12,9,6] c: [5,6,7,9,11,12] | `- p:[4] c: [4] * Step 7: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: start.0(A,B,C,D,E,F,G,H) -> stop.13(A,B,C,D,E,F,G,H) [1 >= A && B = C && D = E && F = G && H = A] start.1(A,B,C,D,E,F,G,H) -> lbl111.3(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] start.1(A,B,C,D,E,F,G,H) -> lbl111.5(A,H,C,1,E,-1 + H,G,H) [A >= 2 && B = C && D = E && F = G && H = A] lbl16.2(A,B,C,D,E,F,G,H) -> stop.13(A,B,C,D,E,F,G,H) [A >= 2 && A >= 1 + B && F = 0 && H = A && D = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.3(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.5(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.3(A,B,C,D,E,F,G,H) -> lbl111.6(A,B,C,D + -1*F,E,F,G,H) [D >= F && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.5(A,B,C,D,E,F,G,H) -> lbl82.8(A,B,C,H,E,-1 + F,G,H) [F >= 1 + D && D >= 1 && A >= 1 + F && A >= D + F && A >= B && F >= 1 && D >= 0 && H = A] lbl111.6(A,B,C,D,E,F,G,H) -> lbl82.7(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl111.6(A,B,C,D,E,F,G,H) -> lbl82.8(A,B + -1*F,C,H,E,-1 + F,G,H) [F >= 1 && A >= 1 + F && A >= F && A >= B && D = 0 && H = A] lbl82.7(A,B,C,D,E,F,G,H) -> lbl16.2(A,B,C,D,E,F,G,H) [A >= 2 && A >= B && A >= 1 + B && F = 0 && H = A && D = A] lbl82.8(A,B,C,D,E,F,G,H) -> lbl111.3(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] lbl82.8(A,B,C,D,E,F,G,H) -> lbl111.5(A,B,C,D + -1*F,E,F,G,H) [F >= 1 && A >= F && F >= 0 && A >= 2 + F && A >= B && A + F >= 1 + B && H = A && D = A] start0.12(A,B,C,D,E,F,G,H) -> start.0(A,C,C,E,E,G,G,A) True start0.12(A,B,C,D,E,F,G,H) -> start.1(A,C,C,E,E,G,G,A) True stop.13(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.13(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.13(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True Signature: {(exitus616,8) ;(lbl111.3,8) ;(lbl111.5,8) ;(lbl111.6,8) ;(lbl16.2,8) ;(lbl82.7,8) ;(lbl82.8,8) ;(start.0,8) ;(start.1,8) ;(start0.12,8) ;(stop.13,8)} Rule Graph: [0->{17},1->{4,5,6},2->{7},3->{15,16},4->{4,5,6},5->{7},6->{8,9},7->{11,12},8->{10},9->{11,12},10->{3} ,11->{4,5,6},12->{7},13->{0},14->{1,2}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] | `- p:[4,11,7,5,12,9,6] c: [5,6,7,9,11,12] | `- p:[4] c: [4]) + Applied Processor: AbstractSize Minimize + Details: () * Step 8: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0] start.0 ~> stop.13 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start.1 ~> lbl111.3 [A <= A, B <= H, C <= C, D <= K, E <= E, F <= H, G <= G, H <= H] start.1 ~> lbl111.5 [A <= A, B <= H, C <= C, D <= K, E <= E, F <= H, G <= G, H <= H] lbl16.2 ~> stop.13 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl111.3 ~> lbl111.3 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] lbl111.3 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] lbl111.3 ~> lbl111.6 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] lbl111.5 ~> lbl82.8 [A <= A, B <= B, C <= C, D <= H, E <= E, F <= A, G <= G, H <= H] lbl111.6 ~> lbl82.7 [A <= A, B <= A + B, C <= C, D <= H, E <= E, F <= H, G <= G, H <= H] lbl111.6 ~> lbl82.8 [A <= A, B <= A + B, C <= C, D <= H, E <= E, F <= H, G <= G, H <= H] lbl82.7 ~> lbl16.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl82.8 ~> lbl111.3 [A <= A, B <= B, C <= C, D <= H, E <= E, F <= F, G <= G, H <= H] lbl82.8 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= H, E <= E, F <= F, G <= G, H <= H] start0.12 ~> start.0 [A <= A, B <= C, C <= C, D <= E, E <= E, F <= G, G <= G, H <= A] start0.12 ~> start.1 [A <= A, B <= C, C <= C, D <= E, E <= E, F <= G, G <= G, H <= A] stop.13 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] stop.13 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] stop.13 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= K + F] lbl111.3 ~> lbl111.3 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] lbl82.8 ~> lbl111.3 [A <= A, B <= B, C <= C, D <= H, E <= E, F <= F, G <= G, H <= H] lbl111.5 ~> lbl82.8 [A <= A, B <= B, C <= C, D <= H, E <= E, F <= A, G <= G, H <= H] lbl111.3 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] lbl82.8 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= H, E <= E, F <= F, G <= G, H <= H] lbl111.6 ~> lbl82.8 [A <= A, B <= A + B, C <= C, D <= H, E <= E, F <= H, G <= G, H <= H] lbl111.3 ~> lbl111.6 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0.0 <= D] lbl111.3 ~> lbl111.3 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= H] + Applied Processor: AbstractFlow + Details: () * Step 9: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0] start.0 ~> stop.13 [] start.1 ~> lbl111.3 [H ~=> B,H ~=> F,K ~=> D] start.1 ~> lbl111.5 [H ~=> B,H ~=> F,K ~=> D] lbl16.2 ~> stop.13 [] lbl111.3 ~> lbl111.3 [A ~=> D] lbl111.3 ~> lbl111.5 [A ~=> D] lbl111.3 ~> lbl111.6 [A ~=> D] lbl111.5 ~> lbl82.8 [A ~=> F,H ~=> D] lbl111.6 ~> lbl82.7 [H ~=> D,H ~=> F,A ~+> B,B ~+> B] lbl111.6 ~> lbl82.8 [H ~=> D,H ~=> F,A ~+> B,B ~+> B] lbl82.7 ~> lbl16.2 [] lbl82.8 ~> lbl111.3 [H ~=> D] lbl82.8 ~> lbl111.5 [H ~=> D] start0.12 ~> start.0 [A ~=> H,C ~=> B,E ~=> D,G ~=> F] start0.12 ~> start.1 [A ~=> H,C ~=> B,E ~=> D,G ~=> F] stop.13 ~> exitus616 [] stop.13 ~> exitus616 [] stop.13 ~> exitus616 [] + Loop: [F ~+> 0.0,K ~+> 0.0] lbl111.3 ~> lbl111.3 [A ~=> D] lbl82.8 ~> lbl111.3 [H ~=> D] lbl111.5 ~> lbl82.8 [A ~=> F,H ~=> D] lbl111.3 ~> lbl111.5 [A ~=> D] lbl82.8 ~> lbl111.5 [H ~=> D] lbl111.6 ~> lbl82.8 [H ~=> D,H ~=> F,A ~+> B,B ~+> B] lbl111.3 ~> lbl111.6 [A ~=> D] + Loop: [D ~=> 0.0.0] lbl111.3 ~> lbl111.3 [A ~=> D] + Applied Processor: Lare + Details: start0.12 ~> exitus616 [A ~=> D ,A ~=> F ,A ~=> H ,A ~=> 0.0.0 ,C ~=> B ,E ~=> D ,G ~=> F ,K ~=> 0.0.0 ,A ~+> B ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> tick ,K ~*> B ,K ~*> tick] + lbl111.6> [A ~=> D ,A ~=> F ,A ~=> 0.0.0 ,D ~=> 0.0.0 ,H ~=> F ,H ~=> 0.0.0 ,A ~+> B ,A ~+> tick ,B ~+> B ,D ~+> tick ,F ~+> 0.0 ,F ~+> tick ,H ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> tick ,F ~*> B ,F ~*> tick ,H ~*> tick ,K ~*> B ,K ~*> tick] lbl111.6> [A ~=> D ,A ~=> F ,A ~=> 0.0.0 ,D ~=> 0.0.0 ,H ~=> F ,H ~=> 0.0.0 ,A ~+> B ,A ~+> tick ,B ~+> B ,D ~+> tick ,F ~+> 0.0 ,F ~+> tick ,H ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> tick ,F ~*> B ,F ~*> tick ,H ~*> tick ,K ~*> B ,K ~*> tick] + lbl111.3> [A ~=> D,D ~=> 0.0.0,D ~+> tick,tick ~+> tick] YES(?,POLY)