
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f3(Ar_0, Fresh_0, Ar_2, Ar_3)) [ Ar_0 >= 10 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ 9 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-1, Ar_1, Ar_2, -1)) [ 9 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f2(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 transitions from problem 1:
	f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f3(Ar_0, Fresh_0, Ar_2, Ar_3)) [ Ar_0 >= 10 ]
	f1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-1, Ar_1, Ar_2, -1)) [ 9 >= Ar_0 ]
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ 9 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ 9 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f2(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 f0: -X_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(f2(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f2(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(f0(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(f0(0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 5:
	f2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3))
We thus obtain the following problem:
6:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

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

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

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

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-3, Ar_1, -2, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 ] with all transitions in problem 9, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-4, Ar_1, -3, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 ]
We thus obtain the following problem:
10:	T:
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-4, Ar_1, -3, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-4, Ar_1, -3, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 ] with all transitions in problem 10, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-5, Ar_1, -4, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 ]
We thus obtain the following problem:
11:	T:
		(Comp: 1, Cost: 6)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-5, Ar_1, -4, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

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

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-6, Ar_1, -5, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 ] with all transitions in problem 12, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-7, Ar_1, -6, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 ]
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-7, Ar_1, -6, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-7, Ar_1, -6, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 ] with all transitions in problem 13, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-8, Ar_1, -7, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 9)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-8, Ar_1, -7, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-8, Ar_1, -7, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 ] with all transitions in problem 14, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-9, Ar_1, -8, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 ]
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-9, Ar_1, -8, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-9, Ar_1, -8, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 ] with all transitions in problem 15, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-10, Ar_1, -9, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 11)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-10, Ar_1, -9, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-10, Ar_1, -9, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 ] with all transitions in problem 16, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-11, Ar_1, -10, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 ]
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 12)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-11, Ar_1, -10, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-11, Ar_1, -10, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 ] with all transitions in problem 17, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-12, Ar_1, -11, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 ]
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 13)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-12, Ar_1, -11, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-12, Ar_1, -11, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 ] with all transitions in problem 18, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-13, Ar_1, -12, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 /\ 12 >= 0 /\ 9 >= -12 ]
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 14)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-13, Ar_1, -12, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 /\ 12 >= 0 /\ 9 >= -12 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-13, Ar_1, -12, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 /\ 12 >= 0 /\ 9 >= -12 ] with all transitions in problem 19, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-14, Ar_1, -13, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 /\ 12 >= 0 /\ 9 >= -12 /\ 13 >= 0 /\ 9 >= -13 ]
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 15)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(-14, Ar_1, -13, Ar_3)) [ 0 <= 0 /\ 0 >= 0 /\ 9 >= 0 /\ 1 >= 0 /\ 9 >= -1 /\ 2 >= 0 /\ 9 >= -2 /\ 3 >= 0 /\ 9 >= -3 /\ 4 >= 0 /\ 9 >= -4 /\ 5 >= 0 /\ 9 >= -5 /\ 6 >= 0 /\ 9 >= -6 /\ 7 >= 0 /\ 9 >= -7 /\ 8 >= 0 /\ 9 >= -8 /\ 9 >= -9 /\ 10 >= 0 /\ 9 >= -10 /\ 11 >= 0 /\ 9 >= -11 /\ 12 >= 0 /\ 9 >= -12 /\ 13 >= 0 /\ 9 >= -13 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_0, Ar_3)) [ -Ar_0 >= 0 /\ 9 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.090 sec (SMT: 0.072 sec)
