
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 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)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalspeedFails4start) = 2
	Pol(evalspeedFails4entryin) = 2
	Pol(evalspeedFails4bb6in) = 2
	Pol(evalspeedFails4bb3in) = 2
	Pol(evalspeedFails4returnin) = 1
	Pol(evalspeedFails4bb4in) = 2
	Pol(evalspeedFails4bb5in) = 2
	Pol(evalspeedFails4stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
	evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0))
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0))
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol evalspeedFails4bb3in: X_2 - X_4 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4bb4in: X_2 - X_4 >= 0 /\ X_3 - 1 >= 0 /\ X_1 + X_3 >= 0 /\ -X_1 + X_3 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4bb5in: X_2 - X_4 >= 0 /\ -X_3 >= 0 /\ X_1 - X_3 + 1 >= 0 /\ -X_1 - X_3 + 1 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4bb6in: -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol evalspeedFails4returnin: -X_2 + X_4 - 1 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 5:
	evalspeedFails4start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3))
We thus obtain the following problem:
6:	T:
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ] with all transitions in problem 6, the following new transition is obtained:
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
We thus obtain the following problem:
7:	T:
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 7:
	evalspeedFails4bb4in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
8:	T:
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 ] with all transitions in problem 8, the following new transition is obtained:
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 ]
We thus obtain the following problem:
9:	T:
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 9:
	evalspeedFails4bb5in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
10:	T:
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 ] with all transitions in problem 10, the following new transition is obtained:
	evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 11:
	evalspeedFails4returnin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_1 + Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 ] with all transitions in problem 12, the following new transitions are obtained:
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
We thus obtain the following problem:
13:	T:
		(Comp: ?, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalspeedFails4bb3in) = 1
	Pol(evalspeedFails4stop) = 0
	Pol(evalspeedFails4bb6in) = 1
	Pol(evalspeedFails4entryin) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
strictly and produces the following problem:
14:	T:
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: ?, Cost: 2)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 ] with all transitions in problem 14, the following new transitions are obtained:
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
We thus obtain the following problem:
15:	T:
		(Comp: ?, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 15 produces the following problem:
16:	T:
		(Comp: ?, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(evalspeedFails4bb3in) = 1
	Pol(evalspeedFails4stop) = 0
	Pol(evalspeedFails4bb6in) = 1
	Pol(evalspeedFails4entryin) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
strictly and produces the following problem:
17:	T:
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

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

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 ] with all transitions in problem 18, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 5)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 6)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 ] with all transitions in problem 19, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 8)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 ]
		(Comp: 1, Cost: 9)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)    evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 ] with all transitions in problem 20, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
We thus obtain the following problem:
21:	T:
		(Comp: 1, Cost: 11)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 ]
		(Comp: 1, Cost: 12)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
		(Comp: 1, Cost: 9)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 ] with all transitions in problem 21, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_1 + 4 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 3 >= 0 ]
We thus obtain the following problem:
22:	T:
		(Comp: 1, Cost: 14)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 ]
		(Comp: 1, Cost: 15)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_1 + 4 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 3 >= 0 ]
		(Comp: 1, Cost: 12)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
		(Comp: 1, Cost: 9)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 ] with all transitions in problem 22, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_1 + 5 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 4 >= 0 ]
We thus obtain the following problem:
23:	T:
		(Comp: 1, Cost: 17)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 ]
		(Comp: 1, Cost: 18)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_1 + 5 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 4 >= 0 ]
		(Comp: 1, Cost: 15)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_1 + 4 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 3 >= 0 ]
		(Comp: 1, Cost: 12)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
		(Comp: 1, Cost: 9)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 ] with all transitions in problem 23, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_1 + 6 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 5 >= 0 ]
We thus obtain the following problem:
24:	T:
		(Comp: 1, Cost: 20)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 ]
		(Comp: 1, Cost: 21)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_1 + 6 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 5 >= 0 ]
		(Comp: 1, Cost: 18)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_1 + 5 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 4 >= 0 ]
		(Comp: 1, Cost: 15)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_1 + 4 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 3 >= 0 ]
		(Comp: 1, Cost: 12)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
		(Comp: 1, Cost: 9)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 ] with all transitions in problem 24, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 7)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 7)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_1 + 7 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 6 >= 0 ]
