details

property	value
status	complete
benchmark	ChenFlurMukhopadhyay-SAS2012-Ex2.22_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n079.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	3.23619 seconds
cpu usage	3.4866
user time	3.2094
system time	0.277203
max virtual memory	1.8450996E7
max residence set size	184904.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(1))

output

3.40/3.20 WORST_CASE(?, O(1)) 3.40/3.21 proof of /export/starexec/sandbox/output/output_files/bench.koat 3.40/3.21 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.40/3.21 3.40/3.21 3.40/3.21 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 3.40/3.21 3.40/3.21 (0) CpxIntTrs 3.40/3.21 (1) Koat Proof [FINISHED, 1079 ms] 3.40/3.21 (2) BOUNDS(1, 1) 3.40/3.21 3.40/3.21 3.40/3.21 ---------------------------------------- 3.40/3.21 3.40/3.21 (0) 3.40/3.21 Obligation: 3.40/3.21 Complexity Int TRS consisting of the following rules: 3.40/3.21 eval_foo_start(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_bb0_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_oldy, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_bb1_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.0 > 0 3.40/3.21 eval_foo_bb1_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.0 <= 0 3.40/3.21 eval_foo_bb2_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.01 <= -(v_.02) 3.40/3.21 eval_foo_bb2_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: v_.01 > -(v_.02) 3.40/3.21 eval_foo_bb3_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_2(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_2(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y), eval_foo_3(v_.0, v_.01, v_.02, nondef.0, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_3(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.01, v_3, v_.01, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 eval_foo_.critedge_in(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.02, v_3, v_oldy, v_x, v_y)) :|: TRUE 3.40/3.21 3.40/3.21 The start-symbols are:[eval_foo_start_7] 3.40/3.21 3.40/3.21 3.40/3.21 ---------------------------------------- 3.40/3.21 3.40/3.21 (1) Koat Proof (FINISHED) 3.40/3.21 YES(?, 31) 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Initial complexity problem: 3.40/3.21 3.40/3.21 1: T: 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.40/3.21 3.40/3.21 start location: koat_start 3.40/3.21 3.40/3.21 leaf cost: 0 3.40/3.21 3.40/3.21 3.40/3.21 3.40/3.21 Repeatedly propagating knowledge in problem 1 produces the following problem: 3.40/3.21 3.40/3.21 2: T: 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_5, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_4 + ar_2 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 + ar_4 >= 1 ] 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) 3.40/3.21 3.40/3.21 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_2, ar_1, ar_6, ar_3, ar_2, ar_5, ar_6, ar_7)) 3.40/3.21 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