Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745560
details
property
value
status
complete
benchmark
Loopus2015_ex2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n002.star.cs.uiowa.edu
space
Loopus
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.61635899544 seconds
cpu usage
2.752969404
max memory
3.07228672E8
stage attributes
key
value
output-size
92675
starexec-result
WORST_CASE(?, O(n^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(n^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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 486 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_Loopus2015_ex2_start(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb0_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: TRUE eval_Loopus2015_ex2_bb0_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb6_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_n < 0 eval_Loopus2015_ex2_bb0_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb6_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_m1 < 0 eval_Loopus2015_ex2_bb0_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb6_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_m2 < 0 eval_Loopus2015_ex2_bb0_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb1_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_n >= 0 && v_m1 >= 0 && v_m2 >= 0 eval_Loopus2015_ex2_bb1_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_0(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: TRUE eval_Loopus2015_ex2_0(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_2(eval_nondet_start(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0), eval_Loopus2015_ex2_1(nondef.0, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: TRUE eval_Loopus2015_ex2_1(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb2_in(v_3, v_m1, v_m2, v_n, v_m1, v_n, v_z.0)) :|: v_3 > 0 eval_Loopus2015_ex2_1(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb2_in(v_3, v_m1, v_m2, v_n, v_m2, v_n, v_z.0)) :|: v_3 <= 0 eval_Loopus2015_ex2_bb2_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb3_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_y.0 > 0 eval_Loopus2015_ex2_bb2_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb4_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_x.1)) :|: v_y.0 <= 0 eval_Loopus2015_ex2_bb3_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb2_in(v_3, v_m1, v_m2, v_n, v_x.1 + 2, v_y.0 - 1, v_z.0)) :|: TRUE eval_Loopus2015_ex2_bb4_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb5_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_z.0 > 0 eval_Loopus2015_ex2_bb4_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb6_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: v_z.0 <= 0 eval_Loopus2015_ex2_bb5_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_bb4_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0 - 1)) :|: TRUE eval_Loopus2015_ex2_bb6_in(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0) -> Com_1(eval_Loopus2015_ex2_stop(v_3, v_m1, v_m2, v_n, v_x.1, v_y.0, v_z.0)) :|: TRUE The start-symbols are:[eval_Loopus2015_ex2_start_7] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 34*ar_0 + 30*ar_1 + 30*ar_2 + 3024) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalLoopus2015ex2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalLoopus2015ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 0 /\ ar_1 >= 0 /\ ar_2 >= 0 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalLoopus2015ex200(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalLoopus2015ex201(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex21(ar_0, ar_1, ar_2, ar_4, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalLoopus2015ex20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalLoopus2015ex200(ar_0, ar_1, ar_2, ar_3, i, ar_5, ar_6, ar_7), evalLoopus2015ex201(ar_0, ar_1, ar_2, ar_3, i, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalLoopus2015ex21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_1, ar_0, ar_7)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2015ex21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2, ar_0, ar_7)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_6 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_5)) [ 0 >= ar_6 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 + 2, ar_6 - 1, ar_7)) (Comp: ?, Cost: 1) evalLoopus2015ex2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_7 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_7 ] (Comp: ?, Cost: 1) evalLoopus2015ex2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7 - 1)) (Comp: ?, Cost: 1) evalLoopus2015ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2015ex2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445