details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	2.1751408577 seconds
cpu usage	3.132081489
max memory	3.4248704E8

stage attributes

key	value
output-size	41296
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, 982 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_rank2_start(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb0_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: TRUE eval_rank2_bb0_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb1_in(v_1, v_4, v_m, v_m, v_m, v_y.1)) :|: TRUE eval_rank2_bb1_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb2_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: v_x.0 >= 2 eval_rank2_bb1_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb6_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: v_x.0 < 2 eval_rank2_bb2_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb3_in(v_x.0 - 1, v_4, v_m, v_x.0, v_y.0, v_y.0 + v_x.0 - 1)) :|: TRUE eval_rank2_bb3_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb4_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: v_y.1 >= v_1 eval_rank2_bb3_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_.critedge_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: v_y.1 < v_1 eval_rank2_bb4_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_3(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: TRUE eval_rank2_3(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_2(eval_nondet_start(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1), eval_rank2_4(v_1, nondef.0, v_m, v_x.0, v_y.0, v_y.1)) :|: TRUE eval_rank2_4(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb5_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: v_4 > 0 eval_rank2_4(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_.critedge_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: v_4 <= 0 eval_rank2_bb5_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb3_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1 - 1)) :|: TRUE eval_rank2_.critedge_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_bb1_in(v_1, v_4, v_m, v_1 - 1, v_y.1 - v_1 + 1, v_y.1)) :|: TRUE eval_rank2_bb6_in(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1) -> Com_1(eval_rank2_stop(v_1, v_4, v_m, v_x.0, v_y.0, v_y.1)) :|: TRUE The start-symbols are:[eval_rank2_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 111*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrank2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalrank2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb1in(ar_1, ar_1, ar_1, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalrank2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_0 >= 2 ] (Comp: ?, Cost: 1) evalrank2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 1 >= ar_0 ] (Comp: ?, Cost: 1) evalrank2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb3in(ar_0, ar_1, ar_2, ar_0 - 1, ar_2 + ar_0 - 1, ar_5, ar_6)) (Comp: ?, Cost: 1) evalrank2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_4 >= ar_3 ] (Comp: ?, Cost: 1) evalrank2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 >= ar_4 + 1 ] (Comp: ?, Cost: 1) evalrank2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank23(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalrank230(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) evalrank231(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank24(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6)) (Comp: ?, Cost: 1) evalrank23(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_2(evalrank230(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h), evalrank231(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h)) (Comp: ?, Cost: 1) evalrank24(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalrank24(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_5 ] (Comp: ?, Cost: 1) evalrank2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4 - 1, ar_5, ar_6)) (Comp: ?, Cost: 1) evalrank2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb1in(ar_3 - 1, ar_1, ar_4 - ar_3 + 1, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalrank2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2stop(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(evalrank2start(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) evalrank2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: 1, Cost: 1) evalrank2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrank2bb1in(ar_1, ar_1, ar_1, ar_3, ar_4, ar_5, ar_6)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445