6.59/2.41	YES
6.64/2.42	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
6.64/2.42	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.64/2.42	
6.64/2.42	
6.64/2.42	Termination of the given C Problem could be proven:
6.64/2.42	
6.64/2.42	(0) C Problem
6.64/2.42	(1) CToIRSProof [EQUIVALENT, 0 ms]
6.64/2.42	(2) IntTRS
6.64/2.42	(3) TerminationGraphProcessor [SOUND, 55 ms]
6.64/2.42	(4) IntTRS
6.64/2.42	(5) IntTRSCompressionProof [EQUIVALENT, 30 ms]
6.64/2.42	(6) IntTRS
6.64/2.42	(7) PolynomialOrderProcessor [EQUIVALENT, 9 ms]
6.64/2.42	(8) IntTRS
6.64/2.42	(9) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
6.64/2.42	(10) YES
6.64/2.42	
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(0)
6.64/2.42	Obligation:
6.64/2.42	c file /export/starexec/sandbox/benchmark/theBenchmark.c
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(1) CToIRSProof (EQUIVALENT)
6.64/2.42	Parsed C Integer Program as IRS.
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(2)
6.64/2.42	Obligation:
6.64/2.42	Rules:
6.64/2.42	f1(y, z) -> f2(x_1, z) :|: TRUE
6.64/2.42	f2(x, x1) -> f3(x, x2) :|: TRUE
6.64/2.42	f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - 1
6.64/2.42	f6(x5, x6) -> f9(x5, x7) :|: TRUE
6.64/2.42	f7(x24, x25) -> f10(x24, x26) :|: TRUE && x26 = x25 - 1
6.64/2.42	f5(x10, x11) -> f6(x10, x11) :|: x10 >= 0
6.64/2.42	f5(x12, x13) -> f7(x12, x13) :|: x12 < 0
6.64/2.42	f9(x14, x15) -> f8(x14, x15) :|: TRUE
6.64/2.42	f10(x16, x17) -> f8(x16, x17) :|: TRUE
6.64/2.42	f3(x18, x19) -> f4(x18, x19) :|: x19 >= 0
6.64/2.42	f8(x20, x21) -> f3(x20, x21) :|: TRUE
6.64/2.42	f3(x22, x23) -> f11(x22, x23) :|: x23 < 0
6.64/2.42	Start term: f1(y, z)
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(3) TerminationGraphProcessor (SOUND)
6.64/2.42	Constructed the termination graph and obtained one non-trivial SCC.
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(4)
6.64/2.42	Obligation:
6.64/2.42	Rules:
6.64/2.42	f3(x18, x19) -> f4(x18, x19) :|: x19 >= 0
6.64/2.42	f8(x20, x21) -> f3(x20, x21) :|: TRUE
6.64/2.42	f9(x14, x15) -> f8(x14, x15) :|: TRUE
6.64/2.42	f6(x5, x6) -> f9(x5, x7) :|: TRUE
6.64/2.42	f5(x10, x11) -> f6(x10, x11) :|: x10 >= 0
6.64/2.42	f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - 1
6.64/2.42	f10(x16, x17) -> f8(x16, x17) :|: TRUE
6.64/2.42	f7(x24, x25) -> f10(x24, x26) :|: TRUE && x26 = x25 - 1
6.64/2.42	f5(x12, x13) -> f7(x12, x13) :|: x12 < 0
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(5) IntTRSCompressionProof (EQUIVALENT)
6.64/2.42	Compressed rules.
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(6)
6.64/2.42	Obligation:
6.64/2.42	Rules:
6.64/2.42	f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 - 1) :|: x12:0 < 0 && x13:0 > 0
6.64/2.42	f5(x10:0, x11:0) -> f5(x10:0 - 1, x7:0) :|: x10:0 > -1 && x7:0 > -1
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(7) PolynomialOrderProcessor (EQUIVALENT)
6.64/2.42	Found the following polynomial interpretation:
6.64/2.42	[f5(x, x1)] = x
6.64/2.42	
6.64/2.42	The following rules are decreasing:
6.64/2.42	f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 - 1) :|: x12:0 < 0 && x13:0 > 0
6.64/2.42	f5(x10:0, x11:0) -> f5(x10:0 - 1, x7:0) :|: x10:0 > -1 && x7:0 > -1
6.64/2.42	The following rules are bounded:
6.64/2.42	f5(x10:0, x11:0) -> f5(x10:0 - 1, x7:0) :|: x10:0 > -1 && x7:0 > -1
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(8)
6.64/2.42	Obligation:
6.64/2.42	Rules:
6.64/2.42	f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 - 1) :|: x12:0 < 0 && x13:0 > 0
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(9) PolynomialOrderProcessor (EQUIVALENT)
6.64/2.42	Found the following polynomial interpretation:
6.64/2.42	[f5(x, x1)] = x1
6.64/2.42	
6.64/2.42	The following rules are decreasing:
6.64/2.42	f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 - 1) :|: x12:0 < 0 && x13:0 > 0
6.64/2.42	The following rules are bounded:
6.64/2.42	f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 - 1) :|: x12:0 < 0 && x13:0 > 0
6.64/2.42	
6.64/2.42	----------------------------------------
6.64/2.42	
6.64/2.42	(10)
6.64/2.42	YES
6.64/2.46	EOF