Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746017
details
property
value
status
complete
benchmark
perfectg.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n113.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.92966103554 seconds
cpu usage
3.007847064
max memory
3.43228416E8
stage attributes
key
value
output-size
109574
starexec-result
WORST_CASE(?, O(n^2))
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^2)) 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^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 784 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_perfectg_start(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb0_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2)) :|: TRUE eval_perfectg_bb0_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb2_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, nondef.0)) :|: v_x <= 1 eval_perfectg_bb0_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb1_in(v_2, v_x, v_x, v_y2.1, v_x, v_y3.2)) :|: v_x > 1 eval_perfectg_bb1_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb2_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.0)) :|: v_y1.0 - 1 >= 0 && v_y1.0 - 1 <= 0 eval_perfectg_bb1_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb3_in(v_y1.0 - 1, v_x, v_y1.0, v_x, v_y3.0, v_y3.2)) :|: v_y1.0 - 1 < 0 eval_perfectg_bb1_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb3_in(v_y1.0 - 1, v_x, v_y1.0, v_x, v_y3.0, v_y3.2)) :|: v_y1.0 - 1 > 0 eval_perfectg_bb2_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_stop(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2)) :|: v_y3.2 < 0 eval_perfectg_bb2_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_stop(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2)) :|: v_y3.2 > 0 eval_perfectg_bb2_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_stop(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2)) :|: v_y3.2 >= 0 && v_y3.2 <= 0 eval_perfectg_bb3_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb4_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2)) :|: v_y2.1 < v_2 eval_perfectg_bb3_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb5_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2)) :|: v_y2.1 >= v_2 eval_perfectg_bb4_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb1_in(v_2, v_x, v_2, v_y2.1, v_y3.0, v_y3.2)) :|: v_y2.1 < 0 eval_perfectg_bb4_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb1_in(v_2, v_x, v_2, v_y2.1, v_y3.0, v_y3.2)) :|: v_y2.1 > 0 eval_perfectg_bb4_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb1_in(v_2, v_x, v_2, v_y2.1, v_y3.0 - v_2, v_y3.2)) :|: v_y2.1 >= 0 && v_y2.1 <= 0 eval_perfectg_bb5_in(v_2, v_x, v_y1.0, v_y2.1, v_y3.0, v_y3.2) -> Com_1(eval_perfectg_bb3_in(v_2, v_x, v_y1.0, v_y2.1 - v_2, v_y3.0, v_y3.2)) :|: TRUE The start-symbols are:[eval_perfectg_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 4*ar_0^2 + 9*ar_0 + 11) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalperfectgstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalperfectgbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb2in(ar_0, g, ar_2, ar_3, ar_4, ar_5)) [ 1 >= ar_0 ] (Comp: ?, Cost: 1) evalperfectgbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb1in(ar_0, ar_1, ar_0, ar_0, ar_4, ar_5)) [ ar_0 >= 2 ] (Comp: ?, Cost: 1) evalperfectgbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb2in(ar_0, ar_3, ar_2, ar_3, ar_4, ar_5)) [ ar_2 = 1 ] (Comp: ?, Cost: 1) evalperfectgbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb3in(ar_0, ar_1, ar_2, ar_3, ar_2 - 1, ar_0)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalperfectgbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb3in(ar_0, ar_1, ar_2, ar_3, ar_2 - 1, ar_0)) [ ar_2 >= 2 ] (Comp: ?, Cost: 1) evalperfectgbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalperfectgbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= 1 ] (Comp: ?, Cost: 1) evalperfectgbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 = 0 ] (Comp: ?, Cost: 1) evalperfectgbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evalperfectgbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_5 >= ar_4 ] (Comp: ?, Cost: 1) evalperfectgbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb1in(ar_0, ar_1, ar_4, ar_3, ar_4, ar_5)) [ 0 >= ar_5 + 1 ] (Comp: ?, Cost: 1) evalperfectgbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb1in(ar_0, ar_1, ar_4, ar_3, ar_4, ar_5)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalperfectgbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb1in(ar_0, ar_1, ar_4, ar_3 - ar_4, ar_4, ar_5)) [ ar_5 = 0 ] (Comp: ?, Cost: 1) evalperfectgbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5 - ar_4)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgstart(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) evalperfectgstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 1) evalperfectgbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb2in(ar_0, g, ar_2, ar_3, ar_4, ar_5)) [ 1 >= ar_0 ] (Comp: 1, Cost: 1) evalperfectgbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalperfectgbb1in(ar_0, ar_1, ar_0, ar_0, ar_4, ar_5)) [ ar_0 >= 2 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445