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

A polynomial rank function with
	Pol(l0) = V_4
	Pol(l1) = V_4
	Pol(l2) = V_4 + 1
	Pol(koat_start) = V_4
orients all transitions weakly and the transition
	l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)       l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)       l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)       l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
		(Comp: Ar_3, Cost: 1)    l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]
		(Comp: 1, Cost: 0)       koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(l1) = 1
	Pol(l2) = 0
and size complexities
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-2) = Ar_2
	S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]", 0-3) = Ar_3
	S("l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]", 0-0) = ?
	S("l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]", 0-1) = ?
	S("l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]", 0-2) = ?
	S("l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]", 0-3) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]", 0-0) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]", 0-1) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]", 0-2) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]", 0-3) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]", 0-0) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]", 0-1) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]", 0-2) = ?
	S("l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]", 0-3) = ?
	S("l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))", 0-0) = Ar_0
	S("l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))", 0-1) = Ar_1
	S("l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))", 0-2) = Ar_2
	S("l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))", 0-3) = Ar_3
orients the transitions
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
weakly and the transition
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)           l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: Ar_3 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
		(Comp: Ar_3, Cost: 1)        l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ Ar_3 >= 1 ]
		(Comp: 1, Cost: 0)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 4 to obtain the following invariants:
  For symbol l2: -X_1 >= 0


This yielded the following problem:
5:	T:
		(Comp: 1, Cost: 0)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: Ar_3, Cost: 1)        l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: Ar_3 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)           l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(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(l0(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] with all transitions in problem 5, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
We thus obtain the following problem:
6:	T:
		(Comp: 1, Cost: 1)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: Ar_3, Cost: 1)        l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: Ar_3 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)           l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(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 6:
	l0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3))
We thus obtain the following problem:
7:	T:
		(Comp: Ar_3, Cost: 1)        l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_3, Ar_3, Ar_3, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: Ar_3 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

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

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

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

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

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

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

By chaining the transition l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(22*Ar_3 - 20, 7*Ar_3 - 15, Ar_3 - 6, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ 2*Ar_3 >= 1 /\ 4*Ar_3 >= 1 /\ 7*Ar_3 - 1 >= 1 /\ 11*Ar_3 - 4 >= 1 /\ 16*Ar_3 - 10 >= 1 ] with all transitions in problem 13, the following new transition is obtained:
	l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 35, 8*Ar_3 - 21, Ar_3 - 7, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ 2*Ar_3 >= 1 /\ 4*Ar_3 >= 1 /\ 7*Ar_3 - 1 >= 1 /\ 11*Ar_3 - 4 >= 1 /\ 16*Ar_3 - 10 >= 1 /\ 22*Ar_3 - 20 >= 1 ]
We thus obtain the following problem:
14:	T:
		(Comp: Ar_3, Cost: 8)        l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 35, 8*Ar_3 - 21, Ar_3 - 7, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ 2*Ar_3 >= 1 /\ 4*Ar_3 >= 1 /\ 7*Ar_3 - 1 >= 1 /\ 11*Ar_3 - 4 >= 1 /\ 16*Ar_3 - 10 >= 1 /\ 22*Ar_3 - 20 >= 1 ]
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: Ar_3 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ]
		(Comp: 1, Cost: 1)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 - 1)) [ 0 >= Ar_0 ] with all transitions in problem 14, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 64, 8*Ar_3 - 29, Ar_3 - 8, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 ]
We thus obtain the following problem:
15:	T:
		(Comp: Ar_3 + 1, Cost: 9)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 64, 8*Ar_3 - 29, Ar_3 - 8, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 ]
		(Comp: Ar_3, Cost: 8)        l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 35, 8*Ar_3 - 21, Ar_3 - 7, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ 2*Ar_3 >= 1 /\ 4*Ar_3 >= 1 /\ 7*Ar_3 - 1 >= 1 /\ 11*Ar_3 - 4 >= 1 /\ 16*Ar_3 - 10 >= 1 /\ 22*Ar_3 - 20 >= 1 ]
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(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 15:
	l2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 35, 8*Ar_3 - 21, Ar_3 - 7, Ar_3)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ 2*Ar_3 >= 1 /\ 4*Ar_3 >= 1 /\ 7*Ar_3 - 1 >= 1 /\ 11*Ar_3 - 4 >= 1 /\ 16*Ar_3 - 10 >= 1 /\ 22*Ar_3 - 20 >= 1 ]
