Complexity_ITS 2019-03-21 04.46 pair #429990026

details
property	value
status	complete
benchmark	rank1.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n164.star.cs.uiowa.edu
space	Flores-Montoya_16
run statistics
property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	18.2062 seconds
cpu usage	31.2607
user time	29.3806
system time	1.88007
max virtual memory	1.87694E7
max residence set size	243972.0
stage attributes
key	value
starexec-result	WORST_CASE(Omega(n^1), ?)
output
31.18/18.15	WORST_CASE(Omega(n^1), ?)
31.18/18.16	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
31.18/18.16	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
31.18/18.16	
31.18/18.16	
31.18/18.16	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF).
31.18/18.16	
31.18/18.16	(0) CpxIntTrs
31.18/18.16	(1) Loat Proof [FINISHED, 2522 ms]
31.18/18.16	(2) BOUNDS(n^1, INF)
31.18/18.16	
31.18/18.16	
31.18/18.16	----------------------------------------
31.18/18.16	
31.18/18.16	(0)
31.18/18.16	Obligation:
31.18/18.16	Complexity Int TRS consisting of the following rules:
31.18/18.16	eval_rank1_start(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb0_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_bb0_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_0(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_0(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_1(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_1(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_2(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_2(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_3(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_3(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_4(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_4(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_5(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_5(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb1_in(v_2, v_5, v_8, v_m, v_m, v_x_1, 0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_bb1_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb2_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_x_0 >= 0 && v_y_0 >= 0
31.18/18.16	eval_rank1_bb1_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb7_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_x_0 < 0
31.18/18.16	eval_rank1_bb1_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb7_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_y_0 < 0
31.18/18.16	eval_rank1_bb2_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_6(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_6(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_7(nondef_0, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_7(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb3_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_0, v_y_2)) :|: v_2 > 0
31.18/18.16	eval_rank1_7(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb6_in(v_2, v_5, v_8, v_m, v_x_0, v_x_0, v_y_0, v_y_1, v_y_0)) :|: v_2 <= 0
31.18/18.16	eval_rank1_bb3_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb4_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_y_1 <= v_m
31.18/18.16	eval_rank1_bb3_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1__critedge_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_y_1 > v_m
31.18/18.16	eval_rank1_bb4_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_8(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_8(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_9(v_2, nondef_1, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_9(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb5_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_5 > 0
31.18/18.16	eval_rank1_9(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1__critedge_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: v_5 <= 0
31.18/18.16	eval_rank1_bb5_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb3_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1 + 1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1__critedge_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_13(v_2, v_5, v_x_0 - 1, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_13(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_14(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_14(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb6_in(v_2, v_5, v_8, v_m, v_x_0, v_8, v_y_0, v_y_1, v_y_1)) :|: TRUE
31.18/18.16	eval_rank1_bb6_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_bb1_in(v_2, v_5, v_8, v_m, v_x_1, v_x_1, v_y_2 - 1, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	eval_rank1_bb7_in(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2) -> Com_1(eval_rank1_stop(v_2, v_5, v_8, v_m, v_x_0, v_x_1, v_y_0, v_y_1, v_y_2)) :|: TRUE
31.18/18.16	
31.18/18.16	The start-symbols are:[eval_rank1_start_9]
31.18/18.16	
31.18/18.16	
31.18/18.16	----------------------------------------
31.18/18.16	
31.18/18.16	(1) Loat Proof (FINISHED)
31.18/18.16	
31.18/18.16	
31.18/18.16	### Pre-processing the ITS problem ###
31.18/18.16	
31.18/18.16	
31.18/18.16	
31.18/18.16	Initial linear ITS problem
31.18/18.16	
31.18/18.16	   Start location: evalrank1start
31.18/18.16	
31.18/18.16	      0: evalrank1start -> evalrank1bb0in : [], cost: 1
31.18/18.16	
31.18/18.16	      1: evalrank1bb0in -> evalrank10 : [], cost: 1
31.18/18.16	
31.18/18.16	      2: evalrank10 -> evalrank11 : [], cost: 1
31.18/18.16	
31.18/18.16	      3: evalrank11 -> evalrank12 : [], cost: 1
31.18/18.16	
31.18/18.16	      4: evalrank12 -> evalrank13 : [], cost: 1
31.18/18.16	
31.18/18.16	      5: evalrank13 -> evalrank14 : [], cost: 1
31.18/18.16	
31.18/18.16	      6: evalrank14 -> evalrank15 : [], cost: 1
31.18/18.16	
31.18/18.16	      7: evalrank15 -> evalrank1bb1in : A'=B, C'=0, [], cost: 1
31.18/18.16	
31.18/18.16	      8: evalrank1bb1in -> evalrank1bb2in : [ A>=0 && C>=0 ], cost: 1
31.18/18.16	
31.18/18.16	      9: evalrank1bb1in -> evalrank1bb7in : [ 0>=1+A ], cost: 1
31.18/18.16	
31.18/18.16	     10: evalrank1bb1in -> evalrank1bb7in : [ 0>=1+C ], cost: 1
31.18/18.16	
31.18/18.16	     11: evalrank1bb2in -> evalrank16 : [], cost: 1
31.18/18.16	
31.18/18.16	     12: evalrank16 -> evalrank17 : D'=free, [], cost: 1
31.18/18.16	
31.18/18.16	     13: evalrank17 -> evalrank1bb3in : E'=C, [ D>=1 ], cost: 1
31.18/18.16	
31.18/18.16	     14: evalrank17 -> evalrank1bb6in : F'=A, G'=C, [ 0>=D ], cost: 1
31.18/18.16	
31.18/18.16	     15: evalrank1bb3in -> evalrank1bb4in : [ B>=E ], cost: 1
31.18/18.16	
31.18/18.16	     16: evalrank1bb3in -> evalrank1critedgein : [ E>=1+B ], cost: 1
31.18/18.16	
31.18/18.16	     17: evalrank1bb4in -> evalrank18 : [], cost: 1
31.18/18.16	
31.18/18.16	     18: evalrank18 -> evalrank19 : H'=free_1, [], cost: 1
31.18/18.16	
31.18/18.16	     19: evalrank19 -> evalrank1bb5in : [ H>=1 ], cost: 1
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