
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 1 ]
		(Comp: ?, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9start(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: 1, Cost: 1)    evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 1 ]
		(Comp: ?, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalcousot9start) = 2
	Pol(evalcousot9entryin) = 2
	Pol(evalcousot9bb3in) = 2
	Pol(evalcousot9bbin) = 2
	Pol(evalcousot9returnin) = 1
	Pol(evalcousot9bb1in) = 2
	Pol(evalcousot9bb2in) = 2
	Pol(evalcousot9stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2))
	evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2))
		(Comp: 2, Cost: 1)    evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol evalcousot9bb1in: X_3 - 1 >= 0 /\ X_2 + X_3 - 2 >= 0 /\ -X_2 + X_3 >= 0 /\ X_1 + X_3 - 2 >= 0 /\ X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ X_1 - 1 >= 0
  For symbol evalcousot9bb2in: X_3 - 1 >= 0 /\ X_2 + X_3 - 2 >= 0 /\ -X_2 + X_3 >= 0 /\ -X_1 + X_3 - 1 >= 0 /\ X_2 - 1 >= 0 /\ -X_1 + X_2 - 1 >= 0 /\ -X_1 >= 0
  For symbol evalcousot9bb3in: -X_2 + X_3 >= 0
  For symbol evalcousot9bbin: X_3 - 1 >= 0 /\ X_2 + X_3 - 2 >= 0 /\ -X_2 + X_3 >= 0 /\ X_2 - 1 >= 0
  For symbol evalcousot9returnin: -X_2 + X_3 >= 0 /\ -X_2 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: ?, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)    evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 1)    evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)    evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 2*V_3
	Pol(evalcousot9start) = 2*V_3
	Pol(evalcousot9returnin) = 2*V_2
	Pol(evalcousot9stop) = 2*V_2
	Pol(evalcousot9bb2in) = 2*V_2 - 1
	Pol(evalcousot9bb3in) = 2*V_2
	Pol(evalcousot9bb1in) = 2*V_2
	Pol(evalcousot9bbin) = 2*V_2
	Pol(evalcousot9entryin) = 2*V_3
orients all transitions weakly and the transitions
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
	evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 0)         koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)         evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)         evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)         evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: ?, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 1)         evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)         evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] with all transitions in problem 5, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
We thus obtain the following problem:
6:	T:
		(Comp: 1, Cost: 1)         koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)         evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)         evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)         evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: ?, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 1)         evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)         evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 6:
	evalcousot9start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2))
We thus obtain the following problem:
7:	T:
		(Comp: ?, Cost: 1)         evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)         evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 2, Cost: 1)         evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: ?, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)         evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)         koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ] with all transitions in problem 7, the following new transition is obtained:
	evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
8:	T:
		(Comp: ?, Cost: 2)         evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)         evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 2, Cost: 1)         evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: ?, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)         evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)         evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)         koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 8 produces the following problem:
9:	T:
		(Comp: ?, Cost: 2)             evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 1)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 2, Cost: 1)             evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb1in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ] with all transitions in problem 9, the following new transition is obtained:
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
10:	T:
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: ?, Cost: 2)             evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 2, Cost: 1)             evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 10:
	evalcousot9bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
11:	T:
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 2, Cost: 1)             evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ] with all transitions in problem 11, the following new transition is obtained:
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: 2*Ar_2, Cost: 2)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: 2*Ar_2, Cost: 1)        evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 12:
	evalcousot9bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
We thus obtain the following problem:
13:	T:
		(Comp: 2*Ar_2, Cost: 2)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9returnin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 ] with all transitions in problem 13, the following new transition is obtained:
	evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
We thus obtain the following problem:
14:	T:
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 2)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)             evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 14:
	evalcousot9returnin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ -Ar_1 >= 0 ]
We thus obtain the following problem:
15:	T:
		(Comp: 2*Ar_2, Cost: 2)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
		(Comp: 1, Cost: 1)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9entryin(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] with all transitions in problem 15, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 2)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
		(Comp: 2*Ar_2, Cost: 2)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 1)             evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 16:
	evalcousot9entryin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2))
