MAYBE

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f26(Ar_0, Ar_1) -> Com_1(f2(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    f2(Ar_0, Ar_1) -> Com_1(f2(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_2)) [ 5 >= Ar_0 /\ 0 >= Fresh_2 + 1 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_1)) [ 5 >= Ar_0 /\ Fresh_1 >= 1 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1) -> Com_1(f9(Ar_0 + 1, Ar_1)) [ Ar_0 >= 6 ]
		(Comp: ?, Cost: 1)    f28(Ar_0, Ar_1) -> Com_1(f30(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f20(Ar_0 - 1, Ar_1)) [ Ar_0 >= 3 ]
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f9(Ar_0, Ar_1)) [ 2 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1) -> Com_1(f9(Ar_0 + 1, Ar_1)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, 0)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ Ar_0 >= 6 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f9(Fresh_0, Ar_1))
		(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

Testing for reachability in the complexity graph removes the following transitions from problem 1:
	f26(Ar_0, Ar_1) -> Com_1(f2(Ar_0, Ar_1))
	f2(Ar_0, Ar_1) -> Com_1(f2(Ar_0, Ar_1))
	f12(Ar_0, Ar_1) -> Com_1(f9(Ar_0 + 1, Ar_1)) [ Ar_0 >= 6 ]
	f28(Ar_0, Ar_1) -> Com_1(f30(Ar_0, Ar_1))
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f9(Ar_0, Ar_1)) [ 2 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f20(Ar_0 - 1, Ar_1)) [ Ar_0 >= 3 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1) -> Com_1(f9(Ar_0 + 1, Ar_1)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ Ar_0 >= 6 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, 0)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_1)) [ 5 >= Ar_0 /\ Fresh_1 >= 1 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_2)) [ 5 >= Ar_0 /\ 0 >= Fresh_2 + 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f9(Fresh_0, Ar_1))
		(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 2 produces the following problem:
3:	T:
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f9(Ar_0, Ar_1)) [ 2 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f20(Ar_0 - 1, Ar_1)) [ Ar_0 >= 3 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1) -> Com_1(f9(Ar_0 + 1, Ar_1)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ Ar_0 >= 6 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, 0)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_1)) [ 5 >= Ar_0 /\ Fresh_1 >= 1 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_2)) [ 5 >= Ar_0 /\ 0 >= Fresh_2 + 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f9(Fresh_0, Ar_1))
		(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 3 to obtain the following invariants:
  For symbol f12: -X_1 + 5 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f9(Fresh_0, Ar_1))
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_2)) [ 5 >= Ar_0 /\ 0 >= Fresh_2 + 1 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f12(Ar_0, Fresh_1)) [ 5 >= Ar_0 /\ Fresh_1 >= 1 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, 0)) [ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f9(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ Ar_0 >= 6 ]
		(Comp: ?, Cost: 1)    f12(Ar_0, Ar_1) -> Com_1(f9(Ar_0 + 1, Ar_1)) [ -Ar_0 + 5 >= 0 /\ 5 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f20(Ar_0 - 1, Ar_1)) [ Ar_0 >= 3 ]
		(Comp: ?, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f9(Ar_0, Ar_1)) [ 2 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 2.213 sec (SMT: 2.152 sec)