details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	2.35136198997 seconds
cpu usage	3.54674527
max memory	3.48844032E8

stage attributes

key	value
output-size	44044
starexec-result	WORST_CASE(?, O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 1183 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_foo_start(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: TRUE eval_foo_bb0_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_.1, v_1, v_4, v_x, v_y)) :|: TRUE eval_foo_bb1_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_.0 >= 2 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb6_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_.0 < 2 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.01 + v_.0 - 1, v_.0 - 1, v_4, v_x, v_y)) :|: TRUE eval_foo_bb3_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_.1 >= v_1 eval_foo_bb3_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_.1 < v_1 eval_foo_bb4_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_3(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: TRUE eval_foo_3(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y), eval_foo_4(v_.0, v_.01, v_.1, v_1, nondef.0, v_x, v_y)) :|: TRUE eval_foo_4(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_4 < 0 eval_foo_4(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_4 > 0 eval_foo_4(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: v_4 >= 0 && v_4 <= 0 eval_foo_bb5_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.1 - 1, v_1, v_4, v_x, v_y)) :|: TRUE eval_foo_.critedge_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_1 - 1, v_.1 - v_1 + 1, v_.1, v_1, v_4, v_x, v_y)) :|: TRUE eval_foo_bb6_in(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.1, v_1, v_4, v_x, v_y)) :|: TRUE The start-symbols are:[eval_foo_start_7] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 71*ar_1 + 56*ar_3 + 6) Initial complexity problem: 1: T: (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)) (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_4, ar_5, ar_6, ar_7)) (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 >= 2 ] (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 1 >= ar_0 ] (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_2 + ar_0 - 1, ar_0 - 1, ar_6, ar_7)) (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_5 ] (Comp: ?, Cost: 1) evalfoobb3in(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_5 >= ar_4 + 1 ] (Comp: ?, Cost: 1) evalfoobb4in(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_6, ar_7)) (Comp: ?, Cost: 1) evalfoo30(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)) (Comp: ?, Cost: 1) evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_7, ar_7)) (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, i)) (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_6 + 1 ] (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_6 >= 1 ] (Comp: ?, Cost: 1) evalfoo4(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_6 = 0 ] (Comp: ?, Cost: 1) evalfoobb5in(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 - 1, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_5 - 1, ar_1, ar_4 - ar_5 + 1, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalfoobb6in(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)) (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 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (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)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445