Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745861
details
property
value
status
complete
benchmark
speed_pldi10_ex4.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.31967186928 seconds
cpu usage
2.398360372
max memory
2.17751552E8
stage attributes
key
value
output-size
20578
starexec-result
WORST_CASE(?, O(n^1))
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^1)) 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^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 75 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speed_pldi10_ex4_start(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb0_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: TRUE eval_speed_pldi10_ex4_bb0_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb1_in(v_n, v_.1, 1, v_flag.1, v_n)) :|: TRUE eval_speed_pldi10_ex4_bb1_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb2_in(v_.0, v_.0, v_flag.0, 0, v_n)) :|: v_flag.0 > 0 eval_speed_pldi10_ex4_bb1_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb4_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: v_flag.0 <= 0 eval_speed_pldi10_ex4_bb2_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb3_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: v_.1 > 0 eval_speed_pldi10_ex4_bb2_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb1_in(v_.1, v_.1, v_flag.1, v_flag.1, v_n)) :|: v_.1 <= 0 eval_speed_pldi10_ex4_bb3_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb2_in(v_.0, v_.1 - 1, v_flag.0, 1, v_n)) :|: TRUE eval_speed_pldi10_ex4_bb4_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_stop(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: TRUE The start-symbols are:[eval_speed_pldi10_ex4_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 5*ar_1 + 8) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_1, ar_1, 1, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_0, 0)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_3, ar_1, ar_4, ar_3, ar_4)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3 - 1, 1)) (Comp: ?, Cost: 1) evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4stop(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 1) evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_1, ar_1, 1, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_0, 0)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_3, ar_1, ar_4, ar_3, ar_4)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3 - 1, 1)) (Comp: ?, Cost: 1) evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4stop(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445