Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745993
details
property
value
status
complete
benchmark
nd_loop.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.51606488228 seconds
cpu usage
2.505180643
max memory
2.76926464E8
stage attributes
key
value
output-size
24667
starexec-result
WORST_CASE(?, O(1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(1)) proof of /export/starexec/sandbox2/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, 377 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_nd_loop_start(v_0, v_x.0) -> Com_1(eval_nd_loop_bb0_in(v_0, v_x.0)) :|: TRUE eval_nd_loop_bb0_in(v_0, v_x.0) -> Com_1(eval_nd_loop_bb1_in(v_0, 0)) :|: TRUE eval_nd_loop_bb1_in(v_0, v_x.0) -> Com_1(eval_nd_loop_0(v_0, v_x.0)) :|: TRUE eval_nd_loop_0(v_0, v_x.0) -> Com_2(eval_nondet_start(v_0, v_x.0), eval_nd_loop_1(nondef.0, v_x.0)) :|: TRUE eval_nd_loop_1(v_0, v_x.0) -> Com_1(eval_nd_loop_bb1_in(v_0, v_0)) :|: v_0 - v_x.0 <= 2 && v_0 - v_x.0 >= 1 && v_0 < 10 eval_nd_loop_1(v_0, v_x.0) -> Com_1(eval_nd_loop_bb2_in(v_0, v_x.0)) :|: v_0 - v_x.0 > 2 eval_nd_loop_1(v_0, v_x.0) -> Com_1(eval_nd_loop_bb2_in(v_0, v_x.0)) :|: v_0 - v_x.0 < 1 eval_nd_loop_1(v_0, v_x.0) -> Com_1(eval_nd_loop_bb2_in(v_0, v_x.0)) :|: v_0 >= 10 eval_nd_loop_bb2_in(v_0, v_x.0) -> Com_1(eval_nd_loop_stop(v_0, v_x.0)) :|: TRUE The start-symbols are:[eval_nd_loop_start_2] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 108) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalndloopstart(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloopbb0in(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb1in(0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloopbb1in(ar_0, ar_1, ar_2) -> Com_1(evalndloop0(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloop00(ar_0, ar_1, ar_2) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloop01(ar_0, ar_1, ar_2) -> Com_1(evalndloop1(ar_0, ar_2, ar_2)) (Comp: ?, Cost: 1) evalndloop0(ar_0, ar_1, ar_2) -> Com_2(evalndloop00(ar_0, ar_1, d), evalndloop01(ar_0, ar_1, d)) (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb1in(ar_1, ar_1, ar_2)) [ ar_0 + 2 >= ar_1 /\ ar_1 >= ar_0 + 1 /\ 9 >= ar_1 ] (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb2in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_0 + 3 ] (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb2in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb2in(ar_0, ar_1, ar_2)) [ ar_1 >= 10 ] (Comp: ?, Cost: 1) evalndloopbb2in(ar_0, ar_1, ar_2) -> Com_1(evalndloopstop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalndloopstart(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) evalndloopstart(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalndloopbb0in(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb1in(0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloopbb1in(ar_0, ar_1, ar_2) -> Com_1(evalndloop0(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloop00(ar_0, ar_1, ar_2) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalndloop01(ar_0, ar_1, ar_2) -> Com_1(evalndloop1(ar_0, ar_2, ar_2)) (Comp: ?, Cost: 1) evalndloop0(ar_0, ar_1, ar_2) -> Com_2(evalndloop00(ar_0, ar_1, d), evalndloop01(ar_0, ar_1, d)) (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb1in(ar_1, ar_1, ar_2)) [ ar_0 + 2 >= ar_1 /\ ar_1 >= ar_0 + 1 /\ 9 >= ar_1 ] (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb2in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_0 + 3 ] (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb2in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalndloop1(ar_0, ar_1, ar_2) -> Com_1(evalndloopbb2in(ar_0, ar_1, ar_2)) [ ar_1 >= 10 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445