
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0) -> Com_1(f5(0))
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f5(Ar_0 + 1)) [ 1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 /\ 0 >= B + 1 ]
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 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)    f0(Ar_0) -> Com_1(f5(0))
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f5(Ar_0 + 1)) [ 1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 /\ 0 >= B + 1 ]
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f0) = 1
	Pol(f5) = 1
	Pol(f13) = 0
	Pol(koat_start) = 1
orients all transitions weakly and the transitions
	f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 /\ 0 >= B + 1 ]
	f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    f0(Ar_0) -> Com_1(f5(0))
		(Comp: ?, Cost: 1)    f5(Ar_0) -> Com_1(f5(Ar_0 + 1)) [ 1 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 /\ 0 >= B + 1 ]
		(Comp: 1, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f0) = 2
	Pol(f5) = -V_1 + 2
	Pol(f13) = -V_1
	Pol(koat_start) = 2
orients all transitions weakly and the transition
	f5(Ar_0) -> Com_1(f5(Ar_0 + 1)) [ 1 >= Ar_0 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)    f0(Ar_0) -> Com_1(f5(0))
		(Comp: 2, Cost: 1)    f5(Ar_0) -> Com_1(f5(Ar_0 + 1)) [ 1 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 /\ 0 >= B + 1 ]
		(Comp: 1, Cost: 1)    f5(Ar_0) -> Com_1(f13(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 5

Time: 0.015 sec (SMT: 0.014 sec)
