
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 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)    f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 2 to obtain the following invariants:
  For symbol f1: -X_1 + 3000 >= 0 /\ X_1 - 3000 >= 0


This yielded the following problem:
3:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
	start location:	koat_start
	leaf cost:	0

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

Testing for reachability in the complexity graph removes the following transition from problem 4:
	f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
We thus obtain the following problem:
5:	T:
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1)) [ 0 <= 0 ] with all transitions in problem 5, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 1000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 ]
We thus obtain the following problem:
6:	T:
		(Comp: 1, Cost: 2)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 1000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 1000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 ] with all transitions in problem 6, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 2000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 ]
We thus obtain the following problem:
7:	T:
		(Comp: 1, Cost: 3)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 2000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 2000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 ] with all transitions in problem 7, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 3000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 ]
We thus obtain the following problem:
8:	T:
		(Comp: 1, Cost: 4)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 3000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 3000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 ] with all transitions in problem 8, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 4000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 ]
We thus obtain the following problem:
9:	T:
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 4000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 4000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 ] with all transitions in problem 9, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 5000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 ]
We thus obtain the following problem:
10:	T:
		(Comp: 1, Cost: 6)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 5000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 5000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 ] with all transitions in problem 10, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 6000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: 1, Cost: 7)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 6000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 6000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 ] with all transitions in problem 11, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 7000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 7000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 7000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 ] with all transitions in problem 12, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 8000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 ]
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 9)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 8000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 8000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 ] with all transitions in problem 13, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 9000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 9000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 9000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 ] with all transitions in problem 14, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 10000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 ]
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 11)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 10000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 10000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 ] with all transitions in problem 15, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 11000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 12)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 11000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 11000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 ] with all transitions in problem 16, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 12000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 ]
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 13)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 12000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 12000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 ] with all transitions in problem 17, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 13000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 /\ Ar_1 + 12889 >= 0 ]
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 14)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 13000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 /\ Ar_1 + 12889 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 13000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 /\ Ar_1 + 12889 >= 0 ] with all transitions in problem 18, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 14000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 /\ Ar_1 + 12889 >= 0 /\ Ar_1 + 13889 >= 0 ]
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 15)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1 + 14000)) [ 0 <= 0 /\ 0 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= 3000 /\ Ar_1 + 1889 >= 0 /\ Ar_1 + 2889 >= 0 /\ Ar_1 + 3889 >= 0 /\ Ar_1 + 4889 >= 0 /\ Ar_1 + 5889 >= 0 /\ Ar_1 + 6889 >= 0 /\ Ar_1 + 7889 >= 0 /\ Ar_1 + 8889 >= 0 /\ Ar_1 + 9889 >= 0 /\ Ar_1 + 10889 >= 0 /\ Ar_1 + 11889 >= 0 /\ Ar_1 + 12889 >= 0 /\ Ar_1 + 13889 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ -Ar_0 + 3000 >= 0 /\ Ar_0 - 3000 >= 0 /\ Ar_1 + 889 >= 0 /\ 3999 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.198 sec (SMT: 0.171 sec)
