details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.43884301186 seconds
cpu usage	2.500294445
max memory	2.71142912E8

stage attributes

key	value
output-size	1422
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). (0) CpxIntTrs ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedFails2_start(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb0_in(v_i.0, v_n, v_x)) :|: TRUE eval_speedFails2_bb0_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb1_in(v_x, v_n, v_x)) :|: TRUE eval_speedFails2_bb1_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb2_in(v_i.0, v_n, v_x)) :|: v_i.0 < v_n eval_speedFails2_bb1_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb2_in(v_i.0, v_n, v_x)) :|: v_i.0 > v_n eval_speedFails2_bb1_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb3_in(v_i.0, v_n, v_x)) :|: v_i.0 >= v_n && v_i.0 <= v_n eval_speedFails2_bb2_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb1_in(v_i.0 + 1, v_n, v_x)) :|: TRUE eval_speedFails2_bb3_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_stop(v_i.0, v_n, v_x)) :|: TRUE The start-symbols are:[eval_speedFails2_start_3] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445