
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalfstart(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1))
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1))
		(Comp: ?, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(evalfstart(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)    evalfstart(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1))
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1))
		(Comp: ?, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(evalfstart(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalfstart) = 2
	Pol(evalfentryin) = 2
	Pol(evalfbb3in) = 2
	Pol(evalfreturnin) = 1
	Pol(evalfbb4in) = 2
	Pol(evalfbbin) = 2
	Pol(evalfbb1in) = 2
	Pol(evalfbb2in) = 2
	Pol(evalfstop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1))
	evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1))
	evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ 0 >= Ar_0 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalfstart(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 2, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1))
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1))
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(evalfstart(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol evalfbb1in: X_2 - 2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ -X_1 + X_2 - 1 >= 0 /\ X_1 - 1 >= 0
  For symbol evalfbb2in: X_1 - X_2 >= 0 /\ X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ X_1 - 1 >= 0
  For symbol evalfbb3in: X_2 - 1 >= 0
  For symbol evalfbb4in: X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ X_1 - 1 >= 0
  For symbol evalfbbin: X_2 - 1 >= 0 /\ X_1 + X_2 - 2 >= 0 /\ X_1 - 1 >= 0
  For symbol evalfreturnin: X_2 - 1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(evalfstart(Ar_0, Ar_1)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    evalfstart(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(evalfstart(Ar_0, Ar_1)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    evalfstart(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 5:
	evalfstart(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1))
We thus obtain the following problem:
6:	T:
		(Comp: 2, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ] with all transitions in problem 6, the following new transition is obtained:
	evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
We thus obtain the following problem:
7:	T:
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 ] with all transitions in problem 7, the following new transition is obtained:
	evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
We thus obtain the following problem:
8:	T:
		(Comp: ?, Cost: 2)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb1in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ] with all transitions in problem 8, the following new transition is obtained:
	evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
We thus obtain the following problem:
9:	T:
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: ?, Cost: 2)    evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 9:
	evalfbb1in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
We thus obtain the following problem:
10:	T:
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: ?, Cost: 1)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb2in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 ] with all transitions in problem 10, the following new transition is obtained:
	evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 11:
	evalfbb2in(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 2, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfreturnin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ] with all transitions in problem 12, the following new transition is obtained:
	evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
We thus obtain the following problem:
13:	T:
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 1)    evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 13:
	evalfreturnin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 ]
We thus obtain the following problem:
14:	T:
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 ] with all transitions in problem 14, the following new transition is obtained:
	evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 2)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(evalfentryin(Ar_0, Ar_1)) [ 0 <= 0 ] with all transitions in problem 15, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ 0 <= 0 /\ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 3)    koat_start(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ 0 <= 0 /\ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 1, Cost: 2)    evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 16:
	evalfentryin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
We thus obtain the following problem:
17:	T:
		(Comp: 2, Cost: 2)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
		(Comp: ?, Cost: 2)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb3in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 1, Cost: 3)    koat_start(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ 0 <= 0 /\ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

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

Testing for reachability in the complexity graph removes the following transitions from problem 18:
	evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ 0 >= Ar_0 ]
	evalfbb3in(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 >= 1 ]
We thus obtain the following problem:
19:	T:
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 /\ Ar_0 - Ar_1 >= 1 ]
		(Comp: ?, Cost: 4)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 /\ 0 >= Ar_0 - Ar_1 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 1, Cost: 3)    koat_start(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ 0 <= 0 /\ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalfbbin) = 1
	Pol(evalfbb4in) = 1
	Pol(evalfstop) = 0
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	evalfbbin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 /\ 0 >= Ar_0 - Ar_1 ]
strictly and produces the following problem:
20:	T:
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 /\ Ar_0 - Ar_1 >= 1 ]
		(Comp: 1, Cost: 4)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0 - Ar_1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 /\ Ar_0 - Ar_1 >= 0 /\ 0 >= Ar_0 - Ar_1 ]
		(Comp: ?, Cost: 3)    evalfbbin(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_0 + 1, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 /\ Ar_1 - 2 >= 0 /\ Ar_0 + Ar_1 - 3 >= 0 /\ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_0 + 1 >= 1 ]
		(Comp: 2, Cost: 2)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfstop(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ 0 >= C + 1 ]
		(Comp: ?, Cost: 1)    evalfbb4in(Ar_0, Ar_1) -> Com_1(evalfbbin(Ar_0, Ar_1)) [ Ar_1 - 1 >= 0 /\ Ar_0 + Ar_1 - 2 >= 0 /\ Ar_0 - 1 >= 0 /\ C >= 1 ]
		(Comp: 1, Cost: 3)    koat_start(Ar_0, Ar_1) -> Com_1(evalfbb4in(Ar_1, Ar_0)) [ 0 <= 0 /\ Ar_0 >= 1 /\ Ar_1 >= Ar_0 + 1 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.242 sec (SMT: 0.206 sec)
