details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	3.10938 seconds
cpu usage	3.18611
user time	2.92562
system time	0.260495
max virtual memory	1.8516156E7
max residence set size	180272.0

stage attributes

key	value
starexec-result	MAYBE

output

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