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