WORST_CASE(?, O(1)) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f2(Ar_0, Ar_1) -> Com_1(f3(Ar_0 - 1, Fresh_1)) [ Ar_0 >= 0 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_1) -> Com_1(f3(Ar_0, Fresh_0)) [ 0 >= Ar_0 + 1 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1) -> Com_1(f2(Ar_0, Ar_1)) [ 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) f2(Ar_0, Ar_1) -> Com_1(f3(Ar_0 - 1, Fresh_1)) [ Ar_0 >= 0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1) -> Com_1(f3(Ar_0, Fresh_0)) [ 0 >= Ar_0 + 1 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1) -> Com_1(f2(Ar_0, Ar_1)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 2 Time: 0.246 sec (SMT: 0.242 sec)