MAYBE

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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f45(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f37(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f45(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_2 >= 3 ]
		(Comp: ?, Cost: 1)    f37(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f45(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    f53(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f53(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22))
		(Comp: ?, Cost: 1)    f55(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f58(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22))
		(Comp: ?, Cost: 1)    f45(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f53(Ar_0, Ar_1, Ar_2, 0, Fresh_19, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 0 >= Fresh_19 ]
		(Comp: ?, Cost: 1)    f45(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f53(Ar_0, Ar_1, Ar_2, 0, Fresh_18, 0, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Fresh_18 >= 1 ]
		(Comp: ?, Cost: 1)    f37(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f45(Ar_0, Ar_1, 2, Ar_3 + 1, Ar_4, Ar_5, Ar_7, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Ar_2 = 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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f45(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Fresh_14, Fresh_15, Fresh_16, Fresh_17, Ar_3, Fresh_14, Fresh_14, Fresh_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f37(Ar_0, Ar_1, Fresh_9, Ar_3, Ar_4, Ar_5, Ar_6, Fresh_10, Fresh_11, Fresh_12, Fresh_13, Ar_3, Fresh_10, Fresh_10, Fresh_10, Fresh_10, Ar_17, 0, Fresh_9, Fresh_9, Fresh_9, 0, Ar_22)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f37(Ar_0, Ar_1, Fresh_4, Ar_3, Ar_4, Ar_5, Ar_6, Fresh_5, Fresh_6, Fresh_7, Fresh_8, Ar_3, Fresh_5, Fresh_5, Fresh_5, Fresh_5, Ar_17, 0, Fresh_4, Fresh_4, Fresh_4, 0, Ar_22)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f11(Ar_0 + 1, Ar_1, 1, Ar_3, Ar_4, Ar_5, Ar_6, Fresh_0, Fresh_1, Fresh_2, Fresh_3, Ar_3, Fresh_0, Fresh_0, Fresh_0, Fresh_0, Ar_17, Ar_17, 1, 1, 1, 0, Ar_22)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f0(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f11(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, 0, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, 0))
		(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22) -> Com_1(f0(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, Ar_14, Ar_15, Ar_16, Ar_17, Ar_18, Ar_19, Ar_20, Ar_21, Ar_22)) [ 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_2].
We thus obtain the following problem:
2:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ Ar_2 = 2 ]
		(Comp: ?, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: ?, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: ?, Cost: 1)    f55(Ar_0, Ar_1, Ar_2) -> Com_1(f58(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 2:
	f55(Ar_0, Ar_1, Ar_2) -> Com_1(f58(Ar_0, Ar_1, Ar_2))
We thus obtain the following problem:
3:	T:
		(Comp: ?, Cost: 1)    f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: ?, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ Ar_2 = 2 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 3 produces the following problem:
4:	T:
		(Comp: ?, Cost: 1)    f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: ?, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ Ar_2 = 2 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f53) = 0
	Pol(f45) = 1
	Pol(f37) = 2
	Pol(f11) = 3
	Pol(f0) = 3
	Pol(koat_start) = 3
orients all transitions weakly and the transitions
	f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
	f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
	f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
	f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
	f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
	f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
	f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
	f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
strictly and produces the following problem:
5:	T:
		(Comp: ?, Cost: 1)    f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
		(Comp: 3, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: 3, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: 3, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
		(Comp: ?, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ Ar_2 = 2 ]
		(Comp: 3, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 5 produces the following problem:
6:	T:
		(Comp: ?, Cost: 1)    f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
		(Comp: 3, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: 3, Cost: 1)    f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: 3, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
		(Comp: 3, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ Ar_2 = 2 ]
		(Comp: 3, Cost: 1)    f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: 3, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: ?, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f53) = -V_1 + V_2
	Pol(f45) = -V_1 + V_2
	Pol(f37) = -V_1 + V_2
	Pol(f11) = -V_1 + V_2
	Pol(f0) = -V_1 + V_2
	Pol(koat_start) = -V_1 + V_2
orients all transitions weakly and the transition
	f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
strictly and produces the following problem:
7:	T:
		(Comp: ?, Cost: 1)              f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
		(Comp: 3, Cost: 1)              f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: 3, Cost: 1)              f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: 3, Cost: 1)              f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= 3 ]
		(Comp: 3, Cost: 1)              f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ Ar_2 = 2 ]
		(Comp: 3, Cost: 1)              f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ 1 >= Ar_2 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: Ar_0 + Ar_1, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)              f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: 1, Cost: 0)              koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 7 to obtain the following invariants:
  For symbol f37: -X_1 + X_2 - 1 >= 0


This yielded the following problem:
8:	T:
		(Comp: 1, Cost: 0)              koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)              f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0, Ar_1, Ar_2))
		(Comp: Ar_0 + Ar_1, Cost: 1)    f11(Ar_0, Ar_1, Ar_2) -> Com_1(f11(Ar_0 + 1, Ar_1, 1)) [ 0 >= Fresh_0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_4)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_5 /\ 0 >= Fresh_4 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f37(Ar_0, Ar_1, Fresh_9)) [ Ar_1 >= Ar_0 + 1 /\ 0 >= Fresh_10 /\ Fresh_9 >= 2 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Fresh_14 >= 1 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 3, Cost: 1)              f11(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 ]
		(Comp: 3, Cost: 1)              f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ -Ar_0 + Ar_1 - 1 >= 0 /\ 1 >= Ar_2 ]
		(Comp: 3, Cost: 1)              f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, 2)) [ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_2 = 2 ]
		(Comp: 3, Cost: 1)              f37(Ar_0, Ar_1, Ar_2) -> Com_1(f45(Ar_0, Ar_1, Ar_2)) [ -Ar_0 + Ar_1 - 1 >= 0 /\ Ar_2 >= 3 ]
		(Comp: 3, Cost: 1)              f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ Fresh_18 >= 1 ]
		(Comp: 3, Cost: 1)              f45(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2)) [ 0 >= Fresh_19 ]
		(Comp: ?, Cost: 1)              f53(Ar_0, Ar_1, Ar_2) -> Com_1(f53(Ar_0, Ar_1, Ar_2))
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 2.520 sec (SMT: 2.412 sec)