details

property	value
status	complete
benchmark	perfect.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n068.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	12.527 seconds
cpu usage	17.9105
user time	17.0091
system time	0.901417
max virtual memory	3.6437712E7
max residence set size	225808.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), O(n^2))

output

17.74/12.48 WORST_CASE(Omega(n^1), O(n^2)) 17.74/12.49 proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat 17.74/12.49 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.74/12.49 17.74/12.49 17.74/12.49 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(13, 7 + 3 * Arg_0) + max(3 * Arg_0, 6) * nat(Arg_0) + nat(Arg_0 * max(3 * Arg_0, 6)) * nat(Arg_0) + nat(Arg_0 * max(3 * Arg_0, 6)) + nat(8 * Arg_0) + max(3 + Arg_0, 3) + max(4 * Arg_0, 8)). 17.74/12.49 17.74/12.49 (0) CpxIntTrs 17.74/12.49 (1) Loat Proof [FINISHED, 1819 ms] 17.74/12.49 (2) BOUNDS(n^1, INF) 17.74/12.49 17.74/12.49 17.74/12.49 ---------------------------------------- 17.74/12.49 17.74/12.49 (0) 17.74/12.49 Obligation: 17.74/12.49 Complexity Int TRS consisting of the following rules: 17.74/12.49 eval_perfect_start(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb0_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_bb0_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_0(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_0(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_1(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_1(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb6_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_x <= 1 17.74/12.49 eval_perfect_1(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb1_in(v__y3_0, v_1, v_6, v_x, v_x, v_y2_1, v_x)) :|: v_x > 1 17.74/12.49 eval_perfect_bb1_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb2_in(v__y3_0, v_y1_0_sink - 1, v_6, v_x, v_y1_0_sink, v_x, v_y3_0)) :|: v_y1_0_sink - 1 > 0 17.74/12.49 eval_perfect_bb1_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb5_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y1_0_sink - 1 <= 0 17.74/12.49 eval_perfect_bb2_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb3_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y2_1 >= v_1 17.74/12.49 eval_perfect_bb2_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb4_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y2_1 < v_1 17.74/12.49 eval_perfect_bb3_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb2_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1 - v_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_bb4_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_7(v__y3_0, v_1, v_y3_0 - v_1, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_7(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_8(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_8(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_9(v_6, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y2_1 >= 0 && v_y2_1 <= 0 17.74/12.49 eval_perfect_8(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_9(v_y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y2_1 < 0 17.74/12.49 eval_perfect_8(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_9(v_y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y2_1 > 0 17.74/12.49 eval_perfect_9(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_10(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_10(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_11(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 eval_perfect_11(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb1_in(v__y3_0, v_1, v_6, v_x, v_1, v_y2_1, v__y3_0)) :|: TRUE 17.74/12.49 eval_perfect_bb5_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb6_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y3_0 < 0 17.74/12.49 eval_perfect_bb5_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb6_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y3_0 > 0 17.74/12.49 eval_perfect_bb5_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_bb6_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: v_y3_0 >= 0 && v_y3_0 <= 0 17.74/12.49 eval_perfect_bb6_in(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0) -> Com_1(eval_perfect_stop(v__y3_0, v_1, v_6, v_x, v_y1_0_sink, v_y2_1, v_y3_0)) :|: TRUE 17.74/12.49 17.74/12.49 The start-symbols are:[eval_perfect_start_7] 17.74/12.49 17.74/12.49 17.74/12.49 ---------------------------------------- 17.74/12.49 17.74/12.49 (1) Loat Proof (FINISHED) 17.74/12.49 17.74/12.49 17.74/12.49 ### Pre-processing the ITS problem ### 17.74/12.49 17.74/12.49 17.74/12.49 17.74/12.49 Initial linear ITS problem 17.74/12.49 17.74/12.49 Start location: evalperfectstart 17.74/12.49 17.74/12.49 0: evalperfectstart -> evalperfectbb0in : [], cost: 1 17.74/12.49 17.74/12.49 1: evalperfectbb0in -> evalperfect0 : [], cost: 1 17.74/12.49 17.74/12.49 2: evalperfect0 -> evalperfect1 : [], cost: 1 17.74/12.49 17.74/12.49 3: evalperfect1 -> evalperfectbb6in : [ 1>=A ], cost: 1 17.74/12.49 17.74/12.49 4: evalperfect1 -> evalperfectbb1in : B'=A, C'=A, [ A>=2 ], cost: 1 17.74/12.49 17.74/12.49 5: evalperfectbb1in -> evalperfectbb2in : D'=-1+B, E'=A, [ B>=2 ], cost: 1 17.74/12.49 17.74/12.49 6: evalperfectbb1in -> evalperfectbb5in : [ 1>=B ], cost: 1 17.74/12.49 17.74/12.49 7: evalperfectbb2in -> evalperfectbb3in : [ E>=D ], cost: 1 17.74/12.49 17.74/12.49 8: evalperfectbb2in -> evalperfectbb4in : [ D>=1+E ], cost: 1 17.74/12.49 17.74/12.49 9: evalperfectbb3in -> evalperfectbb2in : E'=-D+E, [], cost: 1 17.74/12.49 17.74/12.49 10: evalperfectbb4in -> evalperfect7 : F'=C-D, [], cost: 1 17.74/12.49 17.74/12.49 11: evalperfect7 -> evalperfect8 : [], cost: 1 17.74/12.49 17.74/12.49 12: evalperfect8 -> evalperfect9 : G'=F, [ E==0 ], cost: 1 17.74/12.49 17.74/12.49 13: evalperfect8 -> evalperfect9 : G'=C, [ 0>=1+E ], cost: 1 17.74/12.49 17.74/12.49 14: evalperfect8 -> evalperfect9 : G'=C, [ E>=1 ], cost: 1 17.74/12.49 17.74/12.49 15: evalperfect9 -> evalperfect10 : [], cost: 1 17.74/12.49 17.74/12.49 16: evalperfect10 -> evalperfect11 : [], cost: 1 17.74/12.49 17.74/12.49 17: evalperfect11 -> evalperfectbb1in : B'=D, C'=G, [], cost: 1 17.74/12.49 17.74/12.49 18: evalperfectbb5in -> evalperfectbb6in : [ 0>=1+C ], cost: 1 17.74/12.49 17.74/12.49 19: evalperfectbb5in -> evalperfectbb6in : [ C>=1 ], cost: 1 17.74/12.49 17.74/12.49 20: evalperfectbb5in -> evalperfectbb6in : [ C==0 ], cost: 1 17.74/12.49 17.74/12.49 21: evalperfectbb6in -> evalperfectstop : [], cost: 1 17.74/12.49 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46