details

property	value
status	complete
benchmark	p-7b.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n077.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.80756902695 seconds
cpu usage	4.088246163
max memory	2.69357056E8

stage attributes

key	value
output-size	8571
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 11 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 173 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f3(A, B, C, D) -> Com_1(f1(0, B, C, D)) :|: TRUE f1(A, B, C, D) -> Com_1(f2(A, B, C, E)) :|: B >= C f1(A, B, C, D) -> Com_1(f2(1, 1 + B, C, E)) :|: 0 >= A && B + 1 >= C && B + 1 <= C f1(A, B, C, D) -> Com_1(f1(0, 1 + B, -(1) + C, D)) :|: C >= 1 + B && 0 >= A && C >= 2 + B The start-symbols are:[f3_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, ar_1 + ar_2 + 3) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f3(ar_0, ar_1, ar_2, ar_3) -> Com_1(f1(0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f2(ar_0, ar_1, ar_2, e)) [ ar_1 >= ar_2 ] (Comp: ?, Cost: 1) f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f2(1, ar_1 + 1, ar_2, e)) [ 0 >= ar_0 /\ ar_1 + 1 = ar_2 ] (Comp: ?, Cost: 1) f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f1(0, ar_1 + 1, ar_2 - 1, ar_3)) [ ar_2 >= ar_1 + 1 /\ 0 >= ar_0 /\ ar_2 >= ar_1 + 2 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(f3(ar_0, ar_1, ar_2, ar_3)) [ 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) f3(ar_0, ar_1, ar_2, ar_3) -> Com_1(f1(0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f2(ar_0, ar_1, ar_2, e)) [ ar_1 >= ar_2 ] (Comp: ?, Cost: 1) f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f2(1, ar_1 + 1, ar_2, e)) [ 0 >= ar_0 /\ ar_1 + 1 = ar_2 ] (Comp: ?, Cost: 1) f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f1(0, ar_1 + 1, ar_2 - 1, ar_3)) [ ar_2 >= ar_1 + 1 /\ 0 >= ar_0 /\ ar_2 >= ar_1 + 2 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(f3(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(f3) = 1 Pol(f1) = 1 Pol(f2) = 0 Pol(koat_start) = 1 orients all transitions weakly and the transitions f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f2(1, ar_1 + 1, ar_2, e)) [ 0 >= ar_0 /\ ar_1 + 1 = ar_2 ] f1(ar_0, ar_1, ar_2, ar_3) -> Com_1(f2(ar_0, ar_1, ar_2, e)) [ ar_1 >= ar_2 ] strictly and produces the following problem: 3: T: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843