Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745724
details
property
value
status
complete
benchmark
CPU2006_asctoeg.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Sinn_2016
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
3.01942610741 seconds
cpu usage
4.220171459
max memory
3.70372608E8
stage attributes
key
value
output-size
140676
starexec-result
WORST_CASE(?, O(n^2))
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^2)) 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^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 1793 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_asctoeg_start(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb0_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_bb0_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb1_in(v_2, v_7, v_s, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_bb1_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb2_in(v_2, v_7, v_k.0, v_s, 0, v_sp.1)) :|: v_k.0 > 0 eval_asctoeg_bb1_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb8_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_k.0 <= 0 eval_asctoeg_bb2_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb3_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_sp.0 < v_s eval_asctoeg_bb2_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_.critedge_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_sp.0 >= v_s eval_asctoeg_bb3_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_0(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_0(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_2(eval_random_start(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1), eval_asctoeg_1(nondef.0, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_1(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb4_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_2 < 0 eval_asctoeg_1(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb4_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_2 > 0 eval_asctoeg_1(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_.critedge_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_2 >= 0 && v_2 <= 0 eval_asctoeg_bb4_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb2_in(v_2, v_7, v_k.0, v_s, v_sp.0 + 1, v_sp.1)) :|: TRUE eval_asctoeg_.critedge_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb5_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.0 - 1)) :|: TRUE eval_asctoeg_bb5_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb6_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_sp.1 > 0 eval_asctoeg_bb5_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_.critedge1_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_sp.1 <= 0 eval_asctoeg_bb6_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_6(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_6(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_2(eval_random_start(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1), eval_asctoeg_7(v_2, nondef.1, v_k.0, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_7(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb7_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_7 < 0 eval_asctoeg_7(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb7_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_7 > 0 eval_asctoeg_7(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_.critedge1_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: v_7 >= 0 && v_7 <= 0 eval_asctoeg_bb7_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb5_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1 - 1)) :|: TRUE eval_asctoeg_.critedge1_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_bb1_in(v_2, v_7, v_k.0 - 1, v_s, v_sp.0, v_sp.1)) :|: TRUE eval_asctoeg_bb8_in(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1) -> Com_1(eval_asctoeg_stop(v_2, v_7, v_k.0, v_s, v_sp.0, v_sp.1)) :|: TRUE The start-symbols are:[eval_asctoeg_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 979*ar_1 + 1120*ar_1^2 + 157) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalasctoegstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoegbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb1in(ar_1, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoegbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb2in(ar_0, ar_1, 0, ar_3, ar_4, ar_5, ar_6)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalasctoegbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb8in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalasctoegbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalasctoegbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalasctoegbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoeg0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoeg00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrandomstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoeg01(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoeg1(ar_0, ar_1, ar_2, ar_4, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoeg0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_2(evalasctoeg00(ar_0, ar_1, ar_2, ar_3, h, ar_5, ar_6), evalasctoeg01(ar_0, ar_1, ar_2, ar_3, h, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoeg1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalasctoeg1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalasctoeg1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_3 = 0 ] (Comp: ?, Cost: 1) evalasctoegbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb2in(ar_0, ar_1, ar_2 + 1, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoegcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2 - 1, ar_6)) (Comp: ?, Cost: 1) evalasctoegbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalasctoegbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoegcritedge1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_5 ] (Comp: ?, Cost: 1) evalasctoegbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoeg6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoeg60(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalrandomstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalasctoeg61(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalasctoeg7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_4))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445