
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f11(Ar_0, Fresh_16, Ar_1, Fresh_17, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13)) [ Ar_0 >= 0 /\ Ar_1 >= 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f11(Ar_0, Fresh_14, Ar_1, Fresh_15, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13)) [ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6 + 1, Fresh_13, Fresh_13, Fresh_13, Ar_10, Ar_11, Ar_12, Ar_13)) [ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f13(Ar_0, 0, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Fresh_12, Ar_11, Ar_12, Ar_13)) [ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f11(Ar_0, Fresh_8, Fresh_9, Fresh_10, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Fresh_11, Ar_9, Ar_9, Ar_13)) [ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f11(Ar_0, Fresh_4, Fresh_5, Fresh_6, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Fresh_7, Ar_9, Ar_9, Ar_13)) [ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: ?, Cost: 1)    f300(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, 1, Fresh_2, Fresh_2, Fresh_2, Ar_10, Ar_11, Ar_12, Fresh_3)) [ Ar_5 >= 2 ]
		(Comp: ?, Cost: 1)    f300(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f13(Ar_0, 0, Ar_2, Ar_3, Ar_4, Ar_5, 0, Ar_7, Ar_8, 0, Fresh_0, 0, 0, Fresh_1)) [ 1 >= Ar_5 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13) -> Com_1(f300(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [Ar_0, Ar_1, Ar_4, Ar_5, Ar_6].
We thus obtain the following problem:
2:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
		(Comp: ?, Cost: 1)    f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
		(Comp: 1, Cost: 1)    f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 2
	Pol(f300) = 2
	Pol(f13) = 0
	Pol(f16) = 2
	Pol(f11) = 1
orients all transitions weakly and the transitions
	f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
	f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
	f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 = 0 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
		(Comp: 1, Cost: 1)    f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
		(Comp: 2, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = V_4
	Pol(f300) = V_4
	Pol(f13) = V_4 - V_5
	Pol(f16) = V_4 - V_5
	Pol(f11) = V_4 - V_5
orients all transitions weakly and the transition
	f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
		(Comp: 1, Cost: 1)       f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: Ar_5, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_0 >= 0 /\ Ar_1 >= 1 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 5 to obtain the following invariants:
  For symbol f11: X_4 - X_5 - 1 >= 0 /\ X_5 - 1 >= 0 /\ X_4 + X_5 - 3 >= 0 /\ -X_4 + X_5 + 1 >= 0 /\ X_3 + X_5 - 1 >= 0 /\ X_4 - 2 >= 0 /\ X_3 + X_4 - 2 >= 0 /\ X_3 >= 0
  For symbol f16: X_4 - X_5 - 1 >= 0 /\ X_5 - 1 >= 0 /\ X_4 + X_5 - 3 >= 0 /\ X_4 - 2 >= 0


This yielded the following problem:
6:	T:
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= 1 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: Ar_5, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: 2, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: 1, Cost: 1)       f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
		(Comp: 1, Cost: 1)       f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
		(Comp: 1, Cost: 0)       koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6)) [ 0 <= 0 ] with all transitions in problem 6, the following new transitions are obtained:
	koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 0 <= 0 /\ 1 >= Ar_5 ]
	koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ 0 <= 0 /\ Ar_5 >= 2 ]
We thus obtain the following problem:
7:	T:
		(Comp: 1, Cost: 1)       koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 0 <= 0 /\ 1 >= Ar_5 ]
		(Comp: 1, Cost: 1)       koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ 0 <= 0 /\ Ar_5 >= 2 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= 1 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: Ar_5, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: 2, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: 1, Cost: 1)       f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
		(Comp: 1, Cost: 1)       f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transitions from problem 7:
	f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ Ar_5 >= 2 ]
	f300(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 1 >= Ar_5 ]
We thus obtain the following problem:
8:	T:
		(Comp: 2, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ Ar_1 = 0 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_14, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ 0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)       f11(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_16, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ -Ar_5 + Ar_6 + 1 >= 0 /\ Ar_4 + Ar_6 - 1 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 + Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= 1 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_4, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_6 + 1 >= Ar_5 /\ 0 >= Fresh_5 + 1 /\ Ar_4 >= 0 ]
		(Comp: 2, Cost: 1)       f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f11(Ar_0, Fresh_8, Ar_4, Ar_5, Ar_6)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_6 + 1 >= Ar_5 /\ Fresh_9 >= 1 /\ Ar_4 >= 0 ]
		(Comp: Ar_5, Cost: 1)    f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6 + 1)) [ Ar_5 - Ar_6 - 1 >= 0 /\ Ar_6 - 1 >= 0 /\ Ar_5 + Ar_6 - 3 >= 0 /\ Ar_5 - 2 >= 0 /\ Ar_4 >= 0 /\ Ar_5 >= Ar_6 + 2 ]
		(Comp: 1, Cost: 1)       koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f16(Ar_0, Ar_1, Ar_4, Ar_5, 1)) [ 0 <= 0 /\ Ar_5 >= 2 ]
		(Comp: 1, Cost: 1)       koat_start(Ar_0, Ar_1, Ar_4, Ar_5, Ar_6) -> Com_1(f13(Ar_0, 0, Ar_4, Ar_5, 0)) [ 0 <= 0 /\ 1 >= Ar_5 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.160 sec (SMT: 0.114 sec)
