YES(?,POLY) * Step 1: ArgumentFilter WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C,D) -> f4(0,B,C,D) True (1,1) 1. f4(A,B,C,D) -> f7(A,B,1 + A,D) [A >= 0 && B >= 1 + A] (?,1) 2. f7(A,B,C,D) -> f7(A,B,1 + C,0) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 3. f7(A,B,C,D) -> f7(A,-1 + B,C,E) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] 4. f7(A,B,C,D) -> f7(A,-1 + B,C,E) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] 5. f7(A,B,C,D) -> f4(1 + A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] 6. f4(A,B,C,D) -> f19(A,B,C,D) [A >= 0 && A >= B] (?,1) Signature: {(f0,4);(f19,4);(f4,4);(f7,4)} Flow Graph: [0->{1,6},1->{2,3,4,5},2->{2,3,4,5},3->{2,3,4,5},4->{2,3,4,5},5->{1,6},6->{}] + Applied Processor: ArgumentFilter [3] + Details: We remove following argument positions: [3]. * Step 2: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C) -> f4(0,B,C) True (1,1) 1. f4(A,B,C) -> f7(A,B,1 + A) [A >= 0 && B >= 1 + A] (?,1) 2. f7(A,B,C) -> f7(A,B,1 + C) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 3. f7(A,B,C) -> f7(A,-1 + B,C) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] 4. f7(A,B,C) -> f7(A,-1 + B,C) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] 5. f7(A,B,C) -> f4(1 + A,B,C) [B + -1*C >= 0 (?,1) && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] 6. f4(A,B,C) -> f19(A,B,C) [A >= 0 && A >= B] (?,1) Signature: {(f0,4);(f19,4);(f4,4);(f7,4)} Flow Graph: [0->{1,6},1->{2,3,4,5},2->{2,3,4,5},3->{2,3,4,5},4->{2,3,4,5},5->{1,6},6->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: f0(A,B,C) -> f4(0,B,C) True f4(A,B,C) -> f7(A,B,1 + A) [A >= 0 && B >= 1 + A] f7(A,B,C) -> f7(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7(A,B,C) -> f7(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7(A,B,C) -> f7(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7(A,B,C) -> f4(1 + A,B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] f4(A,B,C) -> f19(A,B,C) [A >= 0 && A >= B] Signature: {(f0,4);(f19,4);(f4,4);(f7,4)} Rule Graph: [0->{1,6},1->{2,3,4,5},2->{2,3,4,5},3->{2,3,4,5},4->{2,3,4,5},5->{1,6},6->{}] + Applied Processor: AddSinks + Details: () * Step 4: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: f0(A,B,C) -> f4(0,B,C) True f4(A,B,C) -> f7(A,B,1 + A) [A >= 0 && B >= 1 + A] f7(A,B,C) -> f7(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7(A,B,C) -> f7(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7(A,B,C) -> f7(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7(A,B,C) -> f4(1 + A,B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] f4(A,B,C) -> f19(A,B,C) [A >= 0 && A >= B] f19(A,B,C) -> exitus616(A,B,C) True Signature: {(exitus616,3);(f0,4);(f19,4);(f4,4);(f7,4)} Rule Graph: [0->{1,6},1->{2,3,4,5},2->{2,3,4,5},3->{2,3,4,5},4->{2,3,4,5},5->{1,6},6->{7}] + Applied Processor: Unfold + Details: () * Step 5: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: f0.0(A,B,C) -> f4.1(0,B,C) True f0.0(A,B,C) -> f4.6(0,B,C) True f4.1(A,B,C) -> f7.2(A,B,1 + A) [A >= 0 && B >= 1 + A] f4.1(A,B,C) -> f7.3(A,B,1 + A) [A >= 0 && B >= 1 + A] f4.1(A,B,C) -> f7.4(A,B,1 + A) [A >= 0 && B >= 1 + A] f4.1(A,B,C) -> f7.5(A,B,1 + A) [A >= 0 && B >= 1 + A] f7.2(A,B,C) -> f7.2(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.2(A,B,C) -> f7.3(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.2(A,B,C) -> f7.4(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.2(A,B,C) -> f7.5(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.3(A,B,C) -> f7.2(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.3(A,B,C) -> f7.3(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.3(A,B,C) -> f7.4(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.3(A,B,C) -> f7.5(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.4(A,B,C) -> f7.2(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.4(A,B,C) -> f7.3(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.4(A,B,C) -> f7.4(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.4(A,B,C) -> f7.5(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.5(A,B,C) -> f4.1(1 + A,B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] f7.5(A,B,C) -> f4.6(1 + A,B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] f4.6(A,B,C) -> f19.7(A,B,C) [A >= 0 && A >= B] f19.7(A,B,C) -> exitus616.8(A,B,C) True Signature: {(exitus616.8,3);(f0.0,3);(f19.7,3);(f4.1,3);(f4.6,3);(f7.2,3);(f7.3,3);(f7.4,3);(f7.5,3)} Rule Graph: [0->{2,3,4,5},1->{20},2->{6,7,8,9},3->{10,11,12,13},4->{14,15,16,17},5->{18,19},6->{6,7,8,9},7->{10,11,12 ,13},8->{14,15,16,17},9->{18,19},10->{6,7,8,9},11->{10,11,12,13},12->{14,15,16,17},13->{18,19},14->{6,7,8,9} ,15->{10,11,12,13},16->{14,15,16,17},17->{18,19},18->{2,3,4,5},19->{20},20->{21},21->{}] + 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] | `- p:[2,18,5,9,6,10,3,7,14,4,8,12,11,15,16,13,17] c: [2,3,4,5,7,8,9,10,11,12,13,14,15,16,17,18] | `- p:[6] c: [6] * Step 6: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: f0.0(A,B,C) -> f4.1(0,B,C) True f0.0(A,B,C) -> f4.6(0,B,C) True f4.1(A,B,C) -> f7.2(A,B,1 + A) [A >= 0 && B >= 1 + A] f4.1(A,B,C) -> f7.3(A,B,1 + A) [A >= 0 && B >= 1 + A] f4.1(A,B,C) -> f7.4(A,B,1 + A) [A >= 0 && B >= 1 + A] f4.1(A,B,C) -> f7.5(A,B,1 + A) [A >= 0 && B >= 1 + A] f7.2(A,B,C) -> f7.2(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.2(A,B,C) -> f7.3(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.2(A,B,C) -> f7.4(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.2(A,B,C) -> f7.5(A,B,1 + C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] f7.3(A,B,C) -> f7.2(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.3(A,B,C) -> f7.3(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.3(A,B,C) -> f7.4(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.3(A,B,C) -> f7.5(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && 0 >= 1 + E] f7.4(A,B,C) -> f7.2(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.4(A,B,C) -> f7.3(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.4(A,B,C) -> f7.4(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.4(A,B,C) -> f7.5(A,-1 + B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= 1 + C && E >= 1] f7.5(A,B,C) -> f4.1(1 + A,B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] f7.5(A,B,C) -> f4.6(1 + A,B,C) [B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= B] f4.6(A,B,C) -> f19.7(A,B,C) [A >= 0 && A >= B] f19.7(A,B,C) -> exitus616.8(A,B,C) True Signature: {(exitus616.8,3);(f0.0,3);(f19.7,3);(f4.1,3);(f4.6,3);(f7.2,3);(f7.3,3);(f7.4,3);(f7.5,3)} Rule Graph: [0->{2,3,4,5},1->{20},2->{6,7,8,9},3->{10,11,12,13},4->{14,15,16,17},5->{18,19},6->{6,7,8,9},7->{10,11,12 ,13},8->{14,15,16,17},9->{18,19},10->{6,7,8,9},11->{10,11,12,13},12->{14,15,16,17},13->{18,19},14->{6,7,8,9} ,15->{10,11,12,13},16->{14,15,16,17},17->{18,19},18->{2,3,4,5},19->{20},20->{21},21->{}] ,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] | `- p:[2,18,5,9,6,10,3,7,14,4,8,12,11,15,16,13,17] c: [2,3,4,5,7,8,9,10,11,12,13,14,15,16,17,18] | `- p:[6] c: [6]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,0.0,0.0.0] f0.0 ~> f4.1 [A <= 0*K, B <= B, C <= C] f0.0 ~> f4.6 [A <= 0*K, B <= B, C <= C] f4.1 ~> f7.2 [A <= A, B <= B, C <= B] f4.1 ~> f7.3 [A <= A, B <= B, C <= B] f4.1 ~> f7.4 [A <= A, B <= B, C <= B] f4.1 ~> f7.5 [A <= A, B <= B, C <= B] f7.2 ~> f7.2 [A <= A, B <= B, C <= B] f7.2 ~> f7.3 [A <= A, B <= B, C <= B] f7.2 ~> f7.4 [A <= A, B <= B, C <= B] f7.2 ~> f7.5 [A <= A, B <= B, C <= B] f7.3 ~> f7.2 [A <= A, B <= B, C <= C] f7.3 ~> f7.3 [A <= A, B <= B, C <= C] f7.3 ~> f7.4 [A <= A, B <= B, C <= C] f7.3 ~> f7.5 [A <= A, B <= B, C <= C] f7.4 ~> f7.2 [A <= A, B <= B, C <= C] f7.4 ~> f7.3 [A <= A, B <= B, C <= C] f7.4 ~> f7.4 [A <= A, B <= B, C <= C] f7.4 ~> f7.5 [A <= A, B <= B, C <= C] f7.5 ~> f4.1 [A <= C, B <= B, C <= C] f7.5 ~> f4.6 [A <= C, B <= B, C <= C] f4.6 ~> f19.7 [A <= A, B <= B, C <= C] f19.7 ~> exitus616.8 [A <= A, B <= B, C <= C] + Loop: [0.0 <= A + B] f4.1 ~> f7.2 [A <= A, B <= B, C <= B] f7.5 ~> f4.1 [A <= C, B <= B, C <= C] f4.1 ~> f7.5 [A <= A, B <= B, C <= B] f7.2 ~> f7.5 [A <= A, B <= B, C <= B] f7.2 ~> f7.2 [A <= A, B <= B, C <= B] f7.3 ~> f7.2 [A <= A, B <= B, C <= C] f4.1 ~> f7.3 [A <= A, B <= B, C <= B] f7.2 ~> f7.3 [A <= A, B <= B, C <= B] f7.4 ~> f7.2 [A <= A, B <= B, C <= C] f4.1 ~> f7.4 [A <= A, B <= B, C <= B] f7.2 ~> f7.4 [A <= A, B <= B, C <= B] f7.3 ~> f7.4 [A <= A, B <= B, C <= C] f7.3 ~> f7.3 [A <= A, B <= B, C <= C] f7.4 ~> f7.3 [A <= A, B <= B, C <= C] f7.4 ~> f7.4 [A <= A, B <= B, C <= C] f7.3 ~> f7.5 [A <= A, B <= B, C <= C] f7.4 ~> f7.5 [A <= A, B <= B, C <= C] + Loop: [0.0.0 <= K + B + C] f7.2 ~> f7.2 [A <= A, B <= B, C <= B] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.0.0] f0.0 ~> f4.1 [K ~=> A] f0.0 ~> f4.6 [K ~=> A] f4.1 ~> f7.2 [B ~=> C] f4.1 ~> f7.3 [B ~=> C] f4.1 ~> f7.4 [B ~=> C] f4.1 ~> f7.5 [B ~=> C] f7.2 ~> f7.2 [B ~=> C] f7.2 ~> f7.3 [B ~=> C] f7.2 ~> f7.4 [B ~=> C] f7.2 ~> f7.5 [B ~=> C] f7.3 ~> f7.2 [] f7.3 ~> f7.3 [] f7.3 ~> f7.4 [] f7.3 ~> f7.5 [] f7.4 ~> f7.2 [] f7.4 ~> f7.3 [] f7.4 ~> f7.4 [] f7.4 ~> f7.5 [] f7.5 ~> f4.1 [C ~=> A] f7.5 ~> f4.6 [C ~=> A] f4.6 ~> f19.7 [] f19.7 ~> exitus616.8 [] + Loop: [A ~+> 0.0,B ~+> 0.0] f4.1 ~> f7.2 [B ~=> C] f7.5 ~> f4.1 [C ~=> A] f4.1 ~> f7.5 [B ~=> C] f7.2 ~> f7.5 [B ~=> C] f7.2 ~> f7.2 [B ~=> C] f7.3 ~> f7.2 [] f4.1 ~> f7.3 [B ~=> C] f7.2 ~> f7.3 [B ~=> C] f7.4 ~> f7.2 [] f4.1 ~> f7.4 [B ~=> C] f7.2 ~> f7.4 [B ~=> C] f7.3 ~> f7.4 [] f7.3 ~> f7.3 [] f7.4 ~> f7.3 [] f7.4 ~> f7.4 [] f7.3 ~> f7.5 [] f7.4 ~> f7.5 [] + Loop: [B ~+> 0.0.0,C ~+> 0.0.0,K ~+> 0.0.0] f7.2 ~> f7.2 [B ~=> C] + Applied Processor: Lare + Details: f0.0 ~> exitus616.8 [B ~=> A ,B ~=> C ,C ~=> A ,K ~=> A ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> tick ,K ~*> tick] + f7.5> [B ~=> A ,B ~=> C ,C ~=> A ,A ~+> 0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> tick ,K ~*> tick] + f7.2> [B ~=> C ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)