Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989432
details
property
value
status
complete
benchmark
Nested.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.33689 seconds
cpu usage
2.38171
user time
2.20832
system time
0.173386
max virtual memory
1.8273644E7
max residence set size
180928.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(1))
output
2.19/1.29 WORST_CASE(?, O(1)) 2.19/1.30 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.19/1.30 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.19/1.30 2.19/1.30 2.19/1.30 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 2.19/1.30 2.19/1.30 (0) CpxIntTrs 2.19/1.30 (1) Koat Proof [FINISHED, 77 ms] 2.19/1.30 (2) BOUNDS(1, 1) 2.19/1.30 2.19/1.30 2.19/1.30 ---------------------------------------- 2.19/1.30 2.19/1.30 (0) 2.19/1.30 Obligation: 2.19/1.30 Complexity Int TRS consisting of the following rules: 2.19/1.30 eval_foo_start(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.1, v_i, v_j)) :|: TRUE 2.19/1.30 eval_foo_bb0_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb1_in(0, 3, v_.1, v_i, v_j)) :|: TRUE 2.19/1.30 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.01, v_i, v_j)) :|: v_.0 < 10 2.19/1.30 eval_foo_bb1_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.1, v_i, v_j)) :|: v_.0 >= 10 2.19/1.30 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.1, v_i, v_j)) :|: v_.1 < 12 2.19/1.30 eval_foo_bb2_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.1, v_i, v_j)) :|: v_.1 >= 12 2.19/1.30 eval_foo_bb3_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.1 + 1, v_i, v_j)) :|: TRUE 2.19/1.30 eval_foo_bb4_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.1, v_.1, v_i, v_j)) :|: TRUE 2.19/1.30 eval_foo_bb5_in(v_.0, v_.01, v_.1, v_i, v_j) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.1, v_i, v_j)) :|: TRUE 2.19/1.30 2.19/1.30 The start-symbols are:[eval_foo_start_5] 2.19/1.30 2.19/1.30 2.19/1.30 ---------------------------------------- 2.19/1.30 2.19/1.30 (1) Koat Proof (FINISHED) 2.19/1.30 YES(?, 74) 2.19/1.30 2.19/1.30 2.19/1.30 2.19/1.30 Initial complexity problem: 2.19/1.30 2.19/1.30 1: T: 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(0, 3, ar_2)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_1)) [ 9 >= ar_0 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2)) [ ar_0 >= 10 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ 11 >= ar_2 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2)) [ ar_2 >= 12 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2 + 1)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0 + 1, ar_2, ar_2)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2) -> Com_1(evalfoostop(ar_0, ar_1, ar_2)) 2.19/1.30 2.19/1.30 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalfoostart(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.19/1.30 2.19/1.30 start location: koat_start 2.19/1.30 2.19/1.30 leaf cost: 0 2.19/1.30 2.19/1.30 2.19/1.30 2.19/1.30 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.19/1.30 2.19/1.30 2: T: 2.19/1.30 2.19/1.30 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2)) 2.19/1.30 2.19/1.30 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(0, 3, ar_2)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_1)) [ 9 >= ar_0 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2)) [ ar_0 >= 10 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ 11 >= ar_2 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2)) [ ar_2 >= 12 ] 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2 + 1)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0 + 1, ar_2, ar_2)) 2.19/1.30 2.19/1.30 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2) -> Com_1(evalfoostop(ar_0, ar_1, ar_2)) 2.19/1.30 2.19/1.30 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalfoostart(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.19/1.30 2.19/1.30 start location: koat_start 2.19/1.30 2.19/1.30 leaf cost: 0 2.19/1.30 2.19/1.30 2.19/1.30 2.19/1.30 A polynomial rank function with 2.19/1.30 2.19/1.30 Pol(evalfoostart) = 2
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