
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 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_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails3_start) = 2
	Pol(eval_speedFails3_bb0_in) = 2
	Pol(eval_speedFails3_0) = 2
	Pol(eval_speedFails3_1) = 2
	Pol(eval_speedFails3_2) = 2
	Pol(eval_speedFails3_3) = 2
	Pol(eval_speedFails3_4) = 2
	Pol(eval_speedFails3_5) = 2
	Pol(eval_speedFails3_6) = 2
	Pol(eval_speedFails3_7) = 2
	Pol(eval_speedFails3_bb1_in) = 2
	Pol(eval_speedFails3_bb2_in) = 2
	Pol(eval_speedFails3_bb3_in) = 1
	Pol(eval_speedFails3_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
	eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol eval_speedFails3_bb2_in: X_3 >= 0 /\ X_1 + X_3 >= 0 /\ -X_1 + X_3 >= 0 /\ X_1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 5:
	eval_speedFails3_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
6:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ] with all transitions in problem 6, the following new transition is obtained:
	eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
We thus obtain the following problem:
7:	T:
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ] with all transitions in problem 7, the following new transition is obtained:
	eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
We thus obtain the following problem:
8:	T:
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 8:
	eval_speedFails3_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
9:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 9, the following new transition is obtained:
	eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
10:	T:
		(Comp: 1, Cost: 2)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 1)    eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 10:
	eval_speedFails3_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
11:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 2)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 11, the following new transition is obtained:
	eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
12:	T:
		(Comp: 1, Cost: 3)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 2)    eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 12:
	eval_speedFails3_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
13:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 3)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 13, the following new transition is obtained:
	eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 4)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 3)    eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 14:
	eval_speedFails3_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
15:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 4)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_4(Ar_0, Fresh_0, Ar_2, Ar_3, Ar_4)) with all transitions in problem 15, the following new transition is obtained:
	eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 5)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 4)    eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 16:
	eval_speedFails3_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
17:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 5)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 17, the following new transition is obtained:
	eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 6)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 5)    eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 18:
	eval_speedFails3_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
19:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 6)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 19, the following new transition is obtained:
	eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 7)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 6)    eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 20:
	eval_speedFails3_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
21:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 7)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 21, the following new transition is obtained:
	eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
22:	T:
		(Comp: 1, Cost: 8)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 7)    eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 22:
	eval_speedFails3_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
23:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 8)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 23, the following new transition is obtained:
	eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
24:	T:
		(Comp: 1, Cost: 9)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 8)    eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 24:
	eval_speedFails3_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
25:	T:
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 9)    eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] with all transitions in problem 25, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
We thus obtain the following problem:
26:	T:
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 9)     eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 26:
	eval_speedFails3_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
27:	T:
		(Comp: ?, Cost: 1)     eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ]
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 ] with all transitions in problem 27, the following new transitions are obtained:
	eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 /\ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 > 0 ]
	eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 /\ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 <= 0 ]
We thus obtain the following problem:
28:	T:
		(Comp: ?, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 /\ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 /\ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 <= 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
		(Comp: ?, Cost: 1)     eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transitions from problem 28:
	eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 > 0 ]
	eval_speedFails3_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_0 >= 0 /\ Ar_1 <= 0 ]
We thus obtain the following problem:
29:	T:
		(Comp: ?, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 - Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 /\ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 <= 0 ]
		(Comp: ?, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_0 + Ar_3, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= 0 /\ Ar_0 <= Ar_2 /\ Ar_2 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 > 0 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_2 ]
		(Comp: 2, Cost: 2)     eval_speedFails3_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 < 0 ]
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails3_bb1_in(Ar_4, Fresh_0, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.461 sec (SMT: 0.324 sec)
