MAYBE Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 + Ar_3, Ar_3 - 1)) [ Ar_0 >= 1 ] (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f1(Ar_0 - 1, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= 1 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 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, Ar_2, Ar_3) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 + Ar_3, Ar_3 - 1)) [ Ar_0 >= 1 ] (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f1(Ar_0 - 1, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= 1 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound ? Time: 1.385 sec (SMT: 1.335 sec)