/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).

(0) CpxIntTrs
(1) Koat Proof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f0(A, B, C) -> Com_1(f11(0, 1, E)) :|: 99 >= D
f0(A, B, C) -> Com_1(f11(0, 1, E)) :|: TRUE

The start-symbols are:[f0_3]


----------------------------------------

(1) Koat Proof (FINISHED)
YES(?, 2)



Initial complexity problem:

1:	T:

		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(0, 1, Fresh_1)) [ 99 >= D ]

		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(0, 1, Fresh_0))

		(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



Repeatedly propagating knowledge in problem 1 produces the following problem:

2:	T:

		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(0, 1, Fresh_1)) [ 99 >= D ]

		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f11(0, 1, Fresh_0))

		(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



Complexity upper bound 2



Time: 0.013 sec (SMT: 0.012 sec)


----------------------------------------

(2)
BOUNDS(1, 1)