YES(?,POLY) * Step 1: TrivialSCCs 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) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 4. lbl121(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [G >= C && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 9. lbl141(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [0 >= A && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{4,5,6},3->{},4->{10},5->{4,5,6},6->{7,8,9},7->{10},8->{4,5,6},9->{7,8,9},10->{},11->{0,1 ,2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: 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) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (1,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (1,1) 4. lbl121(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [G >= C && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (1,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (1,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 9. lbl141(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [0 >= A && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (1,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{4,5,6},3->{},4->{10},5->{4,5,6},6->{7,8,9},7->{10},8->{4,5,6},9->{7,8,9},10->{},11->{0,1 ,2}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [9] * Step 3: 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) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (1,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (1,1) 4. lbl121(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [G >= C && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (1,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (1,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (1,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{4,5,6},3->{},4->{10},5->{4,5,6},6->{7,8},7->{10},8->{4,5,6},10->{},11->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,4),(4,10),(5,4),(8,4),(8,6)] * Step 4: UnreachableRules 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) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (1,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (1,1) 4. lbl121(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [G >= C && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (1,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (1,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (1,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{5,6},3->{},4->{},5->{5,6},6->{7,8},7->{10},8->{5},10->{},11->{0,1,2}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [4] * Step 5: AddSinks 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) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (1,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (1,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (1,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (1,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10},8->{5},10->{},11->{0,1,2}] + Applied Processor: AddSinks + Details: () * Step 6: 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) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 12. cut(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 13. lbl6(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(cut,8);(exitus616,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3,13},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10,12},8->{5,6},10->{},11->{0,1,2,14},12->{},13->{} ,14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(8,6)] * Step 7: LooptreeTransformer 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) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 12. cut(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 13. lbl6(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(cut,8);(exitus616,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3,13},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10,12},8->{5},10->{},11->{0,1,2,14},12->{},13->{} ,14->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,5,6,7,8,10,11,12,13,14] | `- p:[5,8,6] c: [8] | `- p:[5] c: [5] * Step 8: SizeAbstraction 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) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 12. cut(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 13. lbl6(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(cut,8);(exitus616,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3,13},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10,12},8->{5},10->{},11->{0,1,2,14},12->{},13->{} ,14->{}] ,We construct a looptree: P: [0,1,2,3,5,6,7,8,10,11,12,13,14] | `- p:[5,8,6] c: [8] | `- p:[5] c: [5]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 9: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start ~> lbl6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= 0*K, H <= H] lbl6 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl121 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl121 ~> lbl141 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= C, H <= H] lbl141 ~> cut [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl141 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= G, H <= H] cut ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start0 ~> start [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F, G <= H, H <= H] cut ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= K + C + G] lbl121 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl141 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= G, H <= H] lbl121 ~> lbl141 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= C, H <= H] + Loop: [0.0.0 <= K + A + E] lbl121 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] + Applied Processor: FlowAbstraction + Details: () * Step 10: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0] start ~> stop [] start ~> lbl6 [] start ~> lbl121 [K ~=> E,K ~=> G] lbl6 ~> stop [] lbl121 ~> lbl121 [D ~=> E] lbl121 ~> lbl141 [C ~=> G,K ~=> E] lbl141 ~> cut [] lbl141 ~> lbl121 [K ~=> E] cut ~> stop [] start0 ~> start [A ~=> D,C ~=> B,F ~=> E,H ~=> G] cut ~> exitus616 [] lbl6 ~> exitus616 [] start ~> exitus616 [] + Loop: [C ~+> 0.0,G ~+> 0.0,K ~+> 0.0] lbl121 ~> lbl121 [D ~=> E] lbl141 ~> lbl121 [K ~=> E] lbl121 ~> lbl141 [C ~=> G,K ~=> E] + Loop: [A ~+> 0.0.0,E ~+> 0.0.0,K ~+> 0.0.0] lbl121 ~> lbl121 [D ~=> E] + Applied Processor: LareProcessor + Details: start0 ~> exitus616 [A ~=> D ,C ~=> B ,C ~=> G ,F ~=> E ,H ~=> G ,K ~=> E ,K ~=> G ,A ~+> 0.0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] start0 ~> stop [A ~=> D ,C ~=> B ,C ~=> G ,F ~=> E ,H ~=> G ,K ~=> E ,K ~=> G ,A ~+> 0.0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + lbl141> [C ~=> G ,K ~=> E ,A ~+> 0.0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> tick ,D ~+> 0.0.0 ,D ~+> tick ,E ~+> 0.0.0 ,E ~+> tick ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,C ~*> tick ,D ~*> tick ,E ~*> tick ,G ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] + lbl121> [D ~=> E ,A ~+> 0.0.0 ,A ~+> tick ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)