Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989128
details
property
value
status
complete
benchmark
AliasDarteFeautrierGonnord-SAS2010-rsd_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n093.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
7.25831 seconds
cpu usage
4.91003
user time
4.62065
system time
0.289379
max virtual memory
1.86173E7
max residence set size
189240.0
stage attributes
key
value
starexec-result
WORST_CASE(?, ?)
output
4.76/3.70 WORST_CASE(?, ?) 4.86/3.71 proof of /export/starexec/sandbox/output/output_files/bench.koat 4.86/3.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.86/3.71 4.86/3.71 4.86/3.71 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, EXP). 4.86/3.71 4.86/3.71 (0) CpxIntTrs 4.86/3.71 (1) Koat Proof [FINISHED, 2390 ms] 4.86/3.71 (2) BOUNDS(1, EXP) 4.86/3.71 4.86/3.71 4.86/3.71 ---------------------------------------- 4.86/3.71 4.86/3.71 (0) 4.86/3.71 Obligation: 4.86/3.71 Complexity Int TRS consisting of the following rules: 4.86/3.71 eval_foo_start(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE 4.86/3.71 eval_foo_bb0_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb1_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_r >= 0 4.86/3.71 eval_foo_bb0_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_r < 0 4.86/3.71 eval_foo_bb1_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(2 * v_r, 2 * v_r, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE 4.86/3.71 eval_foo_bb2_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_.0 >= v_r 4.86/3.71 eval_foo_bb2_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_.0 < v_r 4.86/3.71 eval_foo_bb3_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_3(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE 4.86/3.71 eval_foo_3(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp), eval_foo_4(v_.0, v_.01, nondef.0, v_da, v_db, v_r, v_temp)) :|: TRUE 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 < 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 < 0 && v_4 > 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 > 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.01 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 < 0 && v_4 >= 0 && v_4 <= 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.01 - 1, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 > 0 && v_4 >= 0 && v_4 <= 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01 - 1, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 >= 0 && v_4 <= 0 && v_4 < 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.0 - 1, v_.01 - 1, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 >= 0 && v_4 <= 0 && v_4 > 0 4.86/3.71 eval_foo_4(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_bb2_in(v_.01 - 1, v_.01 - 1, v_4, v_da, v_db, v_r, v_temp)) :|: v_4 >= 0 && v_4 <= 0 4.86/3.71 eval_foo_bb4_in(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp) -> Com_1(eval_foo_stop(v_.0, v_.01, v_4, v_da, v_db, v_r, v_temp)) :|: TRUE 4.86/3.71 4.86/3.71 The start-symbols are:[eval_foo_start_7] 4.86/3.71 4.86/3.71 4.86/3.71 ---------------------------------------- 4.86/3.71 4.86/3.71 (1) Koat Proof (FINISHED) 4.86/3.71 YES(?, 2 * pow(2, 2*ar_0 + 1) * (16*ar_0 + 4) + pow(2, 2*ar_0 + 1) * 4 + pow(2, 2*ar_0 + 1) * (4*ar_0 + 1) + 36*ar_0 + 31) 4.86/3.71 4.86/3.71 4.86/3.71 4.86/3.71 Initial complexity problem: 4.86/3.71 4.86/3.71 1: T: 4.86/3.71 4.86/3.71 (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)) 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= 0 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoobb0in(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_0 + 1 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, 2*ar_0, 2*ar_0, ar_3, ar_4)) 4.86/3.71 4.86/3.71 (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_1 >= ar_0 ] 4.86/3.71 4.86/3.71 (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_0 >= ar_1 + 1 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4)) 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4)) 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_4, ar_4)) 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, f), evalfoo31(ar_0, ar_1, ar_2, ar_3, f)) 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 + 1 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 + 1 /\ ar_3 >= 1 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2 - 1, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2 - 1, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 0 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2 - 1, ar_3, ar_4)) [ ar_3 = 0 ] 4.86/3.71 4.86/3.71 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4)) 4.86/3.71 4.86/3.71 (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 ] 4.86/3.71 4.86/3.71 start location: koat_start 4.86/3.71 4.86/3.71 leaf cost: 0 4.86/3.71 4.86/3.71 4.86/3.71 4.86/3.71 Testing for reachability in the complexity graph removes the following transitions from problem 1: 4.86/3.71 4.86/3.71 evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_1 - 1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 + 1 /\ ar_3 >= 1 ] 4.86/3.71 4.86/3.71 evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalfoobb2in(ar_0, ar_2 - 1, ar_2, ar_3, ar_4)) [ 0 >= 1 /\ ar_3 = 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