MAYBE Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f0(Ar_0) -> Com_1(f2(Ar_0 + 200)) [ Ar_0 + 99 >= 0 ] (Comp: ?, Cost: 1) f0(Ar_0) -> Com_1(f2(Ar_0 + 500)) [ Ar_0 >= 1 ] (Comp: ?, Cost: 1) f2(Ar_0) -> Com_1(f2(Ar_0 + 700)) [ Ar_0 + 199 >= 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(f2(Ar_0 + 200)) [ Ar_0 + 99 >= 0 ] (Comp: 1, Cost: 1) f0(Ar_0) -> Com_1(f2(Ar_0 + 500)) [ Ar_0 >= 1 ] (Comp: ?, Cost: 1) f2(Ar_0) -> Com_1(f2(Ar_0 + 700)) [ Ar_0 + 199 >= 0 ] (Comp: 1, Cost: 0) koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Applied AI with 'oct' on problem 2 to obtain the following invariants: For symbol f2: X_1 - 101 >= 0 This yielded the following problem: 3: T: (Comp: 1, Cost: 0) koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ] (Comp: ?, Cost: 1) f2(Ar_0) -> Com_1(f2(Ar_0 + 700)) [ Ar_0 - 101 >= 0 /\ Ar_0 + 199 >= 0 ] (Comp: 1, Cost: 1) f0(Ar_0) -> Com_1(f2(Ar_0 + 500)) [ Ar_0 >= 1 ] (Comp: 1, Cost: 1) f0(Ar_0) -> Com_1(f2(Ar_0 + 200)) [ Ar_0 + 99 >= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound ? Time: 1.311 sec (SMT: 1.275 sec)