details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.74484 seconds
cpu usage	2.45349
user time	2.24908
system time	0.204404
max virtual memory	1.8394432E7
max residence set size	179336.0

stage attributes

key	value
starexec-result	MAYBE

output

2.35/1.70 MAYBE 2.35/1.71 proof of /export/starexec/sandbox2/output/output_files/bench.koat 2.35/1.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.35/1.71 2.35/1.71 2.35/1.71 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 2.35/1.71 2.35/1.71 (0) CpxIntTrs 2.35/1.71 2.35/1.71 2.35/1.71 ---------------------------------------- 2.35/1.71 2.35/1.71 (0) 2.35/1.71 Obligation: 2.35/1.71 Complexity Int TRS consisting of the following rules: 2.35/1.71 eval_foo_start(v_.0, v_.01, v_a, v_b) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_a, v_b)) :|: TRUE 2.35/1.71 eval_foo_bb0_in(v_.0, v_.01, v_a, v_b) -> Com_1(eval_foo_bb1_in(1, 2, v_a, v_b)) :|: TRUE 2.35/1.71 eval_foo_bb1_in(v_.0, v_.01, v_a, v_b) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_a, v_b)) :|: v_.0 + v_.01 < 5 2.35/1.71 eval_foo_bb1_in(v_.0, v_.01, v_a, v_b) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_a, v_b)) :|: v_.0 + v_.01 >= 5 2.35/1.71 eval_foo_bb2_in(v_.0, v_.01, v_a, v_b) -> Com_1(eval_foo_bb1_in(v_.01, v_.0, v_a, v_b)) :|: TRUE 2.35/1.71 eval_foo_bb3_in(v_.0, v_.01, v_a, v_b) -> Com_1(eval_foo_stop(v_.0, v_.01, v_a, v_b)) :|: TRUE 2.35/1.71 2.35/1.71 The start-symbols are:[eval_foo_start_4] 2.35/1.71 2.35/1.74 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