
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    l0(Ar_0) -> Com_1(l1(Ar_0))
		(Comp: ?, Cost: 1)    l1(Ar_0) -> Com_1(l1(17*Ar_0)) [ Ar_0 > 0 /\ 42 > Ar_0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(l0(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)    l0(Ar_0) -> Com_1(l1(Ar_0))
		(Comp: ?, Cost: 1)    l1(Ar_0) -> Com_1(l1(17*Ar_0)) [ Ar_0 > 0 /\ 42 > Ar_0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(l0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(l0) = -V_1 + 42
	Pol(l1) = -V_1 + 42
	Pol(koat_start) = -V_1 + 42
orients all transitions weakly and the transition
	l1(Ar_0) -> Com_1(l1(17*Ar_0)) [ Ar_0 > 0 /\ 42 > Ar_0 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)            l0(Ar_0) -> Com_1(l1(Ar_0))
		(Comp: Ar_0 + 42, Cost: 1)    l1(Ar_0) -> Com_1(l1(17*Ar_0)) [ Ar_0 > 0 /\ 42 > Ar_0 ]
		(Comp: 1, Cost: 0)            koat_start(Ar_0) -> Com_1(l0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound Ar_0 + 43

Time: 0.009 sec (SMT: 0.009 sec)
