MAYBE Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f1(Ar_0, Ar_1, Fresh_5, Fresh_6, Fresh_7, Ar_5, Ar_6, Ar_7)) [ Ar_1 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f300(Ar_0, Ar_1, Fresh_2, Fresh_3, Ar_4, Fresh_4, Ar_6, Ar_7)) [ Ar_0 >= Ar_1 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Fresh_0, Fresh_1)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: ?, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f1(Ar_0, Ar_1, Fresh_5, Fresh_6, Fresh_7, Ar_5, Ar_6, Ar_7)) [ Ar_1 >= Ar_0 + 1 ] (Comp: 1, Cost: 1) f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f300(Ar_0, Ar_1, Fresh_2, Fresh_3, Ar_4, Fresh_4, Ar_6, Ar_7)) [ Ar_0 >= Ar_1 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Fresh_0, Fresh_1)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound ? Time: 0.751 sec (SMT: 0.713 sec)