Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745933
details
property
value
status
complete
benchmark
speedpldi3.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n091.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.54335689545 seconds
cpu usage
2.564330677
max memory
2.47615488E8
stage attributes
key
value
output-size
41525
starexec-result
WORST_CASE(?, O(n^2))
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^2)) 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^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 272 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedpldi3_start(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb0_in(v_i.0, v_j.0, v_m, v_n)) :|: TRUE eval_speedpldi3_bb0_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb3_in(v_i.0, v_j.0, v_m, v_n)) :|: v_m <= 0 eval_speedpldi3_bb0_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb3_in(v_i.0, v_j.0, v_m, v_n)) :|: v_n <= v_m eval_speedpldi3_bb0_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(0, 0, v_m, v_n)) :|: v_m > 0 && v_n > v_m eval_speedpldi3_bb1_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb2_in(v_i.0, v_j.0, v_m, v_n)) :|: v_i.0 < v_n eval_speedpldi3_bb1_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb3_in(v_i.0, v_j.0, v_m, v_n)) :|: v_i.0 >= v_n eval_speedpldi3_bb2_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i.0, v_j.0 + 1, v_m, v_n)) :|: v_j.0 < v_m eval_speedpldi3_bb2_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i.0 + 1, v_j.0 + 1, v_m, v_n)) :|: v_j.0 < v_m && v_j.0 >= v_m eval_speedpldi3_bb2_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i.0, 0, v_m, v_n)) :|: v_j.0 >= v_m && v_j.0 < v_m eval_speedpldi3_bb2_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i.0 + 1, 0, v_m, v_n)) :|: v_j.0 >= v_m eval_speedpldi3_bb3_in(v_i.0, v_j.0, v_m, v_n) -> Com_1(eval_speedpldi3_stop(v_i.0, v_j.0, v_m, v_n)) :|: TRUE The start-symbols are:[eval_speedpldi3_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_1 + 2*ar_0*ar_1 + 2*ar_0 + 9) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedpldi3start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, 0, 0)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3 + 1)) [ ar_0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1)) [ ar_0 >= ar_3 + 1 /\ ar_3 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_0 /\ ar_0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, 0)) [ ar_3 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1)) [ ar_0 >= ar_3 + 1 /\ ar_3 >= ar_0 ] evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_0 /\ ar_0 >= ar_3 + 1 ] We thus obtain the following problem: 2: T: (Comp: ?, Cost: 1) evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, 0)) [ ar_3 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3 + 1)) [ ar_0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3stop(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, 0, 0)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445