details

property	value
status	complete
benchmark	WhileTrue_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n087.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.21444 seconds
cpu usage	1.93677
user time	1.77013
system time	0.16664
max virtual memory	1.8273644E7
max residence set size	177048.0

stage attributes

key	value
starexec-result	MAYBE

output

1.77/1.17 MAYBE 1.88/1.18 proof of /export/starexec/sandbox/output/output_files/bench.koat 1.88/1.18 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1.88/1.18 1.88/1.18 1.88/1.18 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 1.88/1.18 1.88/1.18 (0) CpxIntTrs 1.88/1.18 1.88/1.18 1.88/1.18 ---------------------------------------- 1.88/1.18 1.88/1.18 (0) 1.88/1.18 Obligation: 1.88/1.18 Complexity Int TRS consisting of the following rules: 1.88/1.18 eval_foo_start -> Com_1(eval_foo_bb0_in) :|: TRUE 1.88/1.18 eval_foo_bb0_in -> Com_1(eval_foo_bb1_in) :|: TRUE 1.88/1.18 eval_foo_bb1_in -> Com_1(eval_foo_bb1_in) :|: TRUE 1.88/1.18 1.88/1.18 The start-symbols are:[eval_foo_start] 1.88/1.18 1.89/1.21 EOF popout

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

job log

popout

actions

all output return to Complexity_C_Integer 2019-03-21 04.38