Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745941
details
property
value
status
complete
benchmark
speedNestedMultiple.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
2.00859808922 seconds
cpu usage
3.183550723
max memory
3.0736384E8
stage attributes
key
value
output-size
40728
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, 789 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedNestedMultiple_start(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb0_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_bb0_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb1_in(v_x, v_y, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_bb1_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb2_in(v_.0, v_.01, v_.01, v_2, v_m, v_n, v_x, v_y)) :|: v_.0 < v_n eval_speedNestedMultiple_bb1_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb5_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: v_.0 >= v_n eval_speedNestedMultiple_bb2_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb3_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: v_.1 < v_m eval_speedNestedMultiple_bb2_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_.critedge_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: v_.1 >= v_m eval_speedNestedMultiple_bb3_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_0(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_0(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_2(eval_nondet_start(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y), eval_speedNestedMultiple_1(v_.0, v_.01, v_.1, nondef.0, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_1(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb4_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: v_2 > 0 eval_speedNestedMultiple_1(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_.critedge_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: v_2 <= 0 eval_speedNestedMultiple_bb4_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb2_in(v_.0, v_.01, v_.1 + 1, v_2, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_.critedge_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb1_in(v_.0 + 1, v_.1, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_bb5_in(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_stop(v_.0, v_.01, v_.1, v_2, v_m, v_n, v_x, v_y)) :|: TRUE The start-symbols are:[eval_speedNestedMultiple_start_8] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 47*ar_1 + 47*ar_4 + 49*ar_3 + 49*ar_6 + 24) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedNestedMultiplestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiplebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiplebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2, ar_6, ar_7, ar_8)) [ ar_4 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultiplebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ ar_0 >= ar_4 ] (Comp: ?, Cost: 1) evalspeedNestedMultiplebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ ar_6 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultiplebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplecritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ ar_5 >= ar_6 ] (Comp: ?, Cost: 1) evalspeedNestedMultiplebb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple01(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_8, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_2(evalspeedNestedMultiple00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, j), evalspeedNestedMultiple01(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, j)) (Comp: ?, Cost: 1) evalspeedNestedMultiple1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ ar_7 >= 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultiple1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplecritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ 0 >= ar_7 ] (Comp: ?, Cost: 1) evalspeedNestedMultiplebb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 + 1, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiplecritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb1in(ar_0 + 1, ar_1, ar_5, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiplebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplestop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ 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) evalspeedNestedMultiplestart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: 1, Cost: 1) evalspeedNestedMultiplebb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiplebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2, ar_6, ar_7, ar_8)) [ ar_4 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultiplebb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) [ ar_0 >= 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