MAYBE Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f0(Ar_0, Ar_1) -> Com_1(f3(0, Ar_1)) (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Fresh_0 + 1, Ar_1)) [ Ar_0 = 5 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Ar_0 + 1, Ar_0)) [ 9 >= Ar_0 /\ 4 >= Ar_0 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Ar_0 + 1, Ar_0)) [ 9 >= Ar_0 /\ Ar_0 >= 6 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Ar_1)) [ Ar_0 >= 10 ] (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(f3(0, Ar_1)) (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Fresh_0 + 1, Ar_1)) [ Ar_0 = 5 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Ar_0 + 1, Ar_0)) [ 9 >= Ar_0 /\ 4 >= Ar_0 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Ar_0 + 1, Ar_0)) [ 9 >= Ar_0 /\ Ar_0 >= 6 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Ar_1)) [ Ar_0 >= 10 ] (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 A polynomial rank function with Pol(f0) = 15 Pol(f3) = 15 Pol(f12) = 14 Pol(koat_start) = 15 orients all transitions weakly and the transition f3(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Ar_1)) [ Ar_0 >= 10 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) f0(Ar_0, Ar_1) -> Com_1(f3(0, Ar_1)) (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Fresh_0 + 1, Ar_1)) [ Ar_0 = 5 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Ar_0 + 1, Ar_0)) [ 9 >= Ar_0 /\ 4 >= Ar_0 ] (Comp: ?, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f3(Ar_0 + 1, Ar_0)) [ 9 >= Ar_0 /\ Ar_0 >= 6 ] (Comp: 15, Cost: 1) f3(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Ar_1)) [ Ar_0 >= 10 ] (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: 1.067 sec (SMT: 1.031 sec)