YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) Signature: {(cut,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,3,4},1->{},2->{2,3,4},3->{5},4->{},5->{2,3,4},6->{0,1}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (1,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) Signature: {(cut,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,3,4},1->{},2->{2,3,4},3->{5},4->{},5->{2,3,4},6->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,3),(5,3),(5,4)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (1,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) Signature: {(cut,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,4},1->{},2->{2,3,4},3->{5},4->{},5->{2},6->{0,1}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) 7. start(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 8. lbl71(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(cut,6);(exitus616,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,3,4,8},1->{},2->{2,3,4,8},3->{5},4->{},5->{2,3,4,8},6->{0,1,7},7->{},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,3),(5,3),(5,4)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) 7. start(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 8. lbl71(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(cut,6);(exitus616,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,4,8},1->{},2->{2,3,4,8},3->{5},4->{},5->{2,8},6->{0,1,7},7->{},8->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | `- p:[2,5,3] c: [5] | `- p:[2] c: [2] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) 7. start(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 8. lbl71(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(cut,6);(exitus616,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,4,8},1->{},2->{2,3,4,8},3->{5},4->{},5->{2,8},6->{0,1,7},7->{},8->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | `- p:[2,5,3] c: [5] | `- p:[2] c: [2]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.0.0] start ~> lbl71 [A <= A, B <= B, C <= K, D <= D, E <= 0*K, F <= F] start ~> stop [A <= A, B <= B, C <= 0*K, D <= D, E <= K, F <= F] lbl71 ~> lbl71 [A <= A, B <= B, C <= B, D <= D, E <= E, F <= F] lbl71 ~> cut [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] lbl71 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] cut ~> lbl71 [A <= A, B <= B, C <= K, D <= D, E <= E, F <= F] start0 ~> start [A <= A, B <= A, C <= D, D <= D, E <= F, F <= F] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl71 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= 2*K + A + E] lbl71 ~> lbl71 [A <= A, B <= B, C <= B, D <= D, E <= E, F <= F] cut ~> lbl71 [A <= A, B <= B, C <= K, D <= D, E <= E, F <= F] lbl71 ~> cut [A <= A, B <= B, C <= C, D <= D, E <= B, F <= F] + Loop: [0.0.0 <= B + C] lbl71 ~> lbl71 [A <= A, B <= B, C <= B, D <= D, E <= E, F <= F] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.0.0] start ~> lbl71 [K ~=> C,K ~=> E] start ~> stop [K ~=> C,K ~=> E] lbl71 ~> lbl71 [B ~=> C] lbl71 ~> cut [B ~=> E] lbl71 ~> stop [B ~=> E] cut ~> lbl71 [K ~=> C] start0 ~> start [A ~=> B,D ~=> C,F ~=> E] start ~> exitus616 [] lbl71 ~> exitus616 [] + Loop: [A ~+> 0.0,E ~+> 0.0,K ~*> 0.0] lbl71 ~> lbl71 [B ~=> C] cut ~> lbl71 [K ~=> C] lbl71 ~> cut [B ~=> E] + Loop: [B ~+> 0.0.0,C ~+> 0.0.0] lbl71 ~> lbl71 [B ~=> C] + Applied Processor: LareProcessor + Details: start0 ~> stop [A ~=> B ,A ~=> C ,A ~=> E ,K ~=> C ,K ~=> E ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> 0.0 ,K ~*> tick] start0 ~> exitus616 [A ~=> B ,A ~=> C ,A ~=> E ,D ~=> C ,F ~=> E ,K ~=> C ,K ~=> E ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> 0.0 ,K ~*> tick] + lbl71> [B ~=> C ,B ~=> E ,K ~=> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,E ~+> 0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> tick ,E ~*> tick ,K ~*> 0.0 ,K ~*> tick] + lbl71> [B ~=> C,B ~+> 0.0.0,B ~+> tick,C ~+> 0.0.0,C ~+> tick,tick ~+> tick] YES(?,POLY)