details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.92842721939 seconds
cpu usage	2.944400163
max memory	3.3579008E8

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) 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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 701 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_aaron2_start(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb0_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE eval_aaron2_bb0_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb1_in(v_x, v_y, v_3, v_tx, v_x, v_y)) :|: v_tx >= 0 eval_aaron2_bb0_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_tx < 0 eval_aaron2_bb1_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_.01 < v_.02 eval_aaron2_bb1_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_tx < 0 eval_aaron2_bb1_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb2_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_.01 >= v_.02 && v_tx >= 0 eval_aaron2_bb2_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_0(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE eval_aaron2_0(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_2(eval_nondet_start(v_.01, v_.02, v_3, v_tx, v_x, v_y), eval_aaron2_1(v_.01, v_.02, nondef.0, v_tx, v_x, v_y)) :|: TRUE eval_aaron2_1(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb3_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_3 > 0 eval_aaron2_1(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb4_in(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: v_3 <= 0 eval_aaron2_bb3_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb1_in(v_.01 - v_tx - 1, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE eval_aaron2_bb4_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_bb1_in(v_.01, v_.02 + v_tx + 1, v_3, v_tx, v_x, v_y)) :|: TRUE eval_aaron2_bb5_in(v_.01, v_.02, v_3, v_tx, v_x, v_y) -> Com_1(eval_aaron2_stop(v_.01, v_.02, v_3, v_tx, v_x, v_y)) :|: TRUE The start-symbols are:[eval_aaron2_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 63*ar_2 + 63*ar_4 + 70) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalaaron2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_2, ar_2, ar_4, ar_4, ar_5, ar_6)) [ ar_0 >= 0 ] (Comp: ?, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_1 >= ar_3 /\ ar_0 >= 0 ] (Comp: ?, Cost: 1) evalaaron2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalaaron200(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalaaron201(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6)) (Comp: ?, Cost: 1) evalaaron20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_2(evalaaron200(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h), evalaaron201(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h)) (Comp: ?, Cost: 1) evalaaron21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalaaron21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_5 ] (Comp: ?, Cost: 1) evalaaron2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_1 - ar_0 - 1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalaaron2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3 + ar_0 + 1, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 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) evalaaron2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: 1, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb1in(ar_0, ar_2, ar_2, ar_4, ar_4, ar_5, ar_6)) [ ar_0 >= 0 ] (Comp: 1, Cost: 1) evalaaron2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalaaron2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalaaron2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 >= ar_1 + 1 ] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445