details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	4.6326110363 seconds
cpu usage	6.080543519
max memory	4.97815552E8

stage attributes

key	value
output-size	91428
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, 3291 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_send_tree_start(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb0_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_bb0_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb1_in(v_1, v_3, v_8, 0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, 0)) :|: TRUE eval_send_tree_bb1_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb2_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_n.0 <= v_max_code eval_send_tree_bb1_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb9_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_n.0 > v_max_code eval_send_tree_bb2_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb3_in(v_count.0 + 1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_count.0 + 1 < v_max_count eval_send_tree_bb2_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb4_in(v_count.0 + 1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_count.0 + 1 >= v_max_count eval_send_tree_bb3_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_2(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_2(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_2(eval_random_start(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0), eval_send_tree_3(v_1, nondef.0, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_3(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb8_in(v_1, v_3, v_8, v_count.0, v_count.1, v_1, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_3 < 0 eval_send_tree_3(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb8_in(v_1, v_3, v_8, v_count.0, v_count.1, v_1, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_3 > 0 eval_send_tree_3(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb4_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_3 >= 0 && v_3 <= 0 eval_send_tree_bb4_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb5_in(v_1, v_3, v_8, v_count.0, v_1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_1 < v_min_count eval_send_tree_bb4_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb6_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_1 >= v_min_count eval_send_tree_bb5_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb5_in(v_1, v_3, v_8, v_count.0, v_count.1 - 1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_count.1 - 1 > 0 eval_send_tree_bb5_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb8_in(v_1, v_3, v_8, v_count.0, v_count.1, 0, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_count.1 - 1 <= 0 eval_send_tree_bb6_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_6(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_6(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_2(eval_random_start(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0), eval_send_tree_7(v_1, v_3, nondef.1, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_7(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb7_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_8 < 0 eval_send_tree_7(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb7_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_8 > 0 eval_send_tree_7(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb8_in(v_1, v_3, v_8, v_count.0, v_count.1, 0, v_max_code, v_max_count, v_min_count, v_n.0)) :|: v_8 >= 0 && v_8 <= 0 eval_send_tree_bb7_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_8(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_8(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_2(eval_random_start(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0), eval_send_tree_9(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_9(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb8_in(v_1, v_3, v_8, v_count.0, v_count.1, 0, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE eval_send_tree_bb8_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_bb1_in(v_1, v_3, v_8, v_count.2, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0 + 1)) :|: TRUE eval_send_tree_bb9_in(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0) -> Com_1(eval_send_tree_stop(v_1, v_3, v_8, v_count.0, v_count.1, v_count.2, v_max_code, v_max_count, v_min_count, v_n.0)) :|: TRUE The start-symbols are:[eval_send_tree_start_10] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 425*ar_2 + 431) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalsendtreestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtreebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb1in(0, 0, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtreebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalsendtreebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb9in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalsendtreebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb3in(ar_0, ar_1, ar_2, ar_3, ar_0 + 1, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) [ ar_3 >= ar_0 + 2 ] (Comp: ?, Cost: 1) evalsendtreebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb4in(ar_0, ar_1, ar_2, ar_3, ar_0 + 1, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) [ ar_0 + 1 >= ar_3 ] (Comp: ?, Cost: 1) evalsendtreebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtree2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtree20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalrandomstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtree21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtree3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtree2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_2(evalsendtree20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, l, ar_7, ar_8, ar_9, ar_10), evalsendtree21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, l, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtree3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_4, ar_8, ar_9, ar_10)) [ 0 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evalsendtree3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_4, ar_8, ar_9, ar_10)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalsendtree3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) [ ar_5 = 0 ] (Comp: ?, Cost: 1) evalsendtreebb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_4, ar_10)) [ ar_8 >= ar_4 + 1 ] (Comp: ?, Cost: 1) evalsendtreebb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) [ ar_4 >= ar_8 ] (Comp: ?, Cost: 1) evalsendtreebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9 - 1, ar_10)) [ ar_9 >= 2 ] (Comp: ?, Cost: 1) evalsendtreebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtreebb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, 0, ar_8, ar_9, ar_10)) [ 1 >= ar_9 ] (Comp: ?, Cost: 1) evalsendtreebb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalsendtree6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) (Comp: ?, Cost: 1) evalsendtree60(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10) -> Com_1(evalrandomstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445