Complexity_ITS 2019-03-21 04.46 pair #429991080

details

property	value
status	complete
benchmark	cyclic.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n150.star.cs.uiowa.edu
space	PLDI09

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.08099 seconds
cpu usage	6.59042
user time	6.23796
system time	0.352469
max virtual memory	1.8704508E7
max residence set size	219924.0

stage attributes

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

output

6.50/3.05	WORST_CASE(Omega(n^1), ?)
6.50/3.06	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
6.50/3.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.50/3.06	
6.50/3.06	
6.50/3.06	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF).
6.50/3.06	
6.50/3.06	(0) CpxIntTrs
6.50/3.06	(1) Loat Proof [FINISHED, 1339 ms]
6.50/3.06	(2) BOUNDS(n^1, INF)
6.50/3.06	
6.50/3.06	
6.50/3.06	----------------------------------------
6.50/3.06	
6.50/3.06	(0)
6.50/3.06	Obligation:
6.50/3.06	Complexity Int TRS consisting of the following rules:
6.50/3.06	evalcyclicstart(A, B, C) -> Com_1(evalcyclicentryin(A, B, C)) :|: TRUE
6.50/3.06	evalcyclicentryin(A, B, C) -> Com_1(evalcyclicbb3in(A, B, A + 1)) :|: A >= 0 && B >= A + 1
6.50/3.06	evalcyclicbb3in(A, B, C) -> Com_1(evalcyclicreturnin(A, B, C)) :|: C >= A && C <= A
6.50/3.06	evalcyclicbb3in(A, B, C) -> Com_1(evalcyclicbb4in(A, B, C)) :|: A >= C + 1
6.50/3.06	evalcyclicbb3in(A, B, C) -> Com_1(evalcyclicbb4in(A, B, C)) :|: C >= A + 1
6.50/3.06	evalcyclicbb4in(A, B, C) -> Com_1(evalcyclicbbin(A, B, C)) :|: 0 >= D + 1
6.50/3.06	evalcyclicbb4in(A, B, C) -> Com_1(evalcyclicbbin(A, B, C)) :|: D >= 1
6.50/3.06	evalcyclicbb4in(A, B, C) -> Com_1(evalcyclicreturnin(A, B, C)) :|: TRUE
6.50/3.06	evalcyclicbbin(A, B, C) -> Com_1(evalcyclicbb3in(A, B, C + 1)) :|: B >= C
6.50/3.06	evalcyclicbbin(A, B, C) -> Com_1(evalcyclicbb3in(A, B, 0)) :|: C >= B + 1
6.50/3.06	evalcyclicreturnin(A, B, C) -> Com_1(evalcyclicstop(A, B, C)) :|: TRUE
6.50/3.06	
6.50/3.06	The start-symbols are:[evalcyclicstart_3]
6.50/3.06	
6.50/3.06	
6.50/3.06	----------------------------------------
6.50/3.06	
6.50/3.06	(1) Loat Proof (FINISHED)
6.50/3.06	
6.50/3.06	
6.50/3.06	### Pre-processing the ITS problem ###
6.50/3.06	
6.50/3.06	
6.50/3.06	
6.50/3.06	Initial linear ITS problem
6.50/3.06	
6.50/3.06	   Start location: evalcyclicstart
6.50/3.06	
6.50/3.06	      0: evalcyclicstart -> evalcyclicentryin : [], cost: 1
6.50/3.06	
6.50/3.06	      1: evalcyclicentryin -> evalcyclicbb3in : C'=1+A, [ A>=0 && B>=1+A ], cost: 1
6.50/3.06	
6.50/3.06	      2: evalcyclicbb3in -> evalcyclicreturnin : [ C==A ], cost: 1
6.50/3.06	
6.50/3.06	      3: evalcyclicbb3in -> evalcyclicbb4in : [ A>=1+C ], cost: 1
6.50/3.06	
6.50/3.06	      4: evalcyclicbb3in -> evalcyclicbb4in : [ C>=1+A ], cost: 1
6.50/3.06	
6.50/3.06	      5: evalcyclicbb4in -> evalcyclicbbin : [ 0>=1+free ], cost: 1
6.50/3.06	
6.50/3.06	      6: evalcyclicbb4in -> evalcyclicbbin : [ free_1>=1 ], cost: 1
6.50/3.06	
6.50/3.06	      7: evalcyclicbb4in -> evalcyclicreturnin : [], cost: 1
6.50/3.06	
6.50/3.06	      8: evalcyclicbbin -> evalcyclicbb3in : C'=1+C, [ B>=C ], cost: 1
6.50/3.06	
6.50/3.06	      9: evalcyclicbbin -> evalcyclicbb3in : C'=0, [ C>=1+B ], cost: 1
6.50/3.06	
6.50/3.06	     10: evalcyclicreturnin -> evalcyclicstop : [], cost: 1
6.50/3.06	
6.50/3.06	
6.50/3.06	
6.50/3.06	Removed unreachable and leaf rules:
6.50/3.06	
6.50/3.06	   Start location: evalcyclicstart
6.50/3.06	
6.50/3.06	      0: evalcyclicstart -> evalcyclicentryin : [], cost: 1
6.50/3.06	
6.50/3.06	      1: evalcyclicentryin -> evalcyclicbb3in : C'=1+A, [ A>=0 && B>=1+A ], cost: 1
6.50/3.06	
6.50/3.06	      3: evalcyclicbb3in -> evalcyclicbb4in : [ A>=1+C ], cost: 1
6.50/3.06	
6.50/3.06	      4: evalcyclicbb3in -> evalcyclicbb4in : [ C>=1+A ], cost: 1
6.50/3.06	
6.50/3.06	      5: evalcyclicbb4in -> evalcyclicbbin : [ 0>=1+free ], cost: 1
6.50/3.06	
6.50/3.06	      6: evalcyclicbb4in -> evalcyclicbbin : [ free_1>=1 ], cost: 1
6.50/3.06	
6.50/3.06	      8: evalcyclicbbin -> evalcyclicbb3in : C'=1+C, [ B>=C ], cost: 1
6.50/3.06	
6.50/3.06	      9: evalcyclicbbin -> evalcyclicbb3in : C'=0, [ C>=1+B ], cost: 1
6.50/3.06	
6.50/3.06	
6.50/3.06	
6.50/3.06	Simplified all rules, resulting in:
6.50/3.06	
6.50/3.06	   Start location: evalcyclicstart
6.50/3.06	
6.50/3.06	      0: evalcyclicstart -> evalcyclicentryin : [], cost: 1
6.50/3.06	
6.50/3.06	      1: evalcyclicentryin -> evalcyclicbb3in : C'=1+A, [ A>=0 && B>=1+A ], cost: 1
6.50/3.06	
6.50/3.06	      3: evalcyclicbb3in -> evalcyclicbb4in : [ A>=1+C ], 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