
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_2 - 1, Ar_3, Ar_2, Ar_0)) [ Ar_0 >= 1 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 >= Ar_0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ Fresh_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 1:
	f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_1, Ar_2 - 1, Ar_3, Ar_2, Ar_0)) [ Ar_0 >= 1 /\ Ar_2 >= 1 ]
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 >= Ar_0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ Fresh_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 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, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 >= Ar_0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ Fresh_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 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 + X_3 + 4999 >= 0 /\ -X_1 + 5000 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ Fresh_0 >= 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 ]
	start location:	koat_start
	leaf cost:	0

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

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

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

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

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

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

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

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

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

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

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

By chaining the transition f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4991, Ar_2 - 8, Ar_2 - 9, 4992, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 ] with all transitions in problem 15, the following new transition is obtained:
	f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4990, Ar_2 - 9, Ar_2 - 10, 4991, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 ]
We thus obtain the following problem:
16:	T:
		(Comp: ?, Cost: 11)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4990, Ar_2 - 9, Ar_2 - 10, 4991, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 /\ Fresh_0 >= 1 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4990, Ar_2 - 9, Ar_2 - 10, 4991, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 ] with all transitions in problem 16, the following new transition is obtained:
	f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4989, Ar_2 - 10, Ar_2 - 11, 4990, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 ]
We thus obtain the following problem:
17:	T:
		(Comp: ?, Cost: 12)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4989, Ar_2 - 10, Ar_2 - 11, 4990, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 /\ Fresh_0 >= 1 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4989, Ar_2 - 10, Ar_2 - 11, 4990, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 ] with all transitions in problem 17, the following new transition is obtained:
	f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4988, Ar_2 - 11, Ar_2 - 12, 4989, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 ]
We thus obtain the following problem:
18:	T:
		(Comp: ?, Cost: 13)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4988, Ar_2 - 11, Ar_2 - 12, 4989, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 /\ Fresh_0 >= 1 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4988, Ar_2 - 11, Ar_2 - 12, 4989, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 ] with all transitions in problem 18, the following new transition is obtained:
	f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4987, Ar_2 - 12, Ar_2 - 13, 4988, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 /\ 12 >= 0 /\ 4988 >= 1 ]
We thus obtain the following problem:
19:	T:
		(Comp: ?, Cost: 14)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4987, Ar_2 - 12, Ar_2 - 13, 4988, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 /\ 12 >= 0 /\ 4988 >= 1 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 /\ Fresh_0 >= 1 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4987, Ar_2 - 12, Ar_2 - 13, 4988, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 /\ 12 >= 0 /\ 4988 >= 1 ] with all transitions in problem 19, the following new transition is obtained:
	f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4986, Ar_2 - 13, Ar_2 - 14, 4987, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 /\ 12 >= 0 /\ 4988 >= 1 /\ 13 >= 0 /\ 4987 >= 1 ]
We thus obtain the following problem:
20:	T:
		(Comp: ?, Cost: 15)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(4986, Ar_2 - 13, Ar_2 - 14, 4987, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ 0 >= Ar_0 /\ Ar_2 >= 1 /\ Ar_2 - 1 >= 0 /\ 0 >= 0 /\ 5000 >= 1 /\ 1 >= 0 /\ 4999 >= 1 /\ 2 >= 0 /\ 4998 >= 1 /\ 3 >= 0 /\ 4997 >= 1 /\ 4 >= 0 /\ 4996 >= 1 /\ 5 >= 0 /\ 4995 >= 1 /\ 6 >= 0 /\ 4994 >= 1 /\ 7 >= 0 /\ 4993 >= 1 /\ 8 >= 0 /\ 4992 >= 1 /\ 9 >= 0 /\ 4991 >= 1 /\ 10 >= 0 /\ 4990 >= 1 /\ 11 >= 0 /\ 4989 >= 1 /\ 12 >= 0 /\ 4988 >= 1 /\ 13 >= 0 /\ 4987 >= 1 ]
		(Comp: ?, Cost: 1)     f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(Ar_0 - 1, Ar_2, Ar_2 - 1, Ar_0, Ar_4, Ar_5)) [ -Ar_0 + Ar_2 + 4999 >= 0 /\ -Ar_0 + 5000 >= 0 /\ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(f0(5000, Ar_1, Fresh_0, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 /\ Fresh_0 >= 1 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.474 sec (SMT: 0.368 sec)
