Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989436
details
property
value
status
complete
benchmark
svcomp_b.12.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n181.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.96753 seconds
cpu usage
3.06849
user time
2.83465
system time
0.233845
max virtual memory
1.8440016E7
max residence set size
183492.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.98/1.92 WORST_CASE(?, O(n^1)) 2.98/1.93 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.98/1.93 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.98/1.93 2.98/1.93 2.98/1.93 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.98/1.93 2.98/1.93 (0) CpxIntTrs 2.98/1.93 (1) Koat Proof [FINISHED, 779 ms] 2.98/1.93 (2) BOUNDS(1, n^1) 2.98/1.93 2.98/1.93 2.98/1.93 ---------------------------------------- 2.98/1.93 2.98/1.93 (0) 2.98/1.93 Obligation: 2.98/1.93 Complexity Int TRS consisting of the following rules: 2.98/1.93 eval_foo_start(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: TRUE 2.98/1.93 eval_foo_bb0_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_.1, v_.2, v_c, v_x, v_y)) :|: TRUE 2.98/1.93 eval_foo_bb1_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: v_.01 > 0 2.98/1.93 eval_foo_bb1_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: v_.02 > 0 2.98/1.93 eval_foo_bb1_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb6_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: v_.01 <= 0 && v_.02 <= 0 2.98/1.93 eval_foo_bb2_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: v_.01 > 0 2.98/1.93 eval_foo_bb2_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb4_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: v_.01 <= 0 2.98/1.93 eval_foo_bb3_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.01, v_.02, v_.01 - 1, v_.02, v_c, v_x, v_y)) :|: TRUE 2.98/1.93 eval_foo_bb4_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.01, v_.02, v_.01, v_.02 - 1, v_c, v_x, v_y)) :|: v_.02 > 0 2.98/1.93 eval_foo_bb4_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.01, v_.02, v_.01, v_.02, v_c, v_x, v_y)) :|: v_.02 <= 0 2.98/1.93 eval_foo_bb5_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.1, v_.2, v_.1, v_.2, v_c, v_x, v_y)) :|: TRUE 2.98/1.93 eval_foo_bb6_in(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y) -> Com_1(eval_foo_stop(v_.01, v_.02, v_.1, v_.2, v_c, v_x, v_y)) :|: TRUE 2.98/1.93 2.98/1.93 The start-symbols are:[eval_foo_start_7] 2.98/1.93 2.98/1.93 2.98/1.93 ---------------------------------------- 2.98/1.93 2.98/1.93 (1) Koat Proof (FINISHED) 2.98/1.93 YES(?, 8*ar_1 + 6*ar_3 + 11) 2.98/1.93 2.98/1.93 2.98/1.93 2.98/1.93 Initial complexity problem: 2.98/1.93 2.98/1.93 1: T: 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 /\ 0 >= ar_2 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_0 - 1, ar_2)) 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_0, ar_2 - 1)) [ ar_2 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_0, ar_2)) [ 0 >= ar_2 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_5, ar_3, ar_4, ar_5)) 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.98/1.93 2.98/1.93 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.98/1.93 2.98/1.93 start location: koat_start 2.98/1.93 2.98/1.93 leaf cost: 0 2.98/1.93 2.98/1.93 2.98/1.93 2.98/1.93 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.98/1.93 2.98/1.93 2: T: 2.98/1.93 2.98/1.93 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.98/1.93 2.98/1.93 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 /\ 0 >= ar_2 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_0 - 1, ar_2)) 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_0, ar_2 - 1)) [ ar_2 >= 1 ] 2.98/1.93 2.98/1.93 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_0, ar_2)) [ 0 >= ar_2 ] 2.98/1.93
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