Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744849
details
property
value
status
complete
benchmark
speedNestedMultiple.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.98338294029 seconds
cpu usage
7.47502379
max memory
4.39975936E8
stage attributes
key
value
output-size
104209
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 1048 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 1239 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedNestedMultiple_start(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb0_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_bb0_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_0(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_0(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_1(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_1(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_2(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_2(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_3(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_3(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_4(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_4(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_5(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_5(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb1_in(v_x, v_y, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_bb1_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb2_in(v__0, v__01, v__01, v_2, v_5, 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_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb5_in(v__0, v__01, v__1, v_2, v_5, 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_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb3_in(v__0, v__01, v__1, v_2, v_5, 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_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple__critedge_in(v__0, v__01, v__1, v_2, v_5, 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_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_6(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_6(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_7(v__0, v__01, v__1, nondef_0, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_7(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb4_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: v_2 > 0 eval_speedNestedMultiple_7(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple__critedge_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: v_2 <= 0 eval_speedNestedMultiple_bb4_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb2_in(v__0, v__01, v__1 + 1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple__critedge_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_11(v__0, v__01, v__1, v_2, v__0 + 1, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_11(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_12(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_12(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_bb1_in(v_5, v__1, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedNestedMultiple_bb5_in(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y) -> Com_1(eval_speedNestedMultiple_stop(v__0, v__01, v__1, v_2, v_5, v_m, v_n, v_x, v_y)) :|: TRUE The start-symbols are:[eval_speedNestedMultiple_start_9] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 36*ar_1 + 36*ar_4 + 25*ar_3 + 25*ar_6 + 33) 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(evalspeedNestedMultiple0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, 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_1(evalspeedNestedMultiple1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple5(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(evalspeedNestedMultiple6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, j, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple7(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) evalspeedNestedMultiple7(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(evalspeedNestedMultiple11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_0 + 1)) (Comp: ?, Cost: 1) evalspeedNestedMultiple11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiple12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8)) (Comp: ?, Cost: 1) evalspeedNestedMultiple12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8) -> Com_1(evalspeedNestedMultiplebb1in(ar_8, ar_1, ar_5, 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 Compl Integ Trans Syste 26843