WORST_CASE(?, O(n^1)) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_1 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - 1 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Fresh_0, Ar_4)) (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_2, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 > 0 ] (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_2, Ar_2, Ar_3, Ar_4)) [ Ar_3 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 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_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_1 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - 1 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Fresh_0, Ar_4)) (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_2, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 > 0 ] (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_2, Ar_2, Ar_3, Ar_4)) [ Ar_3 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_start_start) = 2 Pol(eval_start_bb0_in) = 2 Pol(eval_start_0) = 2 Pol(eval_start_1) = 2 Pol(eval_start_2) = 2 Pol(eval_start_bb1_in) = 2 Pol(eval_start_bb2_in) = 2 Pol(eval_start_bb4_in) = 1 Pol(eval_start_bb3_in) = 2 Pol(eval_start_5) = 2 Pol(eval_start_6) = 2 Pol(eval_start_stop) = 0 Pol(koat_start) = 2 orients all transitions weakly and the transition eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_1 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - 1 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Fresh_0, Ar_4)) (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_2, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 > 0 ] (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_2, Ar_2, Ar_3, Ar_4)) [ Ar_3 <= 0 ] (Comp: 2, Cost: 1) eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_start_start) = 1 Pol(eval_start_bb0_in) = 1 Pol(eval_start_0) = 1 Pol(eval_start_1) = 1 Pol(eval_start_2) = 1 Pol(eval_start_bb1_in) = 1 Pol(eval_start_bb2_in) = 1 Pol(eval_start_bb4_in) = 0 Pol(eval_start_bb3_in) = 1 Pol(eval_start_5) = 1 Pol(eval_start_6) = 1 Pol(eval_start_stop) = 0 Pol(koat_start) = 1 orients all transitions weakly and the transition eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] strictly and produces the following problem: 4: T: (Comp: 1, Cost: 1) eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] (Comp: 1, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_1 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - 1 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Fresh_0, Ar_4)) (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_2, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 > 0 ] (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_2, Ar_2, Ar_3, Ar_4)) [ Ar_3 <= 0 ] (Comp: 2, Cost: 1) eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_start_start) = 5*V_5 Pol(eval_start_bb0_in) = 5*V_5 Pol(eval_start_0) = 5*V_5 Pol(eval_start_1) = 5*V_5 Pol(eval_start_2) = 5*V_5 Pol(eval_start_bb1_in) = 5*V_1 - 3 Pol(eval_start_bb2_in) = 5*V_2 - 4 Pol(eval_start_bb4_in) = 5*V_1 - 3 Pol(eval_start_bb3_in) = 5*V_3 Pol(eval_start_5) = 5*V_3 - 1 Pol(eval_start_6) = 5*V_3 - 2 Pol(eval_start_stop) = 5*V_1 - 3 Pol(koat_start) = 5*V_5 orients all transitions weakly and the transitions eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] strictly and produces the following problem: 5: T: (Comp: 1, Cost: 1) eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 5*Ar_4, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] (Comp: 1, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] (Comp: 5*Ar_4, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] (Comp: ?, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_1 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - 1 <= 0 ] (Comp: ?, Cost: 1) eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: ?, Cost: 1) eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Fresh_0, Ar_4)) (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_2, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 > 0 ] (Comp: ?, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_2, Ar_2, Ar_3, Ar_4)) [ Ar_3 <= 0 ] (Comp: 2, Cost: 1) eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 5 produces the following problem: 6: T: (Comp: 1, Cost: 1) eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 1) eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 5*Ar_4, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_0 > 0 ] (Comp: 1, Cost: 1) eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= 0 ] (Comp: 5*Ar_4, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_1 - 1, Ar_3, Ar_4)) [ Ar_1 - 1 > 0 ] (Comp: 10*Ar_4, Cost: 1) eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_1 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - 1 <= 0 ] (Comp: 5*Ar_4, Cost: 1) eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 5*Ar_4, Cost: 1) eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Ar_2, Fresh_0, Ar_4)) (Comp: 5*Ar_4, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_2, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_3 > 0 ] (Comp: 5*Ar_4, Cost: 1) eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_2, Ar_2, Ar_3, Ar_4)) [ Ar_3 <= 0 ] (Comp: 2, Cost: 1) eval_start_bb4_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 40*Ar_4 + 8 Time: 1.375 sec (SMT: 1.329 sec)