Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989702
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
n090.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
2.16365 seconds
cpu usage
3.26602
user time
3.01214
system time
0.253885
max virtual memory
1.8471628E7
max residence set size
188888.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
3.18/2.13 WORST_CASE(?, O(n^1)) 3.21/2.14 proof of /export/starexec/sandbox/output/output_files/bench.koat 3.21/2.14 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.21/2.14 3.21/2.14 3.21/2.14 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 3.21/2.14 3.21/2.14 (0) CpxIntTrs 3.21/2.14 (1) Koat Proof [FINISHED, 883 ms] 3.21/2.14 (2) BOUNDS(1, n^1) 3.21/2.14 3.21/2.14 3.21/2.14 ---------------------------------------- 3.21/2.14 3.21/2.14 (0) 3.21/2.14 Obligation: 3.21/2.14 Complexity Int TRS consisting of the following rules: 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 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 3.21/2.14 3.21/2.14 The start-symbols are:[eval_speedNestedMultiple_start_8] 3.21/2.14 3.21/2.14 3.21/2.14 ---------------------------------------- 3.21/2.14 3.21/2.14 (1) Koat Proof (FINISHED) 3.21/2.14 YES(?, 47*ar_1 + 47*ar_4 + 49*ar_3 + 49*ar_6 + 24) 3.21/2.14 3.21/2.14 3.21/2.14 3.21/2.14 Initial complexity problem: 3.21/2.14 3.21/2.14 1: T: 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 start location: koat_start 3.21/2.14 3.21/2.14 leaf cost: 0 3.21/2.14 3.21/2.14 3.21/2.14 3.21/2.14 Repeatedly propagating knowledge in problem 1 produces the following problem: 3.21/2.14 3.21/2.14 2: T: 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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)) 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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 ] 3.21/2.14 3.21/2.14 (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))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38