WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f8(0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f8(Ar_0, Ar_1, Ar_2) -> Com_1(f14(Ar_0, Ar_0, Ar_2)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: ?, Cost: 1)    f8(Ar_0, Ar_1, Ar_2) -> Com_1(f14(Ar_0, Ar_0, Ar_2)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_2) -> Com_1(f28(Ar_0, Ar_1, Fresh_1)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_2) -> Com_1(f28(Ar_0, Ar_1, Fresh_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_2) -> Com_1(f23(Ar_0 + 1, Ar_1, Ar_2)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f28(Ar_0, Ar_1, Ar_2) -> Com_1(f23(Ar_0 + 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f28(Ar_0, Ar_1, Ar_2) -> Com_1(f23(Ar_0 + 1, Ar_1, Ar_2)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f23(Ar_0, Ar_1, Ar_2) -> Com_1(f38(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f8(Ar_0, Ar_1, Ar_2) -> Com_1(f8(Ar_0 + 1, Ar_0, Ar_2)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f14(Ar_0, Ar_1, Ar_2) -> Com_1(f8(Ar_0 + 1, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    f14(Ar_0, Ar_1, Ar_2) -> Com_1(f8(Ar_0 + 1, Ar_1, Ar_2)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f8(Ar_0, Ar_1, Ar_2) -> Com_1(f23(0, Ar_1, Ar_2)) [ Ar_0 >= 1000 ]
		(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

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [Ar_0].
We thus obtain the following problem:
2:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: ?, Cost: 1)    f0(Ar_0) -> Com_1(f8(0))
	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) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)    f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 1
	Pol(f0) = 1
	Pol(f8) = 1
	Pol(f23) = 1
	Pol(f14) = 1
	Pol(f38) = 0
	Pol(f28) = 1
orients all transitions weakly and the transition
	f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)    f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 1
	Pol(f0) = 1
	Pol(f8) = 1
	Pol(f23) = 0
	Pol(f14) = 1
	Pol(f38) = 0
	Pol(f28) = 0
orients all transitions weakly and the transition
	f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)    f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 2997
	Pol(f0) = 2997
	Pol(f8) = 2997
	Pol(f23) = -2*V_1 + 2997
	Pol(f14) = 2997
	Pol(f38) = -2*V_1 + 2997
	Pol(f28) = -2*V_1 + 2996
orients all transitions weakly and the transitions
	f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
	f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
strictly and produces the following problem:
6:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)       f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)       f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)       f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: ?, Cost: 1)       f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)       f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 6 produces the following problem:
7:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)       f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: ?, Cost: 1)       f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)       f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 1998
	Pol(f0) = 1998
	Pol(f8) = 1998
	Pol(f23) = -V_1 + 1000
	Pol(f14) = 1998
	Pol(f38) = -V_1 + 1000
	Pol(f28) = -V_1 + 999
orients all transitions weakly and the transition
	f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
strictly and produces the following problem:
8:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)       f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: 1998, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)       f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f8) = -2*V_1 + 2998
	Pol(f14) = -2*V_1 + 2997
and size complexities
	S("f0(Ar_0) -> Com_1(f8(0))", 0-0) = 0
	S("f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\\ 999 >= D ]", 0-0) = ?
	S("f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]", 0-0) = ?
	S("f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\\ 0 >= E + 1 ]", 0-0) = 12988
	S("f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]", 0-0) = 12988
	S("f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]", 0-0) = 12988
	S("f28(Ar_0) -> Com_1(f23(Ar_0 + 1))", 0-0) = 12988
	S("f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]", 0-0) = 12988
	S("f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]", 0-0) = 12988
	S("f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]", 0-0) = ?
	S("f14(Ar_0) -> Com_1(f8(Ar_0 + 1))", 0-0) = ?
	S("f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]", 0-0) = ?
	S("f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]", 0-0) = 0
	S("koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]", 0-0) = Ar_0
orients the transitions
	f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
	f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
	f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
	f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
	f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
weakly and the transition
	f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
strictly and produces the following problem:
9:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)       f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: 1998, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: ?, Cost: 1)       f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2998, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)       f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f14) = -2*V_1 + 1998
	Pol(f8) = -2*V_1 + 1999
and size complexities
	S("f0(Ar_0) -> Com_1(f8(0))", 0-0) = 0
	S("f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\\ 999 >= D ]", 0-0) = ?
	S("f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]", 0-0) = ?
	S("f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\\ 0 >= E + 1 ]", 0-0) = 12988
	S("f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]", 0-0) = 12988
	S("f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]", 0-0) = 12988
	S("f28(Ar_0) -> Com_1(f23(Ar_0 + 1))", 0-0) = 12988
	S("f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]", 0-0) = 12988
	S("f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]", 0-0) = 12988
	S("f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]", 0-0) = ?
	S("f14(Ar_0) -> Com_1(f8(Ar_0 + 1))", 0-0) = ?
	S("f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]", 0-0) = ?
	S("f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]", 0-0) = 0
	S("koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]", 0-0) = Ar_0
orients the transitions
	f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
	f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
	f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
	f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
	f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
weakly and the transitions
	f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
	f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
strictly and produces the following problem:
10:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: ?, Cost: 1)       f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: 1999, Cost: 1)    f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)       f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: 1998, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: 1999, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2998, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)       f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 10 produces the following problem:
11:	T:
		(Comp: 1, Cost: 0)       koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)       f8(Ar_0) -> Com_1(f23(0)) [ Ar_0 >= 1000 ]
		(Comp: 4997, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 998 >= D ]
		(Comp: 4997, Cost: 1)    f14(Ar_0) -> Com_1(f8(Ar_0 + 1))
		(Comp: 1999, Cost: 1)    f8(Ar_0) -> Com_1(f8(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 1, Cost: 1)       f23(Ar_0) -> Com_1(f38(Ar_0)) [ Ar_0 >= 1000 ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 998 >= D ]
		(Comp: 5994, Cost: 1)    f28(Ar_0) -> Com_1(f23(Ar_0 + 1))
		(Comp: 1998, Cost: 1)    f23(Ar_0) -> Com_1(f23(Ar_0 + 1)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2997, Cost: 1)    f23(Ar_0) -> Com_1(f28(Ar_0)) [ 999 >= Ar_0 /\ 0 >= E + 1 ]
		(Comp: 1999, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 ]
		(Comp: 2998, Cost: 1)    f8(Ar_0) -> Com_1(f14(Ar_0)) [ 999 >= Ar_0 /\ 999 >= D ]
		(Comp: 1, Cost: 1)       f0(Ar_0) -> Com_1(f8(0))
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 36973

Time: 1.363 sec (SMT: 1.296 sec)