details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	5.58286 seconds
cpu usage	14.3558
user time	13.8515
system time	0.504302
max virtual memory	3.660762E7
max residence set size	224944.0

stage attributes

key	value
starexec-result	MAYBE

output

14.26/5.55 MAYBE 14.26/5.56 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 14.26/5.56 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.26/5.56 14.26/5.56 14.26/5.56 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 14.26/5.56 14.26/5.56 (0) CpxIntTrs 14.26/5.56 (1) Loat Proof [FINISHED, 3935 ms] 14.26/5.56 (2) BOUNDS(1, INF) 14.26/5.56 14.26/5.56 14.26/5.56 ---------------------------------------- 14.26/5.56 14.26/5.56 (0) 14.26/5.56 Obligation: 14.26/5.56 Complexity Int TRS consisting of the following rules: 14.26/5.56 f0(A, B, C, D, E, F, G) -> Com_1(f10(1, 1, H, 0, 2, 1, G)) :|: H >= 0 14.26/5.56 f10(A, B, C, D, E, F, G) -> Com_1(f21(A, B - 1, C, D, E, F, 0)) :|: F >= 1 && E >= F && B >= 1 && 0 >= C 14.26/5.56 f10(A, B, C, D, E, F, G) -> Com_1(f21(A + 1, A + 1, H, D, E, F, I)) :|: I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C 14.26/5.56 f10(A, B, C, D, E, F, G) -> Com_1(f21(A, B, C - 1, D, E, F, H)) :|: H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F 14.26/5.56 f21(A, B, C, D, E, F, G) -> Com_1(f10(A, B, C, D, E, F - 1, G)) :|: E + 1 >= A && 0 >= G 14.26/5.56 f21(A, B, C, D, E, F, G) -> Com_1(f10(A, B, C, D, E, F + 1, G)) :|: E + 1 >= A && G >= 1 14.26/5.56 f10(A, B, C, D, E, F, G) -> Com_1(f32(A, B, C, D, E, F, G)) :|: 0 >= F && E >= F 14.26/5.56 f10(A, B, C, D, E, F, G) -> Com_1(f32(A, B, C, D, E, F, G)) :|: F >= 1 + E 14.26/5.56 14.26/5.56 The start-symbols are:[f0_7] 14.26/5.56 14.26/5.56 14.26/5.56 ---------------------------------------- 14.26/5.56 14.26/5.56 (1) Loat Proof (FINISHED) 14.26/5.56 14.26/5.56 14.26/5.56 ### Pre-processing the ITS problem ### 14.26/5.56 14.26/5.56 14.26/5.56 14.26/5.56 Initial linear ITS problem 14.26/5.56 14.26/5.56 Start location: f0 14.26/5.56 14.26/5.56 0: f0 -> f10 : A'=1, B'=1, C'=free, D'=0, E'=2, F'=1, [ free>=0 ], cost: 1 14.26/5.56 14.26/5.56 1: f10 -> f21 : B'=-1+B, G'=0, [ F>=1 && E>=F && B>=1 && 0>=C ], cost: 1 14.26/5.56 14.26/5.56 2: f10 -> f21 : A'=1+A, B'=1+A, C'=free_2, G'=free_1, [ free_1>=0 && 1>=free_1 && free_2>=0 && F>=1 && E>=F && 0>=B && 0>=C ], cost: 1 14.26/5.56 14.26/5.56 3: f10 -> f21 : C'=-1+C, G'=free_3, [ free_3>=0 && 1>=free_3 && F>=1 && C>=1 && E>=F ], cost: 1 14.26/5.56 14.26/5.56 6: f10 -> f32 : [ 0>=F && E>=F ], cost: 1 14.26/5.56 14.26/5.56 7: f10 -> f32 : [ F>=1+E ], cost: 1 14.26/5.56 14.26/5.56 4: f21 -> f10 : F'=-1+F, [ 1+E>=A && 0>=G ], cost: 1 14.26/5.56 14.26/5.56 5: f21 -> f10 : F'=1+F, [ 1+E>=A && G>=1 ], cost: 1 14.26/5.56 14.26/5.56 14.26/5.56 14.26/5.56 Removed unreachable and leaf rules: 14.26/5.56 14.26/5.56 Start location: f0 14.26/5.56 14.26/5.56 0: f0 -> f10 : A'=1, B'=1, C'=free, D'=0, E'=2, F'=1, [ free>=0 ], cost: 1 14.26/5.56 14.26/5.56 1: f10 -> f21 : B'=-1+B, G'=0, [ F>=1 && E>=F && B>=1 && 0>=C ], cost: 1 14.26/5.56 14.26/5.56 2: f10 -> f21 : A'=1+A, B'=1+A, C'=free_2, G'=free_1, [ free_1>=0 && 1>=free_1 && free_2>=0 && F>=1 && E>=F && 0>=B && 0>=C ], cost: 1 14.26/5.56 14.26/5.56 3: f10 -> f21 : C'=-1+C, G'=free_3, [ free_3>=0 && 1>=free_3 && F>=1 && C>=1 && E>=F ], cost: 1 14.26/5.56 14.26/5.56 4: f21 -> f10 : F'=-1+F, [ 1+E>=A && 0>=G ], cost: 1 14.26/5.56 14.26/5.56 5: f21 -> f10 : F'=1+F, [ 1+E>=A && G>=1 ], cost: 1 14.26/5.56 14.26/5.56 14.26/5.56 14.26/5.56 ### Simplification by acceleration and chaining ### 14.26/5.56 14.26/5.56 14.26/5.56 14.26/5.56 Eliminated locations (on tree-shaped paths): 14.26/5.56 14.26/5.56 Start location: f0 14.26/5.56 14.26/5.56 0: f0 -> f10 : A'=1, B'=1, C'=free, D'=0, E'=2, F'=1, [ free>=0 ], cost: 1 14.26/5.56 14.26/5.56 8: f10 -> f10 : B'=-1+B, F'=-1+F, G'=0, [ F>=1 && E>=F && B>=1 && 0>=C && 1+E>=A ], cost: 2 14.26/5.56 14.26/5.56 9: f10 -> f10 : A'=1+A, B'=1+A, C'=free_2, F'=-1+F, G'=free_1, [ free_1>=0 && free_2>=0 && F>=1 && E>=F && 0>=B && 0>=C && 1+E>=1+A && 0>=free_1 ], cost: 2 14.26/5.56 14.26/5.56 10: f10 -> f10 : A'=1+A, B'=1+A, C'=free_2, F'=1+F, G'=free_1, [ 1>=free_1 && free_2>=0 && F>=1 && E>=F && 0>=B && 0>=C && 1+E>=1+A && free_1>=1 ], cost: 2 14.26/5.56 14.26/5.56 11: f10 -> f10 : C'=-1+C, F'=-1+F, G'=free_3, [ free_3>=0 && F>=1 && C>=1 && E>=F && 1+E>=A && 0>=free_3 ], cost: 2 14.26/5.56 14.26/5.56 12: f10 -> f10 : C'=-1+C, F'=1+F, G'=free_3, [ 1>=free_3 && F>=1 && C>=1 && E>=F && 1+E>=A && free_3>=1 ], cost: 2 14.26/5.56 14.26/5.56 14.26/5.56 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