MAYBE

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Fresh_3, Ar_3, Ar_4)) [ 0 >= Fresh_3 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Fresh_2, Ar_3, Ar_4)) [ Fresh_2 >= 101 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f15(Fresh_0, 0, Fresh_0, Fresh_1, Ar_4)) [ 100 >= Fresh_0 /\ Fresh_0 >= 1 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_4 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, Ar_2, Ar_3, 0)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, Ar_2, Ar_3, 0))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 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].
We thus obtain the following problem:
2:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\ Fresh_0 >= 1 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_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) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\ Fresh_0 >= 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 2
	Pol(f0) = 2
	Pol(f16) = 2
	Pol(f23) = 1
	Pol(f15) = 2
	Pol(f7) = 0
orients all transitions weakly and the transitions
	f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]
	f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))
	f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))
		(Comp: 2, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]
		(Comp: 2, Cost: 1)    f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)    f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\ Fresh_0 >= 1 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: ?, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f16) = 2*V_1 - 2*V_2 + 2
	Pol(f15) = 2*V_1 - 2*V_2 + 3
and size complexities
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]", 0-0) = 100
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]", 0-1) = ?
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]", 0-2) = Ar_4
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]", 0-0) = 100
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]", 0-1) = ?
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]", 0-2) = Ar_4
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]", 0-0) = ?
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]", 0-1) = Ar_1
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]", 0-2) = Ar_4
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]", 0-0) = ?
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]", 0-1) = Ar_1
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]", 0-2) = Ar_4
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\\ Fresh_0 >= 1 ]", 0-0) = 100
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\\ Fresh_0 >= 1 ]", 0-1) = 0
	S("f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\\ Fresh_0 >= 1 ]", 0-2) = Ar_4
	S("f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))", 0-0) = 100
	S("f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))", 0-1) = ?
	S("f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))", 0-2) = Ar_4
	S("f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]", 0-0) = 100
	S("f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]", 0-1) = ?
	S("f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]", 0-2) = ?
	S("f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]", 0-0) = 100
	S("f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]", 0-1) = ?
	S("f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]", 0-2) = ?
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]", 0-0) = 100
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]", 0-1) = 101
	S("f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]", 0-2) = 0
	S("f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))", 0-0) = 100
	S("f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))", 0-1) = ?
	S("f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))", 0-2) = 0
	S("koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]", 0-0) = Ar_0
	S("koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]", 0-1) = Ar_1
	S("koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]", 0-2) = Ar_4
orients the transitions
	f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))
	f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]
	f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]
weakly and the transition
	f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_0 >= Ar_1 + 1 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 0)      koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)      f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0))
		(Comp: 2, Cost: 1)      f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_0 = Ar_1 ]
		(Comp: 2, Cost: 1)      f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_4 >= Ar_1 ]
		(Comp: ?, Cost: 1)      f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 >= Ar_4 + 1 ]
		(Comp: ?, Cost: 1)      f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4))
		(Comp: 1, Cost: 1)      f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\ Fresh_0 >= 1 ]
		(Comp: 1, Cost: 1)      f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]
		(Comp: 1, Cost: 1)      f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]
		(Comp: ?, Cost: 1)      f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= Ar_0 + 1 ]
		(Comp: 203, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_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 f15: X_2 >= 0 /\ X_1 + X_2 - 1 >= 0 /\ -X_1 + X_2 + 100 >= 0 /\ -X_1 + 100 >= 0 /\ X_1 - 1 >= 0
  For symbol f16: X_2 >= 0 /\ X_1 + X_2 - 1 >= 0 /\ -X_1 + X_2 + 100 >= 0 /\ -X_1 + 100 >= 0 /\ X_1 - 1 >= 0
  For symbol f23: X_2 - X_3 + 1 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 + 1 >= 0 /\ X_1 + X_3 - 1 >= 0 /\ -X_1 + X_3 + 100 >= 0 /\ X_2 + 1 >= 0 /\ X_1 + X_2 >= 0 /\ -X_1 + X_2 + 101 >= 0 /\ -X_1 + 100 >= 0 /\ X_1 - 1 >= 0


This yielded the following problem:
6:	T:
		(Comp: 203, Cost: 1)    f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 + 100 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)      f15(Ar_0, Ar_1, Ar_4) -> Com_1(f16(Ar_0, Ar_1, Ar_4)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 + 100 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_0 + 1 ]
		(Comp: 1, Cost: 1)      f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_3, Ar_1, Ar_4)) [ 0 >= Fresh_3 ]
		(Comp: 1, Cost: 1)      f0(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Fresh_2, Ar_1, Ar_4)) [ Fresh_2 >= 101 ]
		(Comp: 1, Cost: 1)      f0(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Fresh_0, 0, Ar_4)) [ 100 >= Fresh_0 /\ Fresh_0 >= 1 ]
		(Comp: ?, Cost: 1)      f16(Ar_0, Ar_1, Ar_4) -> Com_1(f15(Ar_0, Ar_1 + 1, Ar_4)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 + 100 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: ?, Cost: 1)      f23(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1, Ar_4 + 1)) [ Ar_1 - Ar_4 + 1 >= 0 /\ Ar_4 >= 0 /\ Ar_1 + Ar_4 + 1 >= 0 /\ Ar_0 + Ar_4 - 1 >= 0 /\ -Ar_0 + Ar_4 + 100 >= 0 /\ Ar_1 + 1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 + 101 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_1 >= Ar_4 + 1 ]
		(Comp: 2, Cost: 1)      f23(Ar_0, Ar_1, Ar_4) -> Com_1(f7(Ar_0, Ar_1, Ar_4)) [ Ar_1 - Ar_4 + 1 >= 0 /\ Ar_4 >= 0 /\ Ar_1 + Ar_4 + 1 >= 0 /\ Ar_0 + Ar_4 - 1 >= 0 /\ -Ar_0 + Ar_4 + 100 >= 0 /\ Ar_1 + 1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 + 101 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_4 >= Ar_1 ]
		(Comp: 2, Cost: 1)      f15(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_0 - 1, 0)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 + 100 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 /\ Ar_0 = Ar_1 ]
		(Comp: 2, Cost: 1)      f16(Ar_0, Ar_1, Ar_4) -> Com_1(f23(Ar_0, Ar_1 - 1, 0)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 - 1 >= 0 /\ -Ar_0 + Ar_1 + 100 >= 0 /\ -Ar_0 + 100 >= 0 /\ Ar_0 - 1 >= 0 ]
		(Comp: 1, Cost: 0)      koat_start(Ar_0, Ar_1, Ar_4) -> Com_1(f0(Ar_0, Ar_1, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 3.650 sec (SMT: 3.515 sec)