WORST_CASE(?, O(1)) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f0(Ar_0) -> Com_1(f8(Ar_0)) [ 0 >= B + 1 ] (Comp: ?, Cost: 1) f0(Ar_0) -> Com_1(f8(Ar_0)) (Comp: ?, Cost: 1) f0(Ar_0) -> Com_1(f8(Fresh_0)) (Comp: 1, Cost: 0) koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 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) f0(Ar_0) -> Com_1(f8(Ar_0)) [ 0 >= B + 1 ] (Comp: 1, Cost: 1) f0(Ar_0) -> Com_1(f8(Ar_0)) (Comp: 1, Cost: 1) f0(Ar_0) -> Com_1(f8(Fresh_0)) (Comp: 1, Cost: 0) koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 3 Time: 0.079 sec (SMT: 0.077 sec)