11.39/4.03	YES
11.61/4.11	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
11.61/4.11	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.61/4.11	
11.61/4.11	
11.61/4.11	Termination of the given C Problem could be proven:
11.61/4.11	
11.61/4.11	(0) C Problem
11.61/4.11	(1) CToLLVMProof [EQUIVALENT, 175 ms]
11.61/4.11	(2) LLVM problem
11.61/4.11	(3) LLVMToTerminationGraphProof [EQUIVALENT, 1169 ms]
11.61/4.11	(4) LLVM Symbolic Execution Graph
11.61/4.11	(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
11.61/4.11	(6) AND
11.61/4.11	    (7) LLVM Symbolic Execution SCC
11.61/4.11	        (8) SCC2IRS [SOUND, 12 ms]
11.61/4.11	        (9) IntTRS
11.61/4.11	        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
11.61/4.11	        (11) IntTRS
11.61/4.11	        (12) PolynomialOrderProcessor [EQUIVALENT, 12 ms]
11.61/4.11	        (13) YES
11.61/4.11	    (14) LLVM Symbolic Execution SCC
11.61/4.11	        (15) SCC2IRS [SOUND, 5 ms]
11.61/4.11	        (16) IntTRS
11.61/4.11	        (17) IntTRSCompressionProof [EQUIVALENT, 0 ms]
11.61/4.11	        (18) IntTRS
11.61/4.11	        (19) RankingReductionPairProof [EQUIVALENT, 0 ms]
11.61/4.11	        (20) YES
11.61/4.11	
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(0)
11.61/4.11	Obligation:
11.61/4.11	c file /export/starexec/sandbox/benchmark/theBenchmark.c
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(1) CToLLVMProof (EQUIVALENT)
11.61/4.11	Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM.
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(2)
11.61/4.11	Obligation:
11.61/4.11	LLVM Problem
11.61/4.11	
11.61/4.11	Aliases:
11.61/4.11	
11.61/4.11	Data layout:
11.61/4.11	
11.61/4.11	"e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
11.61/4.11	
11.61/4.11	Machine:
11.61/4.11	
11.61/4.11	"x86_64-pc-linux-gnu"
11.61/4.11	
11.61/4.11	Type definitions:
11.61/4.11	
11.61/4.11	Global variables:
11.61/4.11	
11.61/4.11	Function declarations and definitions:
11.61/4.11	
11.61/4.11	*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
11.61/4.11		0:
11.61/4.11			%1 = alloca i32, align 4
11.61/4.11			%x = alloca i32, align 4
11.61/4.11			%y = alloca i32, align 4
11.61/4.11			store 0, %1
11.61/4.11			store 0, %x
11.61/4.11			store 0, %y
11.61/4.11			br %2
11.61/4.11		2:
11.61/4.11			%3 = load %x
11.61/4.11			%4 = icmp sle %3 50
11.61/4.11			br %4, %5, %8
11.61/4.11		5:
11.61/4.11			%6 = load %y
11.61/4.11			%7 = add %6 1
11.61/4.11			store %7, %y
11.61/4.11			br %11
11.61/4.11		8:
11.61/4.11			%9 = load %y
11.61/4.11			%10 = add %9 -1
11.61/4.11			store %10, %y
11.61/4.11			br %11
11.61/4.11		11:
11.61/4.11			%12 = load %y
11.61/4.11			%13 = icmp slt %12 0
11.61/4.11			br %13, %14, %15
11.61/4.11		14:
11.61/4.11			br %18
11.61/4.11		15:
11.61/4.11			%16 = load %x
11.61/4.11			%17 = add %16 1
11.61/4.11			store %17, %x
11.61/4.11			br %2
11.61/4.11		18:
11.61/4.11			ret 0
11.61/4.11	
11.61/4.11	
11.61/4.11	Analyze Termination of all function calls matching the pattern:
11.61/4.11	main()
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(3) LLVMToTerminationGraphProof (EQUIVALENT)
11.61/4.11	Constructed symbolic execution graph for LLVM program and proved memory safety.
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(4)
11.61/4.11	Obligation:
11.61/4.11	SE Graph
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(5) SymbolicExecutionGraphToSCCProof (SOUND)
11.61/4.11	Splitted symbolic execution graph to 2 SCCs.
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(6)
11.61/4.11	Complex Obligation (AND)
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(7)
11.61/4.11	Obligation:
11.61/4.11	SCC
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(8) SCC2IRS (SOUND)
11.61/4.11	Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
11.61/4.11	Generated rules. Obtained 16 rulesP rules:
11.61/4.11	f_305(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) -> f_307(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) :|: 0 <= v246 && 1 <= v244
11.61/4.11	f_307(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) -> f_309(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) :|: 0 = 0
11.61/4.11	f_309(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) -> f_311(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) :|: TRUE
11.61/4.11	f_311(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) -> f_313(v237, v238, v239, v240, 0, 50, 51, v246, v244, v247, v248, v249, 3, 1, 4) :|: 0 = 0
11.61/4.11	f_313(v237, v238, v239, v240, 0, 50, 51, v246, v244, v247, v248, v249, 3, 1, 4) -> f_314(v237, v238, v239, v240, 0, 50, 51, v246, v253, v244, v247, v248, v249, 3, 1, 4, 52) :|: v253 = 1 + v240 && 52 <= v253
11.61/4.11	f_314(v237, v238, v239, v240, 0, 50, 51, v246, v253, v244, v247, v248, v249, 3, 1, 4, 52) -> f_315(v237, v238, v239, v240, 0, 50, 51, v246, v253, v244, v247, v248, v249, 3, 1, 4, 52) :|: TRUE
11.61/4.11	f_315(v237, v238, v239, v240, 0, 50, 51, v246, v253, v244, v247, v248, v249, 3, 1, 4, 52) -> f_316(v237, v238, v239, v240, 0, 50, 51, v246, v253, v244, v247, v248, v249, 3, 1, 4, 52) :|: TRUE
11.61/4.11	f_316(v237, v238, v239, v240, 0, 50, 51, v246, v253, v244, v247, v248, v249, 3, 1, 4, 52) -> f_317(v237, v238, v239, v253, 0, 50, 51, v246, v240, v244, v247, v248, v249, 3, 1, 4, 52) :|: 0 = 0
11.61/4.11	f_317(v237, v238, v239, v253, 0, 50, 51, v246, v240, v244, v247, v248, v249, 3, 1, 4, 52) -> f_318(v237, v238, v239, v253, 0, 50, 51, v246, v240, v244, v247, v248, v249, 3, 1, 4, 52) :|: 0 = 0
11.61/4.11	f_318(v237, v238, v239, v253, 0, 50, 51, v246, v240, v244, v247, v248, v249, 3, 1, 4, 52) -> f_319(v237, v238, v239, v253, 0, 50, 51, v246, v240, v244, v247, v248, v249, 3, 1, 4, 52) :|: TRUE
11.61/4.11	f_319(v237, v238, v239, v253, 0, 50, 51, v246, v240, v244, v247, v248, v249, 3, 1, 4, 52) -> f_320(v237, v238, v239, v253, 0, 50, 51, v246, v240, v247, v248, v249, 3, 1, 4, 52) :|: 0 = 0
11.61/4.11	f_320(v237, v238, v239, v253, 0, 50, 51, v246, v240, v247, v248, v249, 3, 1, 4, 52) -> f_321(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4, 52, 49) :|: 1 + v261 = v246 && 0 <= 1 + v261 && v261 <= 49
11.61/4.11	f_321(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4, 52, 49) -> f_322(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4, 52, 49) :|: TRUE
11.61/4.11	f_322(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4, 52, 49) -> f_323(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4, 52, 49) :|: TRUE
11.61/4.11	f_323(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4, 52, 49) -> f_304(v237, v238, v239, v253, 0, 50, 51, v246, v240, v261, v247, v248, v249, 3, 1, 4) :|: TRUE
11.61/4.11	f_304(v237, v238, v239, v240, 0, 50, 51, v244, v245, v246, v247, v248, v249, 3, 1, 4) -> f_305(v237, v238, v239, v240, 0, 50, 51, v246, v245, v244, v247, v248, v249, 3, 1, 4) :|: 0 = 0
11.61/4.11	Combined rules. Obtained 1 rulesP rules:
11.61/4.11	f_305(v237:0, v238:0, v239:0, v240:0, 0, 50, 51, 1 + v261:0, v245:0, v244:0, v247:0, v248:0, v249:0, 3, 1, 4) -> f_305(v237:0, v238:0, v239:0, 1 + v240:0, 0, 50, 51, v261:0, v240:0, 1 + v261:0, v247:0, v248:0, v249:0, 3, 1, 4) :|: v244:0 > 0 && v261:0 > -2 && v240:0 > 50 && v261:0 < 50
11.61/4.11	Filtered unneeded arguments:
11.61/4.11	   f_305(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_305(x4, x8, x10)
11.61/4.11	Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
11.61/4.11	f_305(v240:0, sum~cons_1~v261:0, v244:0) -> f_305(1 + v240:0, v261:0, 1 + v261:0) :|: v261:0 > -2 && v244:0 > 0 && v261:0 < 50 && v240:0 > 50 && sum~cons_1~v261:0 = 1 + v261:0
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(9)
11.61/4.11	Obligation:
11.61/4.11	Rules:
11.61/4.11	f_305(v240:0, sum~cons_1~v261:0, v244:0) -> f_305(1 + v240:0, v261:0, 1 + v261:0) :|: v261:0 > -2 && v244:0 > 0 && v261:0 < 50 && v240:0 > 50 && sum~cons_1~v261:0 = 1 + v261:0
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(10) IntTRSCompressionProof (EQUIVALENT)
11.61/4.11	Compressed rules.
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(11)
11.61/4.11	Obligation:
11.61/4.11	Rules:
11.61/4.11	f_305(v240:0:0, sum~cons_1~v261:0:0, v244:0:0) -> f_305(1 + v240:0:0, v261:0:0, 1 + v261:0:0) :|: v261:0:0 < 50 && v240:0:0 > 50 && v244:0:0 > 0 && v261:0:0 > -2 && sum~cons_1~v261:0:0 = 1 + v261:0:0
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(12) PolynomialOrderProcessor (EQUIVALENT)
11.61/4.11	Found the following polynomial interpretation:
11.61/4.11	[f_305(x, x1, x2)] = x1
11.61/4.11	
11.61/4.11	The following rules are decreasing:
11.61/4.11	f_305(v240:0:0, sum~cons_1~v261:0:0, v244:0:0) -> f_305(1 + v240:0:0, v261:0:0, 1 + v261:0:0) :|: v261:0:0 < 50 && v240:0:0 > 50 && v244:0:0 > 0 && v261:0:0 > -2 && sum~cons_1~v261:0:0 = 1 + v261:0:0
11.61/4.11	The following rules are bounded:
11.61/4.11	f_305(v240:0:0, sum~cons_1~v261:0:0, v244:0:0) -> f_305(1 + v240:0:0, v261:0:0, 1 + v261:0:0) :|: v261:0:0 < 50 && v240:0:0 > 50 && v244:0:0 > 0 && v261:0:0 > -2 && sum~cons_1~v261:0:0 = 1 + v261:0:0
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(13)
11.61/4.11	YES
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(14)
11.61/4.11	Obligation:
11.61/4.11	SCC
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(15) SCC2IRS (SOUND)
11.61/4.11	Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
11.61/4.11	Generated rules. Obtained 16 rulesP rules:
11.61/4.11	f_208(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 50, 51, 4) -> f_209(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 49, 50, 4) :|: v76 <= 50 && v74 <= 49
11.61/4.11	f_209(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 49, 50, 4) -> f_211(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 49, 50, 4) :|: 0 = 0
11.61/4.11	f_211(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 49, 50, 4) -> f_213(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 49, 50, 4) :|: TRUE
11.61/4.11	f_213(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 49, 50, 4) -> f_215(v71, v72, v73, v76, 1, 0, v74, v78, v79, v80, 3, 49, 50, 4) :|: 0 = 0
11.61/4.11	f_215(v71, v72, v73, v76, 1, 0, v74, v78, v79, v80, 3, 49, 50, 4) -> f_217(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) :|: v81 = 1 + v76 && 2 <= v81 && v81 <= 51
11.61/4.11	f_217(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) -> f_219(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) :|: TRUE
11.61/4.11	f_219(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) -> f_221(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) :|: TRUE
11.61/4.11	f_221(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) -> f_223(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) :|: 0 = 0
11.61/4.11	f_223(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) -> f_225(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) :|: 0 = 0
11.61/4.11	f_225(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) -> f_227(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) :|: TRUE
11.61/4.11	f_227(v71, v72, v73, v76, 1, v81, 0, v74, v78, v79, v80, 3, 49, 50, 4, 2, 51) -> f_229(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) :|: 0 = 0
11.61/4.11	f_229(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) -> f_231(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) :|: v81 = 1 + v76
11.61/4.11	f_231(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) -> f_233(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) :|: TRUE
11.61/4.11	f_233(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) -> f_235(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) :|: TRUE
11.61/4.11	f_235(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 4, 2, 51) -> f_207(v71, v72, v73, v76, 1, v81, 0, v78, v79, v80, 3, 50, 51, 4) :|: TRUE
11.61/4.11	f_207(v71, v72, v73, v74, 1, v76, 0, v78, v79, v80, 3, 50, 51, 4) -> f_208(v71, v72, v73, v76, 1, v74, 0, v78, v79, v80, 3, 50, 51, 4) :|: 0 = 0
11.61/4.11	Combined rules. Obtained 1 rulesP rules:
11.61/4.11	f_208(v71:0, v72:0, v73:0, v76:0, 1, v74:0, 0, v78:0, v79:0, v80:0, 3, 50, 51, 4) -> f_208(v71:0, v72:0, v73:0, 1 + v76:0, 1, v76:0, 0, v78:0, v79:0, v80:0, 3, 50, 51, 4) :|: v74:0 < 50 && v76:0 < 51 && v76:0 > 0
11.61/4.11	Filtered unneeded arguments:
11.61/4.11	   f_208(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_208(x4, x6)
11.61/4.11	Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
11.61/4.11	f_208(v76:0, v74:0) -> f_208(1 + v76:0, v76:0) :|: v76:0 < 51 && v76:0 > 0 && v74:0 < 50
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(16)
11.61/4.11	Obligation:
11.61/4.11	Rules:
11.61/4.11	f_208(v76:0, v74:0) -> f_208(1 + v76:0, v76:0) :|: v76:0 < 51 && v76:0 > 0 && v74:0 < 50
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(17) IntTRSCompressionProof (EQUIVALENT)
11.61/4.11	Compressed rules.
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(18)
11.61/4.11	Obligation:
11.61/4.11	Rules:
11.61/4.11	f_208(v76:0:0, v74:0:0) -> f_208(1 + v76:0:0, v76:0:0) :|: v76:0:0 < 51 && v76:0:0 > 0 && v74:0:0 < 50
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(19) RankingReductionPairProof (EQUIVALENT)
11.61/4.11	Interpretation:
11.61/4.11	[ f_208 ] = -1*f_208_1
11.61/4.11	
11.61/4.11	The following rules are decreasing:
11.61/4.11	f_208(v76:0:0, v74:0:0) -> f_208(1 + v76:0:0, v76:0:0) :|: v76:0:0 < 51 && v76:0:0 > 0 && v74:0:0 < 50
11.61/4.11	
11.61/4.11	The following rules are bounded:
11.61/4.11	f_208(v76:0:0, v74:0:0) -> f_208(1 + v76:0:0, v76:0:0) :|: v76:0:0 < 51 && v76:0:0 > 0 && v74:0:0 < 50
11.61/4.11	
11.61/4.11	
11.61/4.11	----------------------------------------
11.61/4.11	
11.61/4.11	(20)
11.61/4.11	YES
12.45/4.52	EOF