Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988850
details
property
value
status
complete
benchmark
t27.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n129.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.78794 seconds
cpu usage
2.69405
user time
2.48246
system time
0.211588
max virtual memory
1.8432752E7
max residence set size
186796.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.56/1.75 WORST_CASE(?, O(n^1)) 2.56/1.76 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.56/1.76 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.56/1.76 2.56/1.76 2.56/1.76 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.56/1.76 2.56/1.76 (0) CpxIntTrs 2.56/1.76 (1) Koat Proof [FINISHED, 366 ms] 2.56/1.76 (2) BOUNDS(1, n^1) 2.56/1.76 2.56/1.76 2.56/1.76 ---------------------------------------- 2.56/1.76 2.56/1.76 (0) 2.56/1.76 Obligation: 2.56/1.76 Complexity Int TRS consisting of the following rules: 2.56/1.76 eval_t27_start(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb0_in(v_.0, v_.01, v_.1, v_1, v_n, v_y)) :|: TRUE 2.56/1.76 eval_t27_bb0_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb1_in(v_n, v_y, v_.1, v_1, v_n, v_y)) :|: TRUE 2.56/1.76 eval_t27_bb1_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb2_in(v_.0, v_.01, v_.1, v_1, v_n, v_y)) :|: v_.0 < 0 2.56/1.76 eval_t27_bb1_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb5_in(v_.0, v_.01, v_.1, v_1, v_n, v_y)) :|: v_.0 >= 0 2.56/1.76 eval_t27_bb2_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb3_in(v_.0, v_.01, v_.01 + 1000, v_.0 + 1, v_n, v_y)) :|: TRUE 2.56/1.76 eval_t27_bb3_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb4_in(v_.0, v_.01, v_.1, v_1, v_n, v_y)) :|: v_.1 >= 100 2.56/1.76 eval_t27_bb3_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb1_in(v_1, v_.1, v_.1, v_1, v_n, v_y)) :|: v_.1 < 100 2.56/1.76 eval_t27_bb4_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_bb3_in(v_.0, v_.01, v_.1 - 100, v_1, v_n, v_y)) :|: TRUE 2.56/1.76 eval_t27_bb5_in(v_.0, v_.01, v_.1, v_1, v_n, v_y) -> Com_1(eval_t27_stop(v_.0, v_.01, v_.1, v_1, v_n, v_y)) :|: TRUE 2.56/1.76 2.56/1.76 The start-symbols are:[eval_t27_start_6] 2.56/1.76 2.56/1.76 2.56/1.76 ---------------------------------------- 2.56/1.76 2.56/1.76 (1) Koat Proof (FINISHED) 2.56/1.76 YES(?, 4003*ar_1 + 4*ar_3 + 6) 2.56/1.76 2.56/1.76 2.56/1.76 2.56/1.76 Initial complexity problem: 2.56/1.76 2.56/1.76 1: T: 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 + 1 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 0 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_2 + 1000, ar_0 + 1)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= 100 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb1in(ar_5, ar_1, ar_4, ar_3, ar_4, ar_5)) [ 99 >= ar_4 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_4 - 100, ar_5)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.56/1.76 2.56/1.76 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.56/1.76 2.56/1.76 start location: koat_start 2.56/1.76 2.56/1.76 leaf cost: 0 2.56/1.76 2.56/1.76 2.56/1.76 2.56/1.76 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.56/1.76 2.56/1.76 2: T: 2.56/1.76 2.56/1.76 (Comp: 1, Cost: 1) evalt27start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.56/1.76 2.56/1.76 (Comp: 1, Cost: 1) evalt27bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 + 1 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 0 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_2 + 1000, ar_0 + 1)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= 100 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb1in(ar_5, ar_1, ar_4, ar_3, ar_4, ar_5)) [ 99 >= ar_4 ] 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27bb3in(ar_0, ar_1, ar_2, ar_3, ar_4 - 100, ar_5)) 2.56/1.76 2.56/1.76 (Comp: ?, Cost: 1) evalt27bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) 2.56/1.76 2.56/1.76 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalt27start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] 2.56/1.76 2.56/1.76 start location: koat_start 2.56/1.76 2.56/1.76 leaf cost: 0 2.56/1.76 2.56/1.76 2.56/1.76 2.56/1.76 A polynomial rank function with 2.56/1.76 2.56/1.76 Pol(evalt27start) = 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