WORST_CASE(?, O(n^1)) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ] (Comp: ?, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 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_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ] (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_random1d_start) = 1 Pol(eval_random1d_bb0_in) = 1 Pol(eval_random1d_0) = 1 Pol(eval_random1d_1) = 1 Pol(eval_random1d_bb1_in) = 1 Pol(eval_random1d_bb3_in) = 0 Pol(eval_random1d_bb2_in) = 1 Pol(eval_random1d_2) = 1 Pol(eval_random1d_3) = 1 Pol(eval_random1d_stop) = -1 Pol(koat_start) = 1 orients all transitions weakly and the transition eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ] (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] (Comp: 1, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 3 produces the following problem: 4: T: (Comp: 1, Cost: 1) eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ] (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ] (Comp: ?, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] (Comp: 1, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] (Comp: 2, Cost: 1) eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(eval_random1d_bb2_in) = 4*V_2 - 4*V_3 Pol(eval_random1d_2) = 4*V_2 - 4*V_3 - 1 Pol(eval_random1d_bb1_in) = 4*V_2 - 4*V_3 + 1 Pol(eval_random1d_3) = 4*V_2 - 4*V_3 - 2 and size complexities S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0 S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1 S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2 S("eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2))", 0-0) = ? S("eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2))", 0-2) = ? S("eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ]", 0-0) = ? S("eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ]", 0-1) = Ar_1 S("eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ]", 0-2) = ? S("eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ]", 0-0) = ? S("eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ]", 0-1) = Ar_1 S("eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ]", 0-2) = ? S("eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2))", 0-0) = ? S("eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2))", 0-2) = ? S("eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2))", 0-0) = ? S("eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2))", 0-2) = ? S("eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]", 0-0) = ? S("eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]", 0-1) = Ar_1 S("eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]", 0-2) = ? S("eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]", 0-0) = ? S("eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]", 0-1) = Ar_1 S("eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]", 0-2) = ? S("eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ]", 0-0) = Ar_0 S("eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ]", 0-1) = Ar_1 S("eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ]", 0-2) = Ar_2 S("eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ]", 0-0) = Ar_0 S("eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ]", 0-1) = Ar_1 S("eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ]", 0-2) = 1 S("eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0 S("eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2 S("eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0 S("eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2 S("eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0 S("eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2 orients the transitions eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) weakly and the transition eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] strictly and produces the following problem: 5: T: (Comp: 1, Cost: 1) eval_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ] (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ] (Comp: 4*Ar_1 + 5, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] (Comp: 1, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] (Comp: ?, Cost: 1) eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] (Comp: ?, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] (Comp: 2, Cost: 1) eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 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_random1d_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_0(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_1(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, 1)) [ Ar_1 > 0 ] (Comp: 1, Cost: 1) eval_random1d_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_1 <= 0 ] (Comp: 4*Ar_1 + 5, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ] (Comp: 1, Cost: 1) eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] (Comp: 4*Ar_1 + 5, Cost: 1) eval_random1d_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_2(Ar_0, Ar_1, Ar_2)) (Comp: 4*Ar_1 + 5, Cost: 1) eval_random1d_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_3(Fresh_0, Ar_1, Ar_2)) (Comp: 4*Ar_1 + 5, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 > 0 ] (Comp: 4*Ar_1 + 5, Cost: 1) eval_random1d_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_0 <= 0 ] (Comp: 2, Cost: 1) eval_random1d_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_random1d_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 20*Ar_1 + 33 Time: 0.810 sec (SMT: 0.780 sec)