Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988952
details
property
value
status
complete
benchmark
AliasDarteFeautrierGonnord-SAS2010-wise_true-termination.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
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.49422 seconds
cpu usage
2.3434
user time
2.16239
system time
0.181015
max virtual memory
1.8273644E7
max residence set size
182424.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.10/1.45 WORST_CASE(?, O(n^1)) 2.28/1.46 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.28/1.46 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.28/1.46 2.28/1.46 2.28/1.46 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.28/1.46 2.28/1.46 (0) CpxIntTrs 2.28/1.46 (1) Koat Proof [FINISHED, 183 ms] 2.28/1.46 (2) BOUNDS(1, n^1) 2.28/1.46 2.28/1.46 2.28/1.46 ---------------------------------------- 2.28/1.46 2.28/1.46 (0) 2.28/1.46 Obligation: 2.28/1.46 Complexity Int TRS consisting of the following rules: 2.28/1.46 eval_foo_start(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_x, v_y)) :|: TRUE 2.28/1.46 eval_foo_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_x, v_y)) :|: v_x >= 0 && v_y >= 0 2.28/1.46 eval_foo_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_x < 0 2.28/1.46 eval_foo_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_y < 0 2.28/1.46 eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 - v_.01 > 2 2.28/1.46 eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_x, v_y)) :|: v_.01 - v_.0 > 2 2.28/1.46 eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 - v_.01 <= 2 && v_.01 - v_.0 <= 2 2.28/1.46 eval_foo_.critedge_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01, v_x, v_y)) :|: v_.0 < v_.01 2.28/1.46 eval_foo_.critedge_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 < v_.01 && v_.0 >= v_.01 2.28/1.46 eval_foo_.critedge_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01 + 1, v_x, v_y)) :|: v_.0 >= v_.01 && v_.0 < v_.01 2.28/1.46 eval_foo_.critedge_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0, v_.01 + 1, v_x, v_y)) :|: v_.0 >= v_.01 2.28/1.46 eval_foo_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_x, v_y)) :|: TRUE 2.28/1.46 2.28/1.46 The start-symbols are:[eval_foo_start_4] 2.28/1.46 2.28/1.46 2.28/1.46 ---------------------------------------- 2.28/1.46 2.28/1.46 (1) Koat Proof (FINISHED) 2.28/1.46 YES(?, 8*ar_0 + 8*ar_1 + 14) 2.28/1.46 2.28/1.46 2.28/1.46 2.28/1.46 Initial complexity problem: 2.28/1.46 2.28/1.46 1: T: 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3)) 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_0, ar_1)) [ ar_0 >= 0 /\ ar_1 >= 0 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 + 1 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_1 + 1 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 + 3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 + 3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 + 2 >= ar_2 /\ ar_2 + 2 >= ar_3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 + 1, ar_3)) [ ar_3 >= ar_2 + 1 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 + 1 /\ ar_2 >= ar_3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1)) [ ar_2 >= ar_3 /\ ar_3 >= ar_2 + 1 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_3 + 1)) [ ar_2 >= ar_3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3)) 2.28/1.46 2.28/1.46 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.28/1.46 2.28/1.46 start location: koat_start 2.28/1.46 2.28/1.46 leaf cost: 0 2.28/1.46 2.28/1.46 2.28/1.46 2.28/1.46 Testing for reachability in the complexity graph removes the following transitions from problem 1: 2.28/1.46 2.28/1.46 evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 + 1 /\ ar_2 >= ar_3 ] 2.28/1.46 2.28/1.46 evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1)) [ ar_2 >= ar_3 /\ ar_3 >= ar_2 + 1 ] 2.28/1.46 2.28/1.46 We thus obtain the following problem: 2.28/1.46 2.28/1.46 2: T: 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 + 1, ar_3)) [ ar_3 >= ar_2 + 1 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoocritedgein(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_3 + 1)) [ ar_2 >= ar_3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3)) 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 + 2 >= ar_2 /\ ar_2 + 2 >= ar_3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 + 3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 + 3 ] 2.28/1.46 2.28/1.46 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_1 + 1 ] 2.28/1.46
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