YES(?,POLY) * Step 1: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl6(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl121(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] (?,1) 3. lbl6(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] (?,1) 4. lbl111(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] (?,1) 5. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] (?,1) 6. lbl111(A,B,C,D,E,F) -> lbl121(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] (?,1) 7. lbl121(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] (?,1) 8. lbl121(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] (?,1) 9. lbl121(A,B,C,D,E,F) -> lbl121(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F) -> start(A,C,C,A,F,F) True (1,1) Signature: {(cut,6);(lbl111,6);(lbl121,6);(lbl6,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{3},2->{7,8,9},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: [6] * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl6(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl121(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] (?,1) 3. lbl6(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] (?,1) 4. lbl111(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] (?,1) 5. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] (?,1) 7. lbl121(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] (?,1) 8. lbl121(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] (?,1) 9. lbl121(A,B,C,D,E,F) -> lbl121(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F) -> start(A,C,C,A,F,F) True (1,1) Signature: {(cut,6);(lbl111,6);(lbl121,6);(lbl6,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{3},2->{7,8,9},3->{},4->{10},5->{4,5},7->{10},8->{4,5},9->{7,8,9},10->{},11->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,7)] * Step 3: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl6(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl121(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] (?,1) 3. lbl6(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] (?,1) 4. lbl111(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] (?,1) 5. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] (?,1) 7. lbl121(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] (?,1) 8. lbl121(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] (?,1) 9. lbl121(A,B,C,D,E,F) -> lbl121(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F) -> start(A,C,C,A,F,F) True (1,1) Signature: {(cut,6);(lbl111,6);(lbl121,6);(lbl6,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{3},2->{8,9},3->{},4->{10},5->{4,5},7->{10},8->{4,5},9->{7,8,9},10->{},11->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 4: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] start(A,B,C,D,E,F) -> lbl6(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] start(A,B,C,D,E,F) -> lbl121(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] lbl6(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] lbl111(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl121(A,B,C,D,E,F) -> cut(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] lbl121(A,B,C,D,E,F) -> lbl111(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121(A,B,C,D,E,F) -> lbl121(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] cut(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] start0(A,B,C,D,E,F) -> start(A,C,C,A,F,F) True Signature: {(cut,6);(lbl111,6);(lbl121,6);(lbl6,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{},1->{3},2->{8,9},3->{},4->{10},5->{4,5},7->{10},8->{4,5},9->{7,8,9},10->{},11->{0,1,2}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] start.1(A,B,C,D,E,F) -> lbl6.3(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] start.2(A,B,C,D,E,F) -> lbl121.8(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] start.2(A,B,C,D,E,F) -> lbl121.9(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] lbl6.3(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] lbl111.4(A,B,C,D,E,F) -> cut.10(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] lbl111.5(A,B,C,D,E,F) -> lbl111.4(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl111.5(A,B,C,D,E,F) -> lbl111.5(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl121.7(A,B,C,D,E,F) -> cut.10(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] lbl121.8(A,B,C,D,E,F) -> lbl111.4(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.8(A,B,C,D,E,F) -> lbl111.5(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.7(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.8(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.9(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] cut.10(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] start0.11(A,B,C,D,E,F) -> start.0(A,C,C,A,F,F) True start0.11(A,B,C,D,E,F) -> start.1(A,C,C,A,F,F) True start0.11(A,B,C,D,E,F) -> start.2(A,C,C,A,F,F) True Signature: {(cut.10,6) ;(lbl111.4,6) ;(lbl111.5,6) ;(lbl121.7,6) ;(lbl121.8,6) ;(lbl121.9,6) ;(lbl6.3,6) ;(start.0,6) ;(start.1,6) ;(start.2,6) ;(start0.11,6) ;(stop.12,6)} Rule Graph: [0->{},1->{4},2->{9,10},3->{11,12,13},4->{},5->{14},6->{5},7->{6,7},8->{14},9->{5},10->{6,7},11->{8} ,12->{9,10},13->{11,12,13},14->{},15->{0},16->{1},17->{2,3}] + Applied Processor: AddSinks + Details: () * Step 6: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] start.1(A,B,C,D,E,F) -> lbl6.3(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] start.2(A,B,C,D,E,F) -> lbl121.8(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] start.2(A,B,C,D,E,F) -> lbl121.9(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] lbl6.3(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] lbl111.4(A,B,C,D,E,F) -> cut.10(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] lbl111.5(A,B,C,D,E,F) -> lbl111.4(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl111.5(A,B,C,D,E,F) -> lbl111.5(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl121.7(A,B,C,D,E,F) -> cut.10(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] lbl121.8(A,B,C,D,E,F) -> lbl111.4(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.8(A,B,C,D,E,F) -> lbl111.5(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.7(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.8(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.9(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] cut.10(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] start0.11(A,B,C,D,E,F) -> start.0(A,C,C,A,F,F) True start0.11(A,B,C,D,E,F) -> start.1(A,C,C,A,F,F) True start0.11(A,B,C,D,E,F) -> start.2(A,C,C,A,F,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(cut.10,6) ;(exitus616,6) ;(lbl111.4,6) ;(lbl111.5,6) ;(lbl121.7,6) ;(lbl121.8,6) ;(lbl121.9,6) ;(lbl6.3,6) ;(start.0,6) ;(start.1,6) ;(start.2,6) ;(start0.11,6) ;(stop.12,6)} Rule Graph: [0->{24},1->{4},2->{9,10},3->{11,12,13},4->{23},5->{14},6->{5},7->{6,7},8->{14},9->{5},10->{6,7},11->{8} ,12->{9,10},13->{11,12,13},14->{18,19,20,21,22},15->{0},16->{1},17->{2,3}] + 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,22,23,24] | +- p:[13] c: [13] | `- p:[7] c: [7] * Step 7: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: start.0(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [0 >= A && B = C && D = A && E = F] start.1(A,B,C,D,E,F) -> lbl6.3(A,B,C,D,E,F) [A >= 1 && A >= C && B = C && D = A && E = F] start.2(A,B,C,D,E,F) -> lbl121.8(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] start.2(A,B,C,D,E,F) -> lbl121.9(A,B,C,D,B + -1*D,F) [A >= 1 && C >= 1 + A && B = C && D = A && E = F] lbl6.3(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [A >= 1 && A >= C && E = F && D = A && B = C] lbl111.4(A,B,C,D,E,F) -> cut.10(A,B,C,D,E,F) [C >= 1 + A && A >= 2 && E = 0 && D = A && B = C] lbl111.5(A,B,C,D,E,F) -> lbl111.4(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl111.5(A,B,C,D,E,F) -> lbl111.5(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && E >= 0 && C >= 1 + A + E && A >= 2 + E && D = A && B = C] lbl121.7(A,B,C,D,E,F) -> cut.10(A,B,C,D,E,F) [C >= 1 + A && A >= 1 && C >= A && E = 0 && D = A && B = C] lbl121.8(A,B,C,D,E,F) -> lbl111.4(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.8(A,B,C,D,E,F) -> lbl111.5(A,B,C,D,-1 + E,F) [E >= 1 && A >= 1 + E && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.7(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.8(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] lbl121.9(A,B,C,D,E,F) -> lbl121.9(A,B,C,D,-1*D + E,F) [E >= 1 && E >= A && C >= 1 + A && A >= 1 && E >= 0 && C >= A + E && D = A && B = C] cut.10(A,B,C,D,E,F) -> stop.12(A,B,C,D,E,F) [A >= 1 && C >= 1 + A && E = 0 && D = A && B = C] start0.11(A,B,C,D,E,F) -> start.0(A,C,C,A,F,F) True start0.11(A,B,C,D,E,F) -> start.1(A,C,C,A,F,F) True start0.11(A,B,C,D,E,F) -> start.2(A,C,C,A,F,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.12(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(cut.10,6) ;(exitus616,6) ;(lbl111.4,6) ;(lbl111.5,6) ;(lbl121.7,6) ;(lbl121.8,6) ;(lbl121.9,6) ;(lbl6.3,6) ;(start.0,6) ;(start.1,6) ;(start.2,6) ;(start0.11,6) ;(stop.12,6)} Rule Graph: [0->{24},1->{4},2->{9,10},3->{11,12,13},4->{23},5->{14},6->{5},7->{6,7},8->{14},9->{5},10->{6,7},11->{8} ,12->{9,10},13->{11,12,13},14->{18,19,20,21,22},15->{0},16->{1},17->{2,3}] ,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,22,23,24] | +- p:[13] c: [13] | `- p:[7] c: [7]) + Applied Processor: AbstractSize Minimize + Details: () * Step 8: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.1] start.0 ~> stop.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start.1 ~> lbl6.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start.2 ~> lbl121.8 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] start.2 ~> lbl121.9 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] lbl6.3 ~> stop.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl111.4 ~> cut.10 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl111.5 ~> lbl111.4 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] lbl111.5 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] lbl121.7 ~> cut.10 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl121.8 ~> lbl111.4 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] lbl121.8 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] lbl121.9 ~> lbl121.7 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F] lbl121.9 ~> lbl121.8 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F] lbl121.9 ~> lbl121.9 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F] cut.10 ~> stop.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start0.11 ~> start.0 [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F] start0.11 ~> start.1 [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F] start0.11 ~> start.2 [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= A + E] lbl121.9 ~> lbl121.9 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F] + Loop: [0.1 <= E] lbl111.5 ~> lbl111.5 [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] + Applied Processor: AbstractFlow + Details: () * Step 9: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.1] start.0 ~> stop.12 [] start.1 ~> lbl6.3 [] start.2 ~> lbl121.8 [B ~=> E] start.2 ~> lbl121.9 [B ~=> E] lbl6.3 ~> stop.12 [] lbl111.4 ~> cut.10 [] lbl111.5 ~> lbl111.4 [B ~=> E] lbl111.5 ~> lbl111.5 [B ~=> E] lbl121.7 ~> cut.10 [] lbl121.8 ~> lbl111.4 [B ~=> E] lbl121.8 ~> lbl111.5 [B ~=> E] lbl121.9 ~> lbl121.7 [C ~=> E] lbl121.9 ~> lbl121.8 [C ~=> E] lbl121.9 ~> lbl121.9 [C ~=> E] cut.10 ~> stop.12 [] start0.11 ~> start.0 [A ~=> D,C ~=> B,F ~=> E] start0.11 ~> start.1 [A ~=> D,C ~=> B,F ~=> E] start0.11 ~> start.2 [A ~=> D,C ~=> B,F ~=> E] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] + Loop: [A ~+> 0.0,E ~+> 0.0] lbl121.9 ~> lbl121.9 [C ~=> E] + Loop: [E ~=> 0.1] lbl111.5 ~> lbl111.5 [B ~=> E] + Applied Processor: Lare + Details: start0.11 ~> exitus616 [A ~=> D ,C ~=> B ,C ~=> E ,C ~=> 0.1 ,F ~=> E ,A ~+> 0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,C ~*> tick] + lbl121.9> [C ~=> E,A ~+> 0.0,A ~+> tick,E ~+> 0.0,E ~+> tick,tick ~+> tick] + lbl111.5> [B ~=> E,E ~=> 0.1,E ~+> tick,tick ~+> tick] YES(?,POLY)