details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	38.5546 seconds
cpu usage	66.789
user time	65.5795
system time	1.20942
max virtual memory	1.8884952E7
max residence set size	277132.0

stage attributes

key	value
starexec-result	MAYBE

output

66.68/38.53 MAYBE 66.68/38.54 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 66.68/38.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 66.68/38.54 66.68/38.54 66.68/38.54 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 66.68/38.54 66.68/38.54 (0) CpxIntTrs 66.68/38.54 (1) Loat Proof [FINISHED, 17.8 s] 66.68/38.54 (2) BOUNDS(1, INF) 66.68/38.54 66.68/38.54 66.68/38.54 ---------------------------------------- 66.68/38.54 66.68/38.54 (0) 66.68/38.54 Obligation: 66.68/38.54 Complexity Int TRS consisting of the following rules: 66.68/38.54 f5(A, B, C, D, E, F) -> Com_1(f7(A, B, C, D, E, F)) :|: 0 >= A 66.68/38.54 f5(A, B, C, D, E, F) -> Com_1(f7(A, B, C, D, E, F)) :|: A >= 2 66.68/38.54 f7(A, B, C, D, E, F) -> Com_1(f9(A, 0, C, D, E, F)) :|: B >= 0 && B <= 0 66.68/38.54 f16(A, B, C, D, E, F) -> Com_1(f5(A, B, C, G, E, F)) :|: 255 >= C 66.68/38.54 f25(A, B, C, D, E, F) -> Com_1(f5(A, B, C, G, E, F)) :|: C >= 0 66.68/38.54 f0(A, B, C, D, E, F) -> Com_1(f5(4, 0, C, G, 0, F)) :|: TRUE 66.68/38.54 f7(A, B, C, D, E, F) -> Com_1(f9(A - 1, B, C, D, E, F)) :|: 0 >= B + 1 66.68/38.54 f7(A, B, C, D, E, F) -> Com_1(f9(A - 1, B, C, D, E, F)) :|: B >= 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: 0 >= E && D >= 1 + F 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: E >= 2 && D >= 1 + F 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: 0 >= B + 1 && D >= 1 + F && E >= 1 && E <= 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f16(A, B, C + A, D, 2, F)) :|: B >= 1 && D >= 1 + F && E >= 1 && E <= 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f16(A - 1, 1, C + A - 1, D, 2, F)) :|: D >= 1 + F && B >= 0 && B <= 0 && E >= 1 && E <= 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: 1 >= E && F >= D + 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: E >= 3 && F >= D + 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: 0 >= B + 1 && F >= D + 1 && E >= 2 && E <= 2 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f25(A, B, C - A, D, 1, F)) :|: B >= 1 && F >= D + 1 && E >= 2 && E <= 2 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f25(A - 1, 1, C - A + 1, D, 1, F)) :|: F >= D + 1 && B >= 0 && B <= 0 && E >= 2 && E <= 2 66.68/38.54 f5(A, B, C, D, E, F) -> Com_1(f30(1, B, C, D, E, F)) :|: A >= 1 && A <= 1 66.68/38.54 f16(A, B, C, D, E, F) -> Com_1(f30(A, B, C, D, E, F)) :|: C >= 256 66.68/38.54 f25(A, B, C, D, E, F) -> Com_1(f30(A, B, C, D, E, F)) :|: 0 >= C + 1 66.68/38.54 f9(A, B, C, D, E, F) -> Com_1(f30(A, B, C, D, E, D)) :|: D >= F && D <= F 66.68/38.54 66.68/38.54 The start-symbols are:[f0_6] 66.68/38.54 66.68/38.54 66.68/38.54 ---------------------------------------- 66.68/38.54 66.68/38.54 (1) Loat Proof (FINISHED) 66.68/38.54 66.68/38.54 66.68/38.54 ### Pre-processing the ITS problem ### 66.68/38.54 66.68/38.54 66.68/38.54 66.68/38.54 Initial linear ITS problem 66.68/38.54 66.68/38.54 Start location: f0 66.68/38.54 66.68/38.54 0: f5 -> f7 : [ 0>=A ], cost: 1 66.68/38.54 66.68/38.54 1: f5 -> f7 : [ A>=2 ], cost: 1 66.68/38.54 66.68/38.54 18: f5 -> f30 : A'=1, [ A==1 ], cost: 1 66.68/38.54 66.68/38.54 2: f7 -> f9 : B'=0, [ B==0 ], cost: 1 66.68/38.54 66.68/38.54 6: f7 -> f9 : A'=-1+A, [ 0>=1+B ], cost: 1 66.68/38.54 66.68/38.54 7: f7 -> f9 : A'=-1+A, [ B>=1 ], cost: 1 66.68/38.54 66.68/38.54 3: f16 -> f5 : D'=free, [ 255>=C ], cost: 1 66.68/38.54 66.68/38.54 19: f16 -> f30 : [ C>=256 ], cost: 1 66.68/38.54 66.68/38.54 4: f25 -> f5 : D'=free_1, [ C>=0 ], cost: 1 66.68/38.54 66.68/38.54 20: f25 -> f30 : [ 0>=1+C ], cost: 1 66.68/38.54 66.68/38.54 5: f0 -> f5 : A'=4, B'=0, D'=free_2, E'=0, [], cost: 1 66.68/38.54 66.68/38.54 8: f9 -> f16 : C'=C+A, E'=2, [ 0>=E && D>=1+F ], cost: 1 66.68/38.54 66.68/38.54 9: f9 -> f16 : C'=C+A, E'=2, [ E>=2 && D>=1+F ], cost: 1 66.68/38.54 66.68/38.54 10: f9 -> f16 : C'=C+A, E'=2, [ 0>=1+B && D>=1+F && E==1 ], cost: 1 66.68/38.54 66.68/38.54 11: f9 -> f16 : C'=C+A, E'=2, [ B>=1 && D>=1+F && E==1 ], cost: 1 66.68/38.54 66.68/38.54 12: f9 -> f16 : A'=-1+A, B'=1, C'=-1+C+A, E'=2, [ D>=1+F && B==0 && E==1 ], cost: 1 66.68/38.54 66.68/38.54 13: f9 -> f25 : C'=C-A, E'=1, [ 1>=E && F>=1+D ], cost: 1 66.68/38.54 66.68/38.54 14: f9 -> f25 : C'=C-A, E'=1, [ E>=3 && F>=1+D ], cost: 1 66.68/38.54 66.68/38.54 15: f9 -> f25 : C'=C-A, E'=1, [ 0>=1+B && F>=1+D && E==2 ], cost: 1 66.68/38.54 66.68/38.54 16: f9 -> f25 : C'=C-A, E'=1, [ B>=1 && F>=1+D && E==2 ], cost: 1 66.68/38.54 66.68/38.54 17: f9 -> f25 : A'=-1+A, B'=1, C'=1+C-A, E'=1, [ F>=1+D && B==0 && E==2 ], cost: 1 66.68/38.54 66.68/38.54 21: f9 -> f30 : F'=D, [ D==F ], cost: 1 66.68/38.54 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