Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744294
details
property
value
status
complete
benchmark
speedDis1.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.47258496284 seconds
cpu usage
5.619097912
max memory
3.39890176E8
stage attributes
key
value
output-size
33571
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, 378 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 682 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedDis1_start(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb0_in(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_bb0_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_0(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_0(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_1(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_1(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_2(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_2(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_3(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_3(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_4(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_4(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_5(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_5(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_6(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_6(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb1_in(v_x, v_y, v_m, v_n, v_x, v_y)) :|: TRUE eval_speedDis1_bb1_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb2_in(v__0, v__01, v_m, v_n, v_x, v_y)) :|: v__0 < v_n eval_speedDis1_bb1_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb3_in(v__0, v__01, v_m, v_n, v_x, v_y)) :|: v__0 >= v_n eval_speedDis1_bb2_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb1_in(v__0, v__01 + 1, v_m, v_n, v_x, v_y)) :|: v__01 < v_m eval_speedDis1_bb2_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb1_in(v__0 + 1, v__01 + 1, v_m, v_n, v_x, v_y)) :|: v__01 < v_m && v__01 >= v_m eval_speedDis1_bb2_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb1_in(v__0, v__01, v_m, v_n, v_x, v_y)) :|: v__01 >= v_m && v__01 < v_m eval_speedDis1_bb2_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_bb1_in(v__0 + 1, v__01, v_m, v_n, v_x, v_y)) :|: v__01 >= v_m eval_speedDis1_bb3_in(v__0, v__01, v_m, v_n, v_x, v_y) -> Com_1(eval_speedDis1_stop(v__0, v__01, v_m, v_n, v_x, v_y)) :|: TRUE The start-symbols are:[eval_speedDis1_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_1 + 2*ar_4 + 2*ar_3 + 2*ar_5 + 14) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedDis1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis13(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis13(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis14(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis14(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis15(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis15(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis16(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis16(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalspeedDis1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedDis1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_4 ] (Comp: ?, Cost: 1) evalspeedDis1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb1in(ar_0, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedDis1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb1in(ar_0 + 1, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 /\ ar_2 >= ar_5 ] (Comp: ?, Cost: 1) evalspeedDis1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_5 /\ ar_5 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedDis1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb1in(ar_0 + 1, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_5 ] (Comp: ?, Cost: 1) evalspeedDis1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalspeedDis1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalspeedDis1bb1in(ar_0 + 1, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 /\ ar_2 >= ar_5 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843