Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745969
details
property
value
status
complete
benchmark
relation1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.13484191895 seconds
cpu usage
2.139015891
max memory
1.73518848E8
stage attributes
key
value
output-size
2743
starexec-result
WORST_CASE(?, O(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(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, 1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 0 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_relation1_start(v_x, v_y) -> Com_1(eval_relation1_bb0_in(v_x, v_y)) :|: TRUE eval_relation1_bb0_in(v_x, v_y) -> Com_1(eval_relation1_bb1_in(v_x, v_y)) :|: TRUE eval_relation1_bb1_in(v_x, v_y) -> Com_1(eval_relation1_0(v_x, v_y)) :|: TRUE eval_relation1_0(v_x, v_y) -> Com_2(eval_nondet_start(v_x, v_y), eval_relation1_1(v_x, v_y)) :|: TRUE eval_relation1_1(v_x, v_y) -> Com_1(eval_relation1_bb2_in(v_x, v_y)) :|: TRUE eval_relation1_bb2_in(v_x, v_y) -> Com_1(eval_relation1_stop(v_x, v_y)) :|: TRUE The start-symbols are:[eval_relation1_start_2] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrelation1start() -> Com_1(evalrelation1bb0in()) (Comp: ?, Cost: 1) evalrelation1bb0in() -> Com_1(evalrelation1bb1in()) (Comp: ?, Cost: 1) evalrelation1bb1in() -> Com_1(evalrelation10()) (Comp: ?, Cost: 1) evalrelation10() -> Com_2(evalnondetstart(), evalrelation11()) (Comp: ?, Cost: 1) evalrelation11() -> Com_1(evalrelation1bb2in()) (Comp: ?, Cost: 1) evalrelation1bb2in() -> Com_1(evalrelation1stop()) (Comp: 1, Cost: 0) koat_start() -> Com_1(evalrelation1start()) [ 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) evalrelation1start() -> Com_1(evalrelation1bb0in()) (Comp: 1, Cost: 1) evalrelation1bb0in() -> Com_1(evalrelation1bb1in()) (Comp: 1, Cost: 1) evalrelation1bb1in() -> Com_1(evalrelation10()) (Comp: 1, Cost: 1) evalrelation10() -> Com_2(evalnondetstart(), evalrelation11()) (Comp: 1, Cost: 1) evalrelation11() -> Com_1(evalrelation1bb2in()) (Comp: 1, Cost: 1) evalrelation1bb2in() -> Com_1(evalrelation1stop()) (Comp: 1, Cost: 0) koat_start() -> Com_1(evalrelation1start()) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 6 Time: 0.005 sec (SMT: 0.004 sec) ---------------------------------------- (2) BOUNDS(1, 1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445