We thus obtain the following problem:
16:	T:
		(Comp: Ar_3 + 1, Cost: 9)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 64, 8*Ar_3 - 29, Ar_3 - 8, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 ]
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)           koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(29*Ar_3 - 64, 8*Ar_3 - 29, Ar_3 - 8, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 ] with all transitions in problem 16, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(37*Ar_3 - 93, 9*Ar_3 - 37, Ar_3 - 9, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 ]
We thus obtain the following problem:
17:	T:
		(Comp: Ar_3 + 1, Cost: 10)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(37*Ar_3 - 93, 9*Ar_3 - 37, Ar_3 - 9, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 ]
		(Comp: ?, Cost: 1)            l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)            koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(37*Ar_3 - 93, 9*Ar_3 - 37, Ar_3 - 9, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 ] with all transitions in problem 17, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(46*Ar_3 - 130, 10*Ar_3 - 46, Ar_3 - 10, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 ]
We thus obtain the following problem:
18:	T:
		(Comp: Ar_3 + 1, Cost: 11)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(46*Ar_3 - 130, 10*Ar_3 - 46, Ar_3 - 10, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 ]
		(Comp: ?, Cost: 1)            l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)            koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(46*Ar_3 - 130, 10*Ar_3 - 46, Ar_3 - 10, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 ] with all transitions in problem 18, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(56*Ar_3 - 176, 11*Ar_3 - 56, Ar_3 - 11, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 ]
We thus obtain the following problem:
19:	T:
		(Comp: Ar_3 + 1, Cost: 12)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(56*Ar_3 - 176, 11*Ar_3 - 56, Ar_3 - 11, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 ]
		(Comp: ?, Cost: 1)            l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)            koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(56*Ar_3 - 176, 11*Ar_3 - 56, Ar_3 - 11, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 ] with all transitions in problem 19, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(67*Ar_3 - 232, 12*Ar_3 - 67, Ar_3 - 12, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 ]
We thus obtain the following problem:
20:	T:
		(Comp: Ar_3 + 1, Cost: 13)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(67*Ar_3 - 232, 12*Ar_3 - 67, Ar_3 - 12, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 ]
		(Comp: ?, Cost: 1)            l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)            koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(67*Ar_3 - 232, 12*Ar_3 - 67, Ar_3 - 12, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 ] with all transitions in problem 20, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(79*Ar_3 - 299, 13*Ar_3 - 79, Ar_3 - 13, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 /\ 67*Ar_3 - 232 >= 1 ]
We thus obtain the following problem:
21:	T:
		(Comp: Ar_3 + 1, Cost: 14)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(79*Ar_3 - 299, 13*Ar_3 - 79, Ar_3 - 13, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 /\ 67*Ar_3 - 232 >= 1 ]
		(Comp: ?, Cost: 1)            l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)            koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(79*Ar_3 - 299, 13*Ar_3 - 79, Ar_3 - 13, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 /\ 67*Ar_3 - 232 >= 1 ] with all transitions in problem 21, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(92*Ar_3 - 378, 14*Ar_3 - 92, Ar_3 - 14, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 /\ 67*Ar_3 - 232 >= 1 /\ 79*Ar_3 - 299 >= 1 ]
We thus obtain the following problem:
22:	T:
		(Comp: Ar_3 + 1, Cost: 15)    l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(92*Ar_3 - 378, 14*Ar_3 - 92, Ar_3 - 14, Ar_3 - 1)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 - 1 >= 1 /\ 2*Ar_3 - 2 >= 1 /\ 4*Ar_3 - 4 >= 1 /\ 7*Ar_3 - 8 >= 1 /\ 11*Ar_3 - 15 >= 1 /\ 16*Ar_3 - 26 >= 1 /\ 22*Ar_3 - 42 >= 1 /\ 29*Ar_3 - 64 >= 1 /\ 37*Ar_3 - 93 >= 1 /\ 46*Ar_3 - 130 >= 1 /\ 56*Ar_3 - 176 >= 1 /\ 67*Ar_3 - 232 >= 1 /\ 79*Ar_3 - 299 >= 1 ]
		(Comp: ?, Cost: 1)            l1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)            koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.650 sec (SMT: 0.570 sec)
