WORST_CASE(?, O(n^1)) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_3, Ar_4, Ar_5, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 <= 100 /\ Ar_1 <= Ar_2 ] (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 > 100 ] (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > Ar_2 ] (Comp: ?, Cost: 1) eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_1, Ar_0 + 1, Ar_2 - 1, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_3, Ar_4, Ar_5, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 <= 100 /\ Ar_1 <= Ar_2 ] (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 > 100 ] (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > Ar_2 ] (Comp: ?, Cost: 1) eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_1, Ar_0 + 1, Ar_2 - 1, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_exmini_start) = 2 Pol(eval_exmini_bb0_in) = 2 Pol(eval_exmini_0) = 2 Pol(eval_exmini_1) = 2 Pol(eval_exmini_2) = 2 Pol(eval_exmini_3) = 2 Pol(eval_exmini_4) = 2 Pol(eval_exmini_5) = 2 Pol(eval_exmini_6) = 2 Pol(eval_exmini_7) = 2 Pol(eval_exmini_bb1_in) = 2 Pol(eval_exmini_bb2_in) = 2 Pol(eval_exmini_bb3_in) = 1 Pol(eval_exmini_stop) = 0 Pol(koat_start) = 2 orients all transitions weakly and the transitions eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > Ar_2 ] eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 > 100 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_3, Ar_4, Ar_5, Ar_3, Ar_4, Ar_5)) (Comp: ?, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 <= 100 /\ Ar_1 <= Ar_2 ] (Comp: 2, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 > 100 ] (Comp: 2, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > Ar_2 ] (Comp: ?, Cost: 1) eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_1, Ar_0 + 1, Ar_2 - 1, Ar_3, Ar_4, Ar_5)) (Comp: 2, Cost: 1) eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_exmini_start) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_bb0_in) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_0) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_1) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_2) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_3) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_4) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_5) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_6) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_7) = -V_4 - V_5 + V_6 + 101 Pol(eval_exmini_bb1_in) = -V_1 - V_2 + V_3 + 101 Pol(eval_exmini_bb2_in) = -V_1 - V_2 + V_3 + 100 Pol(eval_exmini_bb3_in) = -V_1 - V_2 + V_3 + 101 Pol(eval_exmini_stop) = -V_1 - V_2 + V_3 + 101 Pol(koat_start) = -V_4 - V_5 + V_6 + 101 orients all transitions weakly and the transition eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 <= 100 /\ Ar_1 <= Ar_2 ] strictly and produces the following problem: 4: T: (Comp: 1, Cost: 1) eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_3, Ar_4, Ar_5, Ar_3, Ar_4, Ar_5)) (Comp: Ar_3 + Ar_4 + Ar_5 + 101, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 <= 100 /\ Ar_1 <= Ar_2 ] (Comp: 2, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 > 100 ] (Comp: 2, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > Ar_2 ] (Comp: ?, Cost: 1) eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_1, Ar_0 + 1, Ar_2 - 1, Ar_3, Ar_4, Ar_5)) (Comp: 2, Cost: 1) eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 4 produces the following problem: 5: T: (Comp: 1, Cost: 1) eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 1) eval_exmini_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_3, Ar_4, Ar_5, Ar_3, Ar_4, Ar_5)) (Comp: Ar_3 + Ar_4 + Ar_5 + 101, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 <= 100 /\ Ar_1 <= Ar_2 ] (Comp: 2, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_0 > 100 ] (Comp: 2, Cost: 1) eval_exmini_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > Ar_2 ] (Comp: Ar_3 + Ar_4 + Ar_5 + 101, Cost: 1) eval_exmini_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_bb1_in(Ar_1, Ar_0 + 1, Ar_2 - 1, Ar_3, Ar_4, Ar_5)) (Comp: 2, Cost: 1) eval_exmini_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(eval_exmini_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 2*Ar_3 + 2*Ar_4 + 2*Ar_5 + 218 Time: 1.670 sec (SMT: 1.604 sec)