We thus obtain the following problem:
25:	T:
		(Comp: 1, Cost: 23)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 7)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 ]
		(Comp: 1, Cost: 24)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 7)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_1 + 7 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 6 >= 0 ]
		(Comp: 1, Cost: 21)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_1 + 6 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 5 >= 0 ]
		(Comp: 1, Cost: 18)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_1 + 5 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 4 >= 0 ]
		(Comp: 1, Cost: 15)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_1 + 4 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 3 >= 0 ]
		(Comp: 1, Cost: 12)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
		(Comp: 1, Cost: 9)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 7)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 ] with all transitions in problem 25, the following new transitions are obtained:
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 8)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 /\ Ar_2 - Ar_1 - 7 >= 0 /\ Ar_2 >= Ar_1 + 8 ]
	evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 8)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 /\ Ar_2 - Ar_1 - 7 >= 0 /\ Ar_1 + 8 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 7 >= 0 ]
We thus obtain the following problem:
26:	T:
		(Comp: 1, Cost: 26)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(1, Ar_2, Ar_0, Ar_1 + 8)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 /\ Ar_2 - Ar_1 - 7 >= 0 /\ Ar_2 >= Ar_1 + 8 ]
		(Comp: 1, Cost: 27)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 8)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_2 >= Ar_1 + 7 /\ Ar_2 - Ar_1 - 7 >= 0 /\ Ar_1 + 8 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 7 >= 0 ]
		(Comp: 1, Cost: 24)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 7)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_2 >= Ar_1 + 6 /\ Ar_2 - Ar_1 - 6 >= 0 /\ Ar_1 + 7 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 6 >= 0 ]
		(Comp: 1, Cost: 21)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 6)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_2 >= Ar_1 + 5 /\ Ar_2 - Ar_1 - 5 >= 0 /\ Ar_1 + 6 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 5 >= 0 ]
		(Comp: 1, Cost: 18)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 5)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_2 >= Ar_1 + 4 /\ Ar_2 - Ar_1 - 4 >= 0 /\ Ar_1 + 5 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 4 >= 0 ]
		(Comp: 1, Cost: 15)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 4)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_2 >= Ar_1 + 3 /\ Ar_2 - Ar_1 - 3 >= 0 /\ Ar_1 + 4 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 3 >= 0 ]
		(Comp: 1, Cost: 12)    evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 3)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_2 >= Ar_1 + 2 /\ Ar_2 - Ar_1 - 2 >= 0 /\ Ar_1 + 3 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 2 >= 0 ]
		(Comp: 1, Cost: 9)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 2)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= Ar_1 + 1 /\ Ar_2 - Ar_1 - 1 >= 0 /\ Ar_1 + 2 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 + 1 >= 0 ]
		(Comp: 1, Cost: 6)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_2 >= Ar_1 /\ Ar_2 - Ar_1 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 + 1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 3)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(1, Ar_2, Ar_0, Ar_1)) [ Ar_0 >= 1 /\ 0 >= 0 /\ 2 >= 0 /\ Ar_1 >= Ar_2 + 1 /\ -Ar_2 + Ar_1 - 1 >= 0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_3 + Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 + Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 >= 0 /\ -Ar_0 + Ar_2 >= 0 /\ Ar_1 >= Ar_3 + Ar_0 ]
		(Comp: 1, Cost: 4)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_3 - Ar_0 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 3)     evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3 - Ar_0)) [ Ar_1 - Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ 0 >= Ar_2 /\ -Ar_2 >= 0 /\ Ar_0 - Ar_2 + 1 >= 0 /\ -Ar_0 - Ar_2 + 1 >= 0 /\ Ar_1 >= Ar_3 - Ar_0 ]
		(Comp: 2, Cost: 2)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_3 >= Ar_1 + 1 /\ -Ar_1 + Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     evalspeedFails4bb6in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 >= Ar_3 ]
		(Comp: 1, Cost: 1)     evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4bb6in(-1, Ar_2, Ar_0, Ar_1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedFails4entryin(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.642 sec (SMT: 0.495 sec)
