MAYBE Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f0(Ar_0, Ar_1) -> Com_1(f1(Fresh_0, 1)) (Comp: ?, Cost: 1) f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 - 10, Ar_1 - 1)) [ Ar_1 >= 1 /\ Ar_0 >= 101 ] (Comp: ?, Cost: 1) f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 11, Ar_1 + 1)) [ Ar_1 >= 1 /\ 100 >= Ar_0 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1) -> Com_1(f0(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) f0(Ar_0, Ar_1) -> Com_1(f1(Fresh_0, 1)) (Comp: ?, Cost: 1) f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 - 10, Ar_1 - 1)) [ Ar_1 >= 1 /\ Ar_0 >= 101 ] (Comp: ?, Cost: 1) f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 11, Ar_1 + 1)) [ Ar_1 >= 1 /\ 100 >= Ar_0 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound ? Time: 0.893 sec (SMT: 0.861 sec)