
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    l0(Ar_0, Ar_1) -> Com_1(l1(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1) -> Com_1(l1(Ar_1, Ar_1 - 1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(l0(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)    l0(Ar_0, Ar_1) -> Com_1(l1(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1) -> Com_1(l1(Ar_1, Ar_1 - 1)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(l0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Complexity upper bound ?

Time: 0.258 sec (SMT: 0.218 sec)
