Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745641
details
property
value
status
complete
benchmark
textbook_ex1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
ABC
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.24396085739 seconds
cpu usage
2.268182441
max memory
1.76889856E8
stage attributes
key
value
output-size
7503
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, 82 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_textbook_ex1_start(v_a, v_b, v_i.0) -> Com_1(eval_textbook_ex1_bb0_in(v_a, v_b, v_i.0)) :|: TRUE eval_textbook_ex1_bb0_in(v_a, v_b, v_i.0) -> Com_1(eval_textbook_ex1_bb1_in(v_a, v_b, v_a)) :|: TRUE eval_textbook_ex1_bb1_in(v_a, v_b, v_i.0) -> Com_1(eval_textbook_ex1_bb2_in(v_a, v_b, v_i.0)) :|: v_i.0 <= v_b eval_textbook_ex1_bb1_in(v_a, v_b, v_i.0) -> Com_1(eval_textbook_ex1_bb3_in(v_a, v_b, v_i.0)) :|: v_i.0 > v_b eval_textbook_ex1_bb2_in(v_a, v_b, v_i.0) -> Com_1(eval_textbook_ex1_bb1_in(v_a, v_b, v_i.0 + 1)) :|: TRUE eval_textbook_ex1_bb3_in(v_a, v_b, v_i.0) -> Com_1(eval_textbook_ex1_stop(v_a, v_b, v_i.0)) :|: TRUE The start-symbols are:[eval_textbook_ex1_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_1 + 2*ar_2 + 8) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evaltextbookex1start(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evaltextbookex1bb0in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaltextbookex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_0 ] (Comp: ?, Cost: 1) evaltextbookex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evaltextbookex1bb2in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb1in(ar_0 + 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaltextbookex1bb3in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1start(ar_0, ar_1, ar_2)) [ 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) evaltextbookex1start(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evaltextbookex1bb0in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaltextbookex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_0 ] (Comp: ?, Cost: 1) evaltextbookex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evaltextbookex1bb2in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1bb1in(ar_0 + 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaltextbookex1bb3in(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evaltextbookex1start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evaltextbookex1start) = 2 Pol(evaltextbookex1bb0in) = 2 Pol(evaltextbookex1bb1in) = 2 Pol(evaltextbookex1bb2in) = 2 Pol(evaltextbookex1bb3in) = 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445