MAYBE

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval(Ar_0, Ar_1, Ar_2) -> Com_1(eval(Ar_0 + 1, Ar_1 + Ar_0, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    eval(Ar_0, Ar_1, Ar_2) -> Com_1(eval(Ar_0 - Ar_2, Ar_1 + Ar_2^2, Ar_2 - 1)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    start(Ar_0, Ar_1, Ar_2) -> Com_1(eval(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 1 produces the following problem:
2:	T:
		(Comp: ?, Cost: 1)    eval(Ar_0, Ar_1, Ar_2) -> Com_1(eval(Ar_0 + 1, Ar_1 + Ar_0, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    eval(Ar_0, Ar_1, Ar_2) -> Com_1(eval(Ar_0 - Ar_2, Ar_1 + Ar_2^2, Ar_2 - 1)) [ Ar_0 >= Ar_1 ]
		(Comp: 1, Cost: 1)    start(Ar_0, Ar_1, Ar_2) -> Com_1(eval(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 1.011 sec (SMT: 0.976 sec)