
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails2_start) = 2
	Pol(eval_speedFails2_bb0_in) = 2
	Pol(eval_speedFails2_0) = 2
	Pol(eval_speedFails2_1) = 2
	Pol(eval_speedFails2_2) = 2
	Pol(eval_speedFails2_3) = 2
	Pol(eval_speedFails2_4) = 2
	Pol(eval_speedFails2_bb1_in) = 2
	Pol(eval_speedFails2_bb2_in) = 2
	Pol(eval_speedFails2_bb3_in) = 1
	Pol(eval_speedFails2_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2))
	eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 = Ar_1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)    eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 > Ar_1 ]
		(Comp: 2, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)    eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2))
		(Comp: 2, Cost: 1)    eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails2_start) = V_2 - V_3 + 1
	Pol(eval_speedFails2_bb0_in) = V_2 - V_3 + 1
	Pol(eval_speedFails2_0) = V_2 - V_3 + 1
	Pol(eval_speedFails2_1) = V_2 - V_3 + 1
	Pol(eval_speedFails2_2) = V_2 - V_3 + 1
	Pol(eval_speedFails2_3) = V_2 - V_3 + 1
	Pol(eval_speedFails2_4) = V_2 - V_3 + 1
	Pol(eval_speedFails2_bb1_in) = -V_1 + V_2 + 1
	Pol(eval_speedFails2_bb2_in) = -V_1 + V_2
	Pol(eval_speedFails2_bb3_in) = -V_1 + V_2
	Pol(eval_speedFails2_stop) = -V_1 + V_2
	Pol(koat_start) = V_2 - V_3 + 1
orients all transitions weakly and the transition
	eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 < Ar_1 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)                  eval_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: Ar_1 + Ar_2 + 1, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 > Ar_1 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2))
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 4 to obtain the following invariants:
  For symbol eval_speedFails2_bb1_in: X_1 - X_3 >= 0
  For symbol eval_speedFails2_bb2_in: X_1 - X_3 >= 0
  For symbol eval_speedFails2_bb3_in: X_2 - X_3 >= 0 /\ X_1 - X_3 >= 0 /\ X_1 - X_2 >= 0 /\ -X_1 + X_2 >= 0


This yielded the following problem:
5:	T:
		(Comp: 1, Cost: 0)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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_speedFails2_start(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(eval_speedFails2_bb0_in(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(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 6:
	eval_speedFails2_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2))
We thus obtain the following problem:
7:	T:
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 1)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ] with all transitions in problem 7, the following new transition is obtained:
	eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
We thus obtain the following problem:
8:	T:
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ] with all transitions in problem 8, the following new transition is obtained:
	eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
We thus obtain the following problem:
9:	T:
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: ?, Cost: 1)                  eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 9:
	eval_speedFails2_bb2_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 ]
We thus obtain the following problem:
10:	T:
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 ] with all transitions in problem 10, the following new transition is obtained:
	eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: 2, Cost: 1)                  eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 11:
	eval_speedFails2_bb3_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_4(Ar_0, Ar_1, Ar_2)) with all transitions in problem 12, the following new transition is obtained:
	eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 2)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 1)                  eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 13:
	eval_speedFails2_4(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
14:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 2)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_3(Ar_0, Ar_1, Ar_2)) with all transitions in problem 14, the following new transition is obtained:
	eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 3)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 2)                  eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 15:
	eval_speedFails2_3(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
16:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 3)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_2(Ar_0, Ar_1, Ar_2)) with all transitions in problem 16, the following new transition is obtained:
	eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 4)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 3)                  eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 17:
	eval_speedFails2_2(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
18:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 4)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_1(Ar_0, Ar_1, Ar_2)) with all transitions in problem 18, the following new transition is obtained:
	eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 5)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 4)                  eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 19:
	eval_speedFails2_1(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
20:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 5)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_0(Ar_0, Ar_1, Ar_2)) with all transitions in problem 20, the following new transition is obtained:
	eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
21:	T:
		(Comp: 1, Cost: 6)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 5)                  eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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 21:
	eval_speedFails2_0(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
We thus obtain the following problem:
22:	T:
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 6)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
		(Comp: 1, Cost: 1)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_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_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] with all transitions in problem 22, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2)) [ 0 <= 0 ]
We thus obtain the following problem:
23:	T:
		(Comp: 1, Cost: 7)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 2, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_stop(Ar_0, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 = Ar_1 /\ Ar_1 - Ar_2 >= 0 /\ Ar_0 - Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 ]
		(Comp: ?, Cost: 2)                  eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 > Ar_1 ]
		(Comp: Ar_1 + Ar_2 + 1, Cost: 2)    eval_speedFails2_bb1_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_0 + 1, Ar_1, Ar_2)) [ Ar_0 - Ar_2 >= 0 /\ Ar_0 < Ar_1 ]
		(Comp: 1, Cost: 6)                  eval_speedFails2_bb0_in(Ar_0, Ar_1, Ar_2) -> Com_1(eval_speedFails2_bb1_in(Ar_2, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

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

Complexity upper bound ?

Time: 0.170 sec (SMT: 0.125 sec)
