Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989110
details
property
value
status
complete
benchmark
svcomp_c.01_assume.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
2.78009 seconds
cpu usage
2.52145
user time
2.31811
system time
0.203339
max virtual memory
1.833918E7
max residence set size
183620.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^2))
output
2.45/1.44 WORST_CASE(?, O(n^2)) 2.45/1.45 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.45/1.45 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.45/1.45 2.45/1.45 2.45/1.45 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^2). 2.45/1.45 2.45/1.45 (0) CpxIntTrs 2.45/1.45 (1) Koat Proof [FINISHED, 179 ms] 2.45/1.45 (2) BOUNDS(1, n^2) 2.45/1.45 2.45/1.45 2.45/1.45 ---------------------------------------- 2.45/1.45 2.45/1.45 (0) 2.45/1.45 Obligation: 2.45/1.45 Complexity Int TRS consisting of the following rules: 2.45/1.45 eval_foo_start(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.1, v_x, v_y)) :|: TRUE 2.45/1.45 eval_foo_bb0_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_.1, v_x, v_y)) :|: TRUE 2.45/1.45 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, 1, v_x, v_y)) :|: v_.0 >= 0 && v_.01 > 0 2.45/1.45 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.1, v_x, v_y)) :|: v_.0 < 0 2.45/1.45 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.1, v_x, v_y)) :|: v_.01 <= 0 2.45/1.45 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.1, v_x, v_y)) :|: v_.0 > v_.1 && v_.1 > 0 2.45/1.45 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.1, v_x, v_y)) :|: v_.0 <= v_.1 2.45/1.45 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.1, v_x, v_y)) :|: v_.1 <= 0 2.45/1.45 eval_foo_bb3_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, 2 * v_.1, v_x, v_y)) :|: TRUE 2.45/1.45 eval_foo_bb4_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_.1, v_.1, v_x, v_y)) :|: TRUE 2.45/1.45 eval_foo_bb5_in(v_.0, v_.01, v_.1, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.1, v_x, v_y)) :|: TRUE 2.45/1.45 2.45/1.45 The start-symbols are:[eval_foo_start_5] 2.45/1.45 2.45/1.45 2.45/1.45 ---------------------------------------- 2.45/1.45 2.45/1.45 (1) Koat Proof (FINISHED) 2.45/1.45 YES(?, 51*ar_1 + 6*ar_1^2 + 53) 2.45/1.45 2.45/1.45 2.45/1.45 2.45/1.45 Initial complexity problem: 2.45/1.45 2.45/1.45 1: T: 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, 1)) [ ar_0 >= 0 /\ ar_2 >= 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 + 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= ar_4 + 1 /\ ar_4 >= 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_4 >= ar_0 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_4 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, 2*ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb1in(ar_0 - 1, ar_1, ar_4, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] 2.45/1.45 2.45/1.45 start location: koat_start 2.45/1.45 2.45/1.45 leaf cost: 0 2.45/1.45 2.45/1.45 2.45/1.45 2.45/1.45 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.45/1.45 2.45/1.45 2: T: 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, 1)) [ ar_0 >= 0 /\ ar_2 >= 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 + 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= ar_4 + 1 /\ ar_4 >= 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_4 >= ar_0 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_4 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, 2*ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb1in(ar_0 - 1, ar_1, ar_4, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38