details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.63272404671 seconds
cpu usage	2.729973066
max memory	2.93834752E8

stage attributes

key	value
output-size	35571
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, 478 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_complex_start(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb0_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b)) :|: TRUE eval_complex_bb0_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb1_in(v_a, v_b, v_.1, v_.12, v_a, v_b)) :|: TRUE eval_complex_bb1_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.0, v_.01, v_a, v_b)) :|: v_.0 < 30 eval_complex_bb1_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb5_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b)) :|: v_.0 >= 30 eval_complex_bb2_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b)) :|: v_.12 < v_.1 eval_complex_bb2_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb4_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b)) :|: v_.12 >= v_.1 eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.1 + 10, v_.12 + 7, v_a, v_b)) :|: v_.12 > 5 && v_.12 + 7 >= 10 && v_.12 + 7 <= 12 eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.1 + 1, v_.12 + 7, v_a, v_b)) :|: v_.12 > 5 && v_.12 + 7 < 10 eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.1 + 1, v_.12 + 7, v_a, v_b)) :|: v_.12 > 5 && v_.12 + 7 > 12 eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.1 + 10, v_.12 + 2, v_a, v_b)) :|: v_.12 <= 5 && v_.12 + 2 >= 10 && v_.12 + 2 <= 12 eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.1 + 1, v_.12 + 2, v_a, v_b)) :|: v_.12 <= 5 && v_.12 + 2 < 10 eval_complex_bb3_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb2_in(v_.0, v_.01, v_.1 + 1, v_.12 + 2, v_a, v_b)) :|: v_.12 <= 5 && v_.12 + 2 > 12 eval_complex_bb4_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_bb1_in(v_.1 + 2, v_.12 - 10, v_.1, v_.12, v_a, v_b)) :|: TRUE eval_complex_bb5_in(v_.0, v_.01, v_.1, v_.12, v_a, v_b) -> Com_1(eval_complex_stop(v_.0, v_.01, v_.1, v_.12, v_a, v_b)) :|: TRUE The start-symbols are:[eval_complex_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 35*ar_1 + 6*ar_3 + 1200) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalcomplexstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalcomplexbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalcomplexbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_0, ar_2)) [ 29 >= ar_0 ] (Comp: ?, Cost: 1) evalcomplexbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 30 ] (Comp: ?, Cost: 1) evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_5 >= ar_4 ] (Comp: ?, Cost: 1) evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 10, ar_5 + 7)) [ ar_5 >= 6 /\ ar_5 >= 3 /\ 5 >= ar_5 ] (Comp: ?, Cost: 1) evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 + 7)) [ ar_5 >= 6 /\ 2 >= ar_5 ] (Comp: ?, Cost: 1) evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 + 7)) [ ar_5 >= 6 ] (Comp: ?, Cost: 1) evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 10, ar_5 + 2)) [ 5 >= ar_5 /\ ar_5 >= 8 /\ 10 >= ar_5 ] (Comp: ?, Cost: 1) evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 + 2)) [ 5 >= ar_5 /\ 7 >= ar_5 ] (Comp: ?, Cost: 1) evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 + 2)) [ 5 >= ar_5 /\ ar_5 >= 11 ] (Comp: ?, Cost: 1) evalcomplexbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb1in(ar_4 + 2, ar_1, ar_5 - 10, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalcomplexbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 10, ar_5 + 7)) [ ar_5 >= 6 /\ ar_5 >= 3 /\ 5 >= ar_5 ] evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 + 7)) [ ar_5 >= 6 /\ 2 >= ar_5 ] evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 10, ar_5 + 2)) [ 5 >= ar_5 /\ ar_5 >= 8 /\ 10 >= ar_5 ] evalcomplexbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalcomplexbb2in(ar_0, ar_1, ar_2, ar_3, ar_4 + 1, ar_5 + 2)) [ 5 >= ar_5 /\ ar_5 >= 11 ] We thus obtain the following problem: popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445