
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_catmouse_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_2 <= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 > Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_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: 1, Cost: 1)    eval_catmouse_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_2 <= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 > Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_catmouse_start) = 2
	Pol(eval_catmouse_bb0_in) = 2
	Pol(eval_catmouse_0) = 2
	Pol(eval_catmouse_1) = 2
	Pol(eval_catmouse_2) = 2
	Pol(eval_catmouse_3) = 2
	Pol(eval_catmouse_4) = 2
	Pol(eval_catmouse_5) = 2
	Pol(eval_catmouse_bb1_in) = 2
	Pol(eval_catmouse_bb2_in) = 2
	Pol(eval_catmouse_bb3_in) = 1
	Pol(eval_catmouse_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2))
	eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_catmouse_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_2 <= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_2 > Ar_0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_start(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 eval_catmouse_bb2_in: X_2 - X_3 >= 0
  For symbol eval_catmouse_bb3_in: -X_2 + X_3 - 1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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(eval_catmouse_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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 5:
	eval_catmouse_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2))
We thus obtain the following problem:
6:	T:
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 ] with all transitions in problem 6, the following new transition is obtained:
	eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
We thus obtain the following problem:
7:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 ] with all transitions in problem 7, the following new transition is obtained:
	eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
We thus obtain the following problem:
8:	T:
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 1)    eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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 8:
	eval_catmouse_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ -Ar_1 + Ar_2 - 1 >= 0 ]
We thus obtain the following problem:
9:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_5(Ar_0, Ar_1, Ar_2)) with all transitions in problem 9, the following new transition is obtained:
	eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
10:	T:
		(Comp: 1, Cost: 2)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 1)    eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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:
	eval_catmouse_5(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
11:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 2)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_4(Ar_0, Ar_1, Ar_2)) with all transitions in problem 11, the following new transition is obtained:
	eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
12:	T:
		(Comp: 1, Cost: 3)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 2)    eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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:
	eval_catmouse_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
13:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 3)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_3(Ar_0, Ar_1, Ar_2)) with all transitions in problem 13, the following new transition is obtained:
	eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 4)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 3)    eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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:
	eval_catmouse_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
15:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 4)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_2(Ar_0, Ar_1, Ar_2)) with all transitions in problem 15, the following new transition is obtained:
	eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 5)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 4)    eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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 16:
	eval_catmouse_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
17:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 5)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_1(Ar_0, Ar_1, Ar_2)) with all transitions in problem 17, the following new transition is obtained:
	eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 6)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 5)    eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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 18:
	eval_catmouse_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
19:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 6)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_0(Ar_0, Ar_1, Ar_2)) with all transitions in problem 19, the following new transition is obtained:
	eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 7)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 6)    eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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 20:
	eval_catmouse_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
21:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 7)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb0_in(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(eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] with all transitions in problem 21, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ]
We thus obtain the following problem:
22:	T:
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 7)    eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 22:
	eval_catmouse_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0))
We thus obtain the following problem:
23:	T:
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 ] with all transitions in problem 23, the following new transitions are obtained:
	eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
	eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 <= Ar_1 ]
We thus obtain the following problem:
24:	T:
		(Comp: ?, Cost: 3)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 <= Ar_1 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 24 produces the following problem:
25:	T:
		(Comp: ?, Cost: 3)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 <= Ar_1 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_catmouse_bb2_in) = 1
	Pol(eval_catmouse_stop) = 0
	Pol(eval_catmouse_bb1_in) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
strictly and produces the following problem:
26:	T:
		(Comp: 1, Cost: 3)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 <= Ar_1 ]
		(Comp: ?, Cost: 2)    eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: 2, Cost: 2)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb1_in(Ar_0, Ar_1, 0)) [ 0 <= 0 ] with all transitions in problem 26, the following new transitions are obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, 0)) [ 0 <= 0 /\ 0 > Ar_1 /\ -Ar_1 - 1 >= 0 ]
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, 0)) [ 0 <= 0 /\ 0 <= Ar_1 ]
We thus obtain the following problem:
27:	T:
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, 0)) [ 0 <= 0 /\ 0 > Ar_1 /\ -Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 9)     koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, 0)) [ 0 <= 0 /\ 0 <= Ar_1 ]
		(Comp: 1, Cost: 3)     eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 2)     eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 <= Ar_1 ]
		(Comp: ?, Cost: 2)     eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: 2, Cost: 2)     eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
		(Comp: 1, Cost: 1)     eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transitions from problem 27:
	eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2)) [ Ar_2 > Ar_1 /\ -Ar_1 + Ar_2 - 1 >= 0 ]
	eval_catmouse_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_2 <= Ar_1 ]
We thus obtain the following problem:
28:	T:
		(Comp: ?, Cost: 2)     eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 <= Ar_1 ]
		(Comp: 1, Cost: 3)     eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, Ar_2 + 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 <= Ar_0 /\ Ar_2 + 1 > Ar_1 /\ -Ar_1 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 2)     eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, Ar_2 - 1)) [ Ar_1 - Ar_2 >= 0 /\ Ar_2 > Ar_0 /\ Ar_2 - 1 <= Ar_1 ]
		(Comp: 1, Cost: 9)     koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_bb2_in(Ar_0, Ar_1, 0)) [ 0 <= 0 /\ 0 <= Ar_1 ]
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_catmouse_stop(Ar_0, Ar_1, 0)) [ 0 <= 0 /\ 0 > Ar_1 /\ -Ar_1 - 1 >= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.233 sec (SMT: 0.177 sec)
