Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745860
details
property
value
status
complete
benchmark
random1d.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.51267290115 seconds
cpu usage
2.565153265
max memory
2.43388416E8
stage attributes
key
value
output-size
26507
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, 278 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_random1d_start(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb0_in(v_2, v_max, v_x.0)) :|: TRUE eval_random1d_bb0_in(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb1_in(v_2, v_max, 1)) :|: v_max > 0 eval_random1d_bb0_in(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb3_in(v_2, v_max, v_x.0)) :|: v_max <= 0 eval_random1d_bb1_in(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb2_in(v_2, v_max, v_x.0)) :|: v_x.0 <= v_max eval_random1d_bb1_in(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb3_in(v_2, v_max, v_x.0)) :|: v_x.0 > v_max eval_random1d_bb2_in(v_2, v_max, v_x.0) -> Com_1(eval_random1d_0(v_2, v_max, v_x.0)) :|: TRUE eval_random1d_0(v_2, v_max, v_x.0) -> Com_2(eval_nondet_start(v_2, v_max, v_x.0), eval_random1d_1(nondef.0, v_max, v_x.0)) :|: TRUE eval_random1d_1(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb1_in(v_2, v_max, v_x.0 + 1)) :|: v_2 > 0 eval_random1d_1(v_2, v_max, v_x.0) -> Com_1(eval_random1d_bb1_in(v_2, v_max, v_x.0 + 1)) :|: v_2 <= 0 eval_random1d_bb3_in(v_2, v_max, v_x.0) -> Com_1(eval_random1d_stop(v_2, v_max, v_x.0)) :|: TRUE The start-symbols are:[eval_random1d_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 42*ar_0 + 91) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrandom1dstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom1dbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb1in(ar_0, 1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalrandom1dbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrandom1dbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1d0(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom1d00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom1d01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1d1(ar_0, ar_1, ar_3, ar_3)) (Comp: ?, Cost: 1) evalrandom1d0(ar_0, ar_1, ar_2, ar_3) -> Com_2(evalrandom1d00(ar_0, ar_1, ar_2, e), evalrandom1d01(ar_0, ar_1, ar_2, e)) (Comp: ?, Cost: 1) evalrandom1d1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb1in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalrandom1d1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb1in(ar_0, ar_1 + 1, ar_2, ar_3)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalrandom1dbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dstop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dstart(ar_0, ar_1, ar_2, ar_3)) [ 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) evalrandom1dstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalrandom1dbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb1in(ar_0, 1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: 1, Cost: 1) evalrandom1dbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrandom1dbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1d0(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom1d00(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalrandom1d01(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrandom1d1(ar_0, ar_1, ar_3, ar_3))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445