details

property	value
status	complete
benchmark	heapsort.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n046.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	21.3988170624 seconds
cpu usage	40.273301721
max memory	6.403072E8

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.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, 2635 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_heapsort_start(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb0_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_bb0_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_0(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_0(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_1(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_1(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_2(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_2(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_3(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_3(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_4(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_4(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_5(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_5(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_6(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_6(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_7(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_7(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_8(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_8(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_9(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_9(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb1_in(v_13, v_2, v_4, v_8, 1, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_bb1_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb2_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_size > 0 && v_i_0 >= 1 eval_heapsort_bb1_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_size <= 0 eval_heapsort_bb1_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 < 1 eval_heapsort_bb2_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb3_in(v_13, 2 * v_i_0, 2 * v_i_0 + 1, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: 2 * v_i_0 <= v_size eval_heapsort_bb2_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb5_in(v_13, 2 * v_i_0, 2 * v_i_0 + 1, v_8, v_i_0, v_i_0, v_max_3, v_size)) :|: 2 * v_i_0 > v_size eval_heapsort_bb3_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_2 < 1 eval_heapsort_bb3_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_2 > v_size eval_heapsort_bb3_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb4_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_2 >= 1 && v_2 <= v_size eval_heapsort_bb4_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_14(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_14(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_15(v_13, v_2, v_4, nondef_0, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_15(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb5_in(v_13, v_2, v_4, v_8, v_i_0, v_2, v_max_3, v_size)) :|: v_8 > 0 eval_heapsort_15(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb5_in(v_13, v_2, v_4, v_8, v_i_0, v_i_0, v_max_3, v_size)) :|: v_8 <= 0 eval_heapsort_bb5_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb6_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_4 <= v_size eval_heapsort_bb5_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb8_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_1, v_size)) :|: v_4 > v_size eval_heapsort_bb6_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_4 < 1 eval_heapsort_bb6_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_4 > v_size eval_heapsort_bb6_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb7_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_4 >= 1 && v_4 <= v_size eval_heapsort_bb7_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_17(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_17(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_18(nondef_1, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE eval_heapsort_18(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb8_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_4, v_size)) :|: v_13 > 0 eval_heapsort_18(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb8_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_1, v_size)) :|: v_13 <= 0 eval_heapsort_bb8_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb9_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 < v_max_3 eval_heapsort_bb8_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb9_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 > v_max_3 eval_heapsort_bb8_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 >= v_max_3 && v_i_0 <= v_max_3 eval_heapsort_bb9_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 < 1 eval_heapsort_bb9_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 > v_size eval_heapsort_bb9_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb10_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_i_0 >= 1 && v_i_0 <= v_size eval_heapsort_bb10_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_max_3 < 1 eval_heapsort_bb10_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: v_max_3 > v_size eval_heapsort_bb10_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_bb1_in(v_13, v_2, v_4, v_8, v_max_3, v_max_1, v_max_3, v_size)) :|: v_max_3 >= 1 && v_max_3 <= v_size eval_heapsort_bb11_in(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size) -> Com_1(eval_heapsort_stop(v_13, v_2, v_4, v_8, v_i_0, v_max_1, v_max_3, v_size)) :|: TRUE The start-symbols are:[eval_heapsort_start_8] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 288*ar_1 + 25) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalheapsortstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsortbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsortbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalheapsort7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalheapsort8(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 Integ Trans Syste 26843