Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746013
details
property
value
status
complete
benchmark
wcet1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.9705851078 seconds
cpu usage
3.118904222
max memory
2.78953984E8
stage attributes
key
value
output-size
71728
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, 688 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_wcet1_start(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb0_in(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: TRUE eval_wcet1_bb0_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb1_in(v_1, v_n, 0, v_j.3, v_n)) :|: v_n >= 1 eval_wcet1_bb0_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb5_in(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: v_n < 1 eval_wcet1_bb1_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_0(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: TRUE eval_wcet1_0(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_2(eval_nondet_start(v_1, v_i.0, v_j.0, v_j.3, v_n), eval_wcet1_1(nondef.0, v_i.0, v_j.0, v_j.3, v_n)) :|: TRUE eval_wcet1_1(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb2_in(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: v_1 > 0 eval_wcet1_1(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb3_in(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: v_1 <= 0 eval_wcet1_bb2_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i.0, v_j.0, 0, v_n)) :|: v_j.0 + 1 >= v_n eval_wcet1_bb2_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i.0, v_j.0, v_j.0 + 1, v_n)) :|: v_j.0 + 1 < v_n eval_wcet1_bb3_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i.0, v_j.0, 0, v_n)) :|: v_j.0 - 1 <= 0 eval_wcet1_bb3_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i.0, v_j.0, v_j.0 - 1, v_n)) :|: v_j.0 - 1 > 0 eval_wcet1_bb4_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb1_in(v_1, v_i.0 - 1, v_j.3, v_j.3, v_n)) :|: v_i.0 - 1 > 0 eval_wcet1_bb4_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_bb5_in(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: v_i.0 - 1 <= 0 eval_wcet1_bb5_in(v_1, v_i.0, v_j.0, v_j.3, v_n) -> Com_1(eval_wcet1_stop(v_1, v_i.0, v_j.0, v_j.3, v_n)) :|: TRUE The start-symbols are:[eval_wcet1_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 77*ar_0 + 18) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalwcet1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb1in(ar_0, ar_0, 0, ar_3, ar_4, ar_5)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalwcet100(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalwcet101(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet11(ar_0, ar_1, ar_2, ar_4, ar_4, ar_5)) (Comp: ?, Cost: 1) evalwcet10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalwcet100(ar_0, ar_1, ar_2, ar_3, g, ar_5), evalwcet101(ar_0, ar_1, ar_2, ar_3, g, ar_5)) (Comp: ?, Cost: 1) evalwcet11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalwcet11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalwcet1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, 0)) [ ar_2 + 1 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2 + 1)) [ ar_0 >= ar_2 + 2 ] (Comp: ?, Cost: 1) evalwcet1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, 0)) [ 1 >= ar_2 ] (Comp: ?, Cost: 1) evalwcet1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2 - 1)) [ ar_2 >= 2 ] (Comp: ?, Cost: 1) evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb1in(ar_0, ar_1 - 1, ar_5, ar_3, ar_4, ar_5)) [ ar_1 >= 2 ] (Comp: ?, Cost: 1) evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 1 >= ar_1 ] (Comp: ?, Cost: 1) evalwcet1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1stop(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(evalwcet1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 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) evalwcet1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 1) evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalwcet1bb1in(ar_0, ar_0, 0, ar_3, ar_4, ar_5)) [ 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