4.62/1.94	YES
4.62/1.96	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
4.62/1.96	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.62/1.96	
4.62/1.96	
4.62/1.96	Termination of the given C Problem could be proven:
4.62/1.96	
4.62/1.96	(0) C Problem
4.62/1.96	(1) CToIRSProof [EQUIVALENT, 0 ms]
4.62/1.96	(2) IntTRS
4.62/1.96	(3) TerminationGraphProcessor [SOUND, 54 ms]
4.62/1.96	(4) IntTRS
4.62/1.96	(5) IntTRSCompressionProof [EQUIVALENT, 49 ms]
4.62/1.96	(6) IntTRS
4.62/1.96	(7) PolynomialOrderProcessor [EQUIVALENT, 12 ms]
4.62/1.96	(8) YES
4.62/1.96	
4.62/1.96	
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(0)
4.62/1.96	Obligation:
4.62/1.96	c file /export/starexec/sandbox/benchmark/theBenchmark.c
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(1) CToIRSProof (EQUIVALENT)
4.62/1.96	Parsed C Integer Program as IRS.
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(2)
4.62/1.96	Obligation:
4.62/1.96	Rules:
4.62/1.96	f1(i) -> f2(x_1) :|: TRUE
4.62/1.96	f4(x) -> f7(arith) :|: TRUE && arith = x + 1
4.62/1.96	f5(x11) -> f8(x12) :|: TRUE && x12 = x11 + 2
4.62/1.96	f3(x2) -> f4(x2) :|: x3 < 0
4.62/1.96	f3(x13) -> f4(x13) :|: x14 > 0
4.62/1.96	f3(x4) -> f5(x4) :|: x5 = 0
4.62/1.96	f7(x6) -> f6(x6) :|: TRUE
4.62/1.96	f8(x7) -> f6(x7) :|: TRUE
4.62/1.96	f2(x8) -> f3(x8) :|: x8 < 255
4.62/1.96	f6(x9) -> f2(x9) :|: TRUE
4.62/1.96	f2(x10) -> f9(x10) :|: x10 >= 255
4.62/1.96	Start term: f1(i)
4.62/1.96	
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(3) TerminationGraphProcessor (SOUND)
4.62/1.96	Constructed the termination graph and obtained one non-trivial SCC.
4.62/1.96	
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(4)
4.62/1.96	Obligation:
4.62/1.96	Rules:
4.62/1.96	f2(x8) -> f3(x8) :|: x8 < 255
4.62/1.96	f6(x9) -> f2(x9) :|: TRUE
4.62/1.96	f7(x6) -> f6(x6) :|: TRUE
4.62/1.96	f4(x) -> f7(arith) :|: TRUE && arith = x + 1
4.62/1.96	f3(x2) -> f4(x2) :|: x3 < 0
4.62/1.96	f3(x13) -> f4(x13) :|: x14 > 0
4.62/1.96	f8(x7) -> f6(x7) :|: TRUE
4.62/1.96	f5(x11) -> f8(x12) :|: TRUE && x12 = x11 + 2
4.62/1.96	f3(x4) -> f5(x4) :|: x5 = 0
4.62/1.96	
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(5) IntTRSCompressionProof (EQUIVALENT)
4.62/1.96	Compressed rules.
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(6)
4.62/1.96	Obligation:
4.62/1.96	Rules:
4.62/1.96	f6(x9:0) -> f6(x9:0 + 1) :|: x9:0 < 255 && x3:0 < 0
4.62/1.96	f6(x) -> f6(x + 1) :|: x < 255 && x1 > 0
4.62/1.96	f6(x2) -> f6(x2 + 2) :|: x2 < 255
4.62/1.96	
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(7) PolynomialOrderProcessor (EQUIVALENT)
4.62/1.96	Found the following polynomial interpretation:
4.62/1.96	[f6(x)] = 254 - x
4.62/1.96	
4.62/1.96	The following rules are decreasing:
4.62/1.96	f6(x9:0) -> f6(x9:0 + 1) :|: x9:0 < 255 && x3:0 < 0
4.62/1.96	f6(x) -> f6(x + 1) :|: x < 255 && x1 > 0
4.62/1.96	f6(x2) -> f6(x2 + 2) :|: x2 < 255
4.62/1.96	The following rules are bounded:
4.62/1.96	f6(x9:0) -> f6(x9:0 + 1) :|: x9:0 < 255 && x3:0 < 0
4.62/1.96	f6(x) -> f6(x + 1) :|: x < 255 && x1 > 0
4.62/1.96	f6(x2) -> f6(x2 + 2) :|: x2 < 255
4.62/1.96	
4.62/1.96	----------------------------------------
4.62/1.96	
4.62/1.96	(8)
4.62/1.96	YES
4.87/1.99	EOF