Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744531
details
property
value
status
complete
benchmark
rank2.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n014.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.2731461525 seconds
cpu usage
8.492910673
max memory
4.74488832E8
stage attributes
key
value
output-size
108965
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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, 1397 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 1613 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_rank2_start(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb0_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_bb0_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_0(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_0(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_1(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_1(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_2(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_2(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_3(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_3(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_4(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_4(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_5(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_5(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_6(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_6(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb1_in(v_1, v_4, v_7, v_8, v_m, v_m, v_m, v_y_1)) :|: TRUE eval_rank2_bb1_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb2_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: v_x_0 >= 2 eval_rank2_bb1_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb6_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: v_x_0 < 2 eval_rank2_bb2_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb3_in(v_x_0 - 1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_0 + v_x_0 - 1)) :|: TRUE eval_rank2_bb3_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb4_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: v_y_1 >= v_1 eval_rank2_bb3_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2__critedge_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: v_y_1 < v_1 eval_rank2_bb4_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_10(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_10(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_11(v_1, nondef_0, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_11(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb5_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: v_4 > 0 eval_rank2_11(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2__critedge_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: v_4 <= 0 eval_rank2_bb5_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb3_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1 - 1)) :|: TRUE eval_rank2__critedge_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_15(v_1, v_4, v_1 - 1, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_15(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_16(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_16(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_17(v_1, v_4, v_7, v_y_1 - v_7, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_17(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_18(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE eval_rank2_18(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_bb1_in(v_1, v_4, v_7, v_8, v_m, v_7, v_8, v_y_1)) :|: TRUE eval_rank2_bb6_in(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1) -> Com_1(eval_rank2_stop(v_1, v_4, v_7, v_8, v_m, v_x_0, v_y_0, v_y_1)) :|: TRUE The start-symbols are:[eval_rank2_start_8] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 109*ar_1 + 57) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrank2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank23(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank23(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank24(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank24(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank25(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank25(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank26(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank26(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb1in(ar_1, ar_1, ar_1, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 2 ] (Comp: ?, Cost: 1) evalrank2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 1 >= ar_0 ] (Comp: ?, Cost: 1) evalrank2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb3in(ar_0, ar_1, ar_2, ar_0 - 1, ar_2 + ar_0 - 1, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_3 ] (Comp: ?, Cost: 1) evalrank2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_3 >= ar_4 + 1 ] (Comp: ?, Cost: 1) evalrank2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank210(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank210(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank211(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7)) (Comp: ?, Cost: 1) evalrank211(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalrank211(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalrank2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= 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