Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989184
details
property
value
status
complete
benchmark
AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n155.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
2.3339 seconds
cpu usage
3.26505
user time
3.03007
system time
0.234984
max virtual memory
1.8455788E7
max residence set size
186076.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^2))
output
3.07/2.29 WORST_CASE(?, O(n^2)) 3.18/2.31 proof of /export/starexec/sandbox2/output/output_files/bench.koat 3.18/2.31 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.18/2.31 3.18/2.31 3.18/2.31 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^2). 3.18/2.31 3.18/2.31 (0) CpxIntTrs 3.18/2.31 (1) Koat Proof [FINISHED, 984 ms] 3.18/2.31 (2) BOUNDS(1, n^2) 3.18/2.31 3.18/2.31 3.18/2.31 ---------------------------------------- 3.18/2.31 3.18/2.31 (0) 3.18/2.31 Obligation: 3.18/2.31 Complexity Int TRS consisting of the following rules: 3.18/2.31 eval_foo_start(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: TRUE 3.18/2.31 eval_foo_bb0_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb1_in(0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: 0 <= v_n && 0 <= v_m && 0 <= v_N 3.18/2.31 eval_foo_bb0_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb7_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: 0 > v_n 3.18/2.31 eval_foo_bb0_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb7_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: 0 > v_m 3.18/2.31 eval_foo_bb0_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb7_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: 0 > v_N 3.18/2.31 eval_foo_bb1_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb2_in(v_.0, 0, v_.02, v_.0, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: v_.0 < v_n 3.18/2.31 eval_foo_bb1_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb7_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: v_.0 >= v_n 3.18/2.31 eval_foo_bb2_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: v_.01 < v_m 3.18/2.31 eval_foo_bb2_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb6_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: v_.01 >= v_m 3.18/2.31 eval_foo_bb3_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.1, v_.1, v_.01 + 1, v_N, v_i, v_j, v_k, v_m, v_n)) :|: TRUE 3.18/2.31 eval_foo_bb4_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: v_.02 < v_N 3.18/2.31 eval_foo_bb4_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb2_in(v_.0, v_5, v_.02, v_.02, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: v_.02 >= v_N 3.18/2.31 eval_foo_bb5_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.02 + 1, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: TRUE 3.18/2.31 eval_foo_bb6_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_bb1_in(v_.1 + 1, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: TRUE 3.18/2.31 eval_foo_bb7_in(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.02, v_.1, v_5, v_N, v_i, v_j, v_k, v_m, v_n)) :|: TRUE 3.18/2.31 3.18/2.31 The start-symbols are:[eval_foo_start_11] 3.18/2.31 3.18/2.31 3.18/2.31 ---------------------------------------- 3.18/2.31 3.18/2.31 (1) Koat Proof (FINISHED) 3.18/2.31 YES(?, 12*ar_2 + 8*ar_0 + 18*ar_1*ar_2 + 45*ar_1 + 9*ar_0*ar_1 + 41) 3.18/2.31 3.18/2.31 3.18/2.31 3.18/2.31 Initial complexity problem: 3.18/2.31 3.18/2.31 1: T: 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, 0, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 0 /\ ar_1 >= 0 /\ ar_2 >= 0 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_1 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_2 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, 0, ar_3, ar_6, ar_7)) [ ar_0 >= ar_3 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_3 >= ar_0 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_1 >= ar_4 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= ar_1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_5, ar_4 + 1)) 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_2 >= ar_6 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_7, ar_6, ar_6, ar_7)) [ ar_6 >= ar_2 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6 + 1, ar_7)) 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, ar_5 + 1, ar_4, ar_5, ar_6, ar_7)) 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.18/2.31 3.18/2.31 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ] 3.18/2.31 3.18/2.31 start location: koat_start 3.18/2.31 3.18/2.31 leaf cost: 0 3.18/2.31 3.18/2.31 3.18/2.31 3.18/2.31 Repeatedly propagating knowledge in problem 1 produces the following problem: 3.18/2.31 3.18/2.31 2: T: 3.18/2.31 3.18/2.31 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) 3.18/2.31 3.18/2.31 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2, 0, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 0 /\ ar_1 >= 0 /\ ar_2 >= 0 ] 3.18/2.31 3.18/2.31 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 + 1 ] 3.18/2.31 3.18/2.31 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_1 + 1 ] 3.18/2.31 3.18/2.31 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb7in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_2 + 1 ] 3.18/2.31 3.18/2.31 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, 0, ar_3, ar_6, ar_7)) [ ar_0 >= ar_3 + 1 ]
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