We thus obtain the following problem:
17:	T:
		(Comp: 2*Ar_2, Cost: 2)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 2)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 ] with all transitions in problem 17, the following new transitions are obtained:
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 ]
We thus obtain the following problem:
18:	T:
		(Comp: 2*Ar_2, Cost: 4)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
		(Comp: 2*Ar_2, Cost: 3)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 2)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 ] with all transitions in problem 18, the following new transition is obtained:
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 1, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 ]
We thus obtain the following problem:
19:	T:
		(Comp: 2*Ar_2, Cost: 6)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 1, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 ]
		(Comp: 2*Ar_2, Cost: 4)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 2)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 1, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 ] with all transitions in problem 19, the following new transition is obtained:
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 ]
We thus obtain the following problem:
20:	T:
		(Comp: 2*Ar_2, Cost: 9)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 ]
		(Comp: 2*Ar_2, Cost: 4)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 2)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 ] with all transitions in problem 20, the following new transitions are obtained:
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 2, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ 0 >= Ar_2 - 2 /\ 1 >= 0 /\ -Ar_2 + Ar_1 >= 0 /\ -Ar_2 + 2 >= 0 /\ -Ar_1 + Ar_2 + 2 >= 0 /\ 0 >= Ar_1 - 2 /\ -Ar_1 + 2 >= 0 ]
	evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 3, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ Ar_2 - 2 >= 1 /\ 2*Ar_2 - 4 >= 0 /\ Ar_2 + Ar_1 - 5 >= 0 /\ Ar_2 - 3 >= 0 ]
We thus obtain the following problem:
21:	T:
		(Comp: 2*Ar_2, Cost: 13)       evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 2, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ 0 >= Ar_2 - 2 /\ 1 >= 0 /\ -Ar_2 + Ar_1 >= 0 /\ -Ar_2 + 2 >= 0 /\ -Ar_1 + Ar_2 + 2 >= 0 /\ 0 >= Ar_1 - 2 /\ -Ar_1 + 2 >= 0 ]
		(Comp: 2*Ar_2, Cost: 12)       evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 3, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ Ar_2 - 2 >= 1 /\ 2*Ar_2 - 4 >= 0 /\ Ar_2 + Ar_1 - 5 >= 0 /\ Ar_2 - 3 >= 0 ]
		(Comp: 2*Ar_2, Cost: 4)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 2)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bb3in(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 ] with all transitions in problem 21, the following new transitions are obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 /\ 0 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 ]
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_2 >= 1 ]
We thus obtain the following problem:
22:	T:
		(Comp: 1, Cost: 4)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 /\ 0 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 ]
		(Comp: 1, Cost: 3)             koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 2*Ar_2, Cost: 13)       evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 2, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ 0 >= Ar_2 - 2 /\ 1 >= 0 /\ -Ar_2 + Ar_1 >= 0 /\ -Ar_2 + 2 >= 0 /\ -Ar_1 + Ar_2 + 2 >= 0 /\ 0 >= Ar_1 - 2 /\ -Ar_1 + 2 >= 0 ]
		(Comp: 2*Ar_2, Cost: 12)       evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 3, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ Ar_2 - 2 >= 1 /\ 2*Ar_2 - 4 >= 0 /\ Ar_2 + Ar_1 - 5 >= 0 /\ Ar_2 - 3 >= 0 ]
		(Comp: 2*Ar_2, Cost: 4)        evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
		(Comp: ?, Cost: 3)             evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)             evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
		(Comp: 2*Ar_2 + 1, Cost: 1)    evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transitions from problem 22:
	evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ 0 >= Ar_1 /\ -Ar_1 >= 0 ]
	evalcousot9bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
23:	T:
		(Comp: 2*Ar_2, Cost: 12)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_2 - 3, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ Ar_2 - 2 >= 1 /\ 2*Ar_2 - 4 >= 0 /\ Ar_2 + Ar_1 - 5 >= 0 /\ Ar_2 - 3 >= 0 ]
		(Comp: 2*Ar_2, Cost: 13)    evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 2, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ Ar_1 - 1 >= 1 /\ Ar_1 + Ar_2 - 3 >= 0 /\ Ar_1 - 2 >= 0 /\ Ar_2 >= 1 /\ 2*Ar_2 - 2 >= 0 /\ Ar_2 + Ar_1 - 3 >= 0 /\ Ar_2 - 1 >= 1 /\ 2*Ar_2 - 3 >= 0 /\ Ar_2 + Ar_1 - 4 >= 0 /\ Ar_2 - 2 >= 0 /\ 0 >= Ar_2 - 2 /\ 1 >= 0 /\ -Ar_2 + Ar_1 >= 0 /\ -Ar_2 + 2 >= 0 /\ -Ar_1 + Ar_2 + 2 >= 0 /\ 0 >= Ar_1 - 2 /\ -Ar_1 + 2 >= 0 ]
		(Comp: 2*Ar_2, Cost: 4)     evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Ar_2, Ar_1 - 1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 >= 0 /\ -Ar_1 + Ar_2 + 1 >= 0 /\ 0 >= Ar_1 - 1 /\ -Ar_1 + 1 >= 0 ]
		(Comp: ?, Cost: 3)          evalcousot9bbin(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Ar_0 - 1, Ar_1, Ar_2)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 2 >= 0 /\ -Ar_1 + Ar_2 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 /\ Ar_0 + Ar_2 - 2 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 3)          koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9bbin(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 1, Cost: 4)          koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalcousot9stop(Fresh_0, Ar_2, Ar_2)) [ 0 <= 0 /\ 0 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.417 sec (SMT: 0.334 sec)
