details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.1553 seconds
cpu usage	4.95176
user time	4.63134
system time	0.320418
max virtual memory	1.8585428E7
max residence set size	218464.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

4.71/3.11 WORST_CASE(NON_POLY, ?) 4.92/3.12 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 4.92/3.12 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.92/3.12 4.92/3.12 4.92/3.12 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 4.92/3.12 4.92/3.12 (0) CpxIntTrs 4.92/3.12 (1) Loat Proof [FINISHED, 606 ms] 4.92/3.12 (2) BOUNDS(INF, INF) 4.92/3.12 4.92/3.12 4.92/3.12 ---------------------------------------- 4.92/3.12 4.92/3.12 (0) 4.92/3.12 Obligation: 4.92/3.12 Complexity Int TRS consisting of the following rules: 4.92/3.12 f11(A, B, C, D, E, F) -> Com_1(f11(A - 1, B - 1, C + 1, G, E, F)) :|: A >= 1 && G >= 1 4.92/3.12 f11(A, B, C, D, E, F) -> Com_1(f11(A - 1, B, C, G, E, F)) :|: 0 >= G && A >= 1 && A >= B + 1 4.92/3.12 f21(A, B, C, D, E, F) -> Com_1(f21(A, B, C, D, E, F)) :|: TRUE 4.92/3.12 f23(A, B, C, D, E, F) -> Com_1(f26(A, B, C, D, E, F)) :|: TRUE 4.92/3.12 f11(A, B, C, D, E, F) -> Com_1(f21(A, B, C, D, E, F)) :|: 0 >= A 4.92/3.12 f0(A, B, C, D, E, F) -> Com_1(f11(4, G, 0, D, G, 4)) :|: G >= 1 4.92/3.12 4.92/3.12 The start-symbols are:[f0_6] 4.92/3.12 4.92/3.12 4.92/3.12 ---------------------------------------- 4.92/3.12 4.92/3.12 (1) Loat Proof (FINISHED) 4.92/3.12 4.92/3.12 4.92/3.12 ### Pre-processing the ITS problem ### 4.92/3.12 4.92/3.12 4.92/3.12 4.92/3.12 Initial linear ITS problem 4.92/3.12 4.92/3.12 Start location: f0 4.92/3.12 4.92/3.12 0: f11 -> f11 : A'=-1+A, B'=-1+B, C'=1+C, D'=free, [ A>=1 && free>=1 ], cost: 1 4.92/3.12 4.92/3.12 1: f11 -> f11 : A'=-1+A, D'=free_1, [ 0>=free_1 && A>=1 && A>=1+B ], cost: 1 4.92/3.12 4.92/3.12 4: f11 -> f21 : [ 0>=A ], cost: 1 4.92/3.12 4.92/3.12 2: f21 -> f21 : [], cost: 1 4.92/3.12 4.92/3.12 3: f23 -> f26 : [], cost: 1 4.92/3.12 4.92/3.12 5: f0 -> f11 : A'=4, B'=free_2, C'=0, E'=free_2, F'=4, [ free_2>=1 ], cost: 1 4.92/3.12 4.92/3.12 4.92/3.12 4.92/3.12 Removed unreachable and leaf rules: 4.92/3.12 4.92/3.12 Start location: f0 4.92/3.12 4.92/3.12 0: f11 -> f11 : A'=-1+A, B'=-1+B, C'=1+C, D'=free, [ A>=1 && free>=1 ], cost: 1 4.92/3.12 4.92/3.12 1: f11 -> f11 : A'=-1+A, D'=free_1, [ 0>=free_1 && A>=1 && A>=1+B ], cost: 1 4.92/3.12 4.92/3.12 4: f11 -> f21 : [ 0>=A ], cost: 1 4.92/3.12 4.92/3.12 2: f21 -> f21 : [], cost: 1 4.92/3.12 4.92/3.12 5: f0 -> f11 : A'=4, B'=free_2, C'=0, E'=free_2, F'=4, [ free_2>=1 ], cost: 1 4.92/3.12 4.92/3.12 4.92/3.12 4.92/3.12 ### Simplification by acceleration and chaining ### 4.92/3.12 4.92/3.12 4.92/3.12 4.92/3.12 Accelerating simple loops of location 0. 4.92/3.12 4.92/3.12 Accelerating the following rules: 4.92/3.12 4.92/3.12 0: f11 -> f11 : A'=-1+A, B'=-1+B, C'=1+C, D'=free, [ A>=1 && free>=1 ], cost: 1 4.92/3.12 4.92/3.12 1: f11 -> f11 : A'=-1+A, D'=free_1, [ 0>=free_1 && A>=1 && A>=1+B ], cost: 1 4.92/3.12 4.92/3.12 4.92/3.12 4.92/3.12 Accelerated rule 0 with metering function A, yielding the new rule 6. 4.92/3.12 4.92/3.12 Accelerated rule 1 with backward acceleration, yielding the new rule 7. 4.92/3.12 4.92/3.12 Accelerated rule 1 with backward acceleration, yielding the new rule 8. 4.92/3.12 4.92/3.12 Removing the simple loops: 0 1. 4.92/3.12 4.92/3.12 4.92/3.12 4.92/3.12 Accelerating simple loops of location 1. 4.92/3.12 4.92/3.12 Accelerating the following rules: 4.92/3.12 4.92/3.12 2: f21 -> f21 : [], cost: 1 4.92/3.12 popout

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

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46