Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988864
details
property
value
status
complete
benchmark
t11.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.54638 seconds
cpu usage
2.66523
user time
2.43504
system time
0.230188
max virtual memory
1.8273644E7
max residence set size
183324.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.60/1.52 WORST_CASE(?, O(n^1)) 2.61/1.53 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.61/1.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.61/1.53 2.61/1.53 2.61/1.53 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.61/1.53 2.61/1.53 (0) CpxIntTrs 2.61/1.53 (1) Koat Proof [FINISHED, 278 ms] 2.61/1.53 (2) BOUNDS(1, n^1) 2.61/1.53 2.61/1.53 2.61/1.53 ---------------------------------------- 2.61/1.53 2.61/1.53 (0) 2.61/1.53 Obligation: 2.61/1.53 Complexity Int TRS consisting of the following rules: 2.61/1.53 eval_t11_start(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb0_in(v_.0, v_.01, v_m, v_n, v_x, v_y)) :|: TRUE 2.61/1.53 eval_t11_bb0_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb1_in(v_x, v_y, v_m, v_n, v_x, v_y)) :|: TRUE 2.61/1.53 eval_t11_bb1_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb2_in(v_.0, v_.01, v_m, v_n, v_x, v_y)) :|: v_n > v_.0 2.61/1.53 eval_t11_bb1_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb3_in(v_.0, v_.01, v_m, v_n, v_x, v_y)) :|: v_n <= v_.0 2.61/1.53 eval_t11_bb2_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb1_in(v_.0, v_.01 + 1, v_m, v_n, v_x, v_y)) :|: v_m > v_.01 2.61/1.53 eval_t11_bb2_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb1_in(v_.0 + 1, v_.01 + 1, v_m, v_n, v_x, v_y)) :|: v_m > v_.01 && v_m <= v_.01 2.61/1.53 eval_t11_bb2_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb1_in(v_.0, v_.01, v_m, v_n, v_x, v_y)) :|: v_m <= v_.01 && v_m > v_.01 2.61/1.53 eval_t11_bb2_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_bb1_in(v_.0 + 1, v_.01, v_m, v_n, v_x, v_y)) :|: v_m <= v_.01 2.61/1.53 eval_t11_bb3_in(v_.0, v_.01, v_m, v_n, v_x, v_y) -> Com_1(eval_t11_stop(v_.0, v_.01, v_m, v_n, v_x, v_y)) :|: TRUE 2.61/1.53 2.61/1.53 The start-symbols are:[eval_t11_start_6] 2.61/1.53 2.61/1.53 2.61/1.53 ---------------------------------------- 2.61/1.53 2.61/1.53 (1) Koat Proof (FINISHED) 2.61/1.53 YES(?, 2*ar_1 + 2*ar_4 + 2*ar_3 + 2*ar_5 + 7) 2.61/1.53 2.61/1.53 2.61/1.53 2.61/1.53 Initial complexity problem: 2.61/1.53 2.61/1.53 1: T: 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_0 + 1 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_4 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0 + 1, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 /\ ar_2 >= ar_5 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_5 /\ ar_5 >= ar_2 + 1 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0 + 1, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_5 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.61/1.53 2.61/1.53 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.61/1.53 2.61/1.53 start location: koat_start 2.61/1.53 2.61/1.53 leaf cost: 0 2.61/1.53 2.61/1.53 2.61/1.53 2.61/1.53 Testing for reachability in the complexity graph removes the following transitions from problem 1: 2.61/1.53 2.61/1.53 evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0 + 1, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 /\ ar_2 >= ar_5 ] 2.61/1.53 2.61/1.53 evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_5 /\ ar_5 >= ar_2 + 1 ] 2.61/1.53 2.61/1.53 We thus obtain the following problem: 2.61/1.53 2.61/1.53 2: T: 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0 + 1, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_5 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_0, ar_1, ar_2 + 1, ar_3, ar_4, ar_5)) [ ar_5 >= ar_2 + 1 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_4 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= ar_0 + 1 ] 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.61/1.53 2.61/1.53 (Comp: ?, Cost: 1) evalt11start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.61/1.53 2.61/1.53 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt11start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.61/1.53 2.61/1.53 start location: koat_start 2.61/1.53 2.61/1.53 leaf cost: 0 2.61/1.53 2.61/1.53 2.61/1.53 2.61/1.53 Repeatedly propagating knowledge in problem 2 produces the following problem:
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