9.53/3.59	YES
9.53/3.61	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
9.53/3.61	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.53/3.61	
9.53/3.61	
9.53/3.61	Termination of the given C Problem could be proven:
9.53/3.61	
9.53/3.61	(0) C Problem
9.53/3.61	(1) CToLLVMProof [EQUIVALENT, 173 ms]
9.53/3.61	(2) LLVM problem
9.53/3.61	(3) LLVMToTerminationGraphProof [EQUIVALENT, 1189 ms]
9.53/3.61	(4) LLVM Symbolic Execution Graph
9.53/3.61	(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
9.53/3.61	(6) LLVM Symbolic Execution SCC
9.53/3.61	(7) SCC2IRS [SOUND, 43 ms]
9.53/3.61	(8) IntTRS
9.53/3.61	(9) PolynomialOrderProcessor [EQUIVALENT, 9 ms]
9.53/3.61	(10) YES
9.53/3.61	
9.53/3.61	
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(0)
9.53/3.61	Obligation:
9.53/3.61	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(1) CToLLVMProof (EQUIVALENT)
9.53/3.61	Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM.
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(2)
9.53/3.61	Obligation:
9.53/3.61	LLVM Problem
9.53/3.61	
9.53/3.61	Aliases:
9.53/3.61	
9.53/3.61	Data layout:
9.53/3.61	
9.53/3.61	"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"
9.53/3.61	
9.53/3.61	Machine:
9.53/3.61	
9.53/3.61	"x86_64-pc-linux-gnu"
9.53/3.61	
9.53/3.61	Type definitions:
9.53/3.61	
9.53/3.61	Global variables:
9.53/3.61	
9.53/3.61	Function declarations and definitions:
9.53/3.61	
9.53/3.61	*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
9.53/3.61	*BasicFunctionTypename: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
9.53/3.61		0:
9.53/3.61			%1 = alloca i32, align 4
9.53/3.61			%2 = alloca i32, align 4
9.53/3.61			%c = alloca i32, align 4
9.53/3.61			store %x, %1
9.53/3.61			store %y, %2
9.53/3.61			store 0, %c
9.53/3.61			br %3
9.53/3.61		3:
9.53/3.61			%4 = load %1
9.53/3.61			%5 = load %2
9.53/3.61			%6 = add %5 1
9.53/3.61			%7 = icmp sge %4 %6
9.53/3.61			br %7, %8, %13
9.53/3.61		8:
9.53/3.61			%9 = load %2
9.53/3.61			%10 = add %9 1
9.53/3.61			store %10, %2
9.53/3.61			%11 = load %c
9.53/3.61			%12 = add %11 1
9.53/3.61			store %12, %c
9.53/3.61			br %3
9.53/3.61		13:
9.53/3.61			%14 = load %c
9.53/3.61			ret %14
9.53/3.61	
9.53/3.61	*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
9.53/3.61		0:
9.53/3.61			%1 = alloca i32, align 4
9.53/3.61			store 0, %1
9.53/3.61			%2 = call i32 @__VERIFIER_nondet_int()
9.53/3.61			%3 = call i32 @__VERIFIER_nondet_int()
9.53/3.61			%4 = call i32 @test_fun(i32 %2, i32 %3)
9.53/3.61			ret %4
9.53/3.61	
9.53/3.61	
9.53/3.61	Analyze Termination of all function calls matching the pattern:
9.53/3.61	main()
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(3) LLVMToTerminationGraphProof (EQUIVALENT)
9.53/3.61	Constructed symbolic execution graph for LLVM program and proved memory safety.
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(4)
9.53/3.61	Obligation:
9.53/3.61	SE Graph
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(5) SymbolicExecutionGraphToSCCProof (SOUND)
9.53/3.61	Splitted symbolic execution graph to 1 SCC.
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(6)
9.53/3.61	Obligation:
9.53/3.61	SCC
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(7) SCC2IRS (SOUND)
9.53/3.61	Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
9.53/3.61	Generated rules. Obtained 14 rulesP rules:
9.53/3.61	f_211(v97, v98, v99, v100, v101, v102, v103, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_212(v97, v98, v99, v100, v101, v103, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0
9.53/3.61	f_212(v97, v98, v99, v100, v101, v103, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_213(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: v113 = 1 + v103
9.53/3.61	f_213(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_214(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: v113 <= v97
9.53/3.61	f_214(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_216(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0
9.53/3.61	f_216(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_218(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: TRUE
9.53/3.61	f_218(v97, v98, v99, v100, v101, v103, v113, 1, v102, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_220(v97, v98, v99, v100, v101, v103, v113, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0
9.53/3.61	f_220(v97, v98, v99, v100, v101, v103, v113, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_222(v97, v98, v99, v100, v101, v103, v113, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: v113 = 1 + v103
9.53/3.61	f_222(v97, v98, v99, v100, v101, v103, v113, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_224(v97, v98, v99, v100, v101, v103, v113, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: TRUE
9.53/3.61	f_224(v97, v98, v99, v100, v101, v103, v113, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_225(v97, v98, v99, v100, v101, v103, v113, 1, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0
9.53/3.61	f_225(v97, v98, v99, v100, v101, v103, v113, 1, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_226(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) :|: v115 = 1 + v106 && 2 <= v115
9.53/3.61	f_226(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) -> f_227(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) :|: TRUE
9.53/3.61	f_227(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) -> f_228(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) :|: TRUE
9.53/3.61	f_228(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4, 2) -> f_210(v97, v98, v99, v100, v101, v103, v113, 1, v106, v115, v107, v108, v109, v110, v111, 0, 3, 4) :|: TRUE
9.53/3.61	f_210(v97, v98, v99, v100, v101, v102, v103, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) -> f_211(v97, v98, v99, v100, v101, v102, v103, 1, v105, v106, v107, v108, v109, v110, v111, 0, 3, 4) :|: 0 = 0
9.53/3.61	Combined rules. Obtained 1 rulesP rules:
9.53/3.61	f_211(v97:0, v98:0, v99:0, v100:0, v101:0, v102:0, v103:0, 1, v105:0, v106:0, v107:0, v108:0, v109:0, v110:0, v111:0, 0, 3, 4) -> f_211(v97:0, v98:0, v99:0, v100:0, v101:0, v103:0, 1 + v103:0, 1, v106:0, 1 + v106:0, v107:0, v108:0, v109:0, v110:0, v111:0, 0, 3, 4) :|: v106:0 > 0 && v97:0 >= 1 + v103:0
9.53/3.61	Filtered unneeded arguments:
9.53/3.61	   f_211(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_211(x1, x7, x10)
9.53/3.61	Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
9.53/3.61	f_211(v97:0, v103:0, v106:0) -> f_211(v97:0, 1 + v103:0, 1 + v106:0) :|: v106:0 > 0 && v97:0 >= 1 + v103:0
9.53/3.61	
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(8)
9.53/3.61	Obligation:
9.53/3.61	Rules:
9.53/3.61	f_211(v97:0, v103:0, v106:0) -> f_211(v97:0, 1 + v103:0, 1 + v106:0) :|: v106:0 > 0 && v97:0 >= 1 + v103:0
9.53/3.61	
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(9) PolynomialOrderProcessor (EQUIVALENT)
9.53/3.61	Found the following polynomial interpretation:
9.53/3.61	[f_211(x, x1, x2)] = -1 + x - x1
9.53/3.61	
9.53/3.61	The following rules are decreasing:
9.53/3.61	f_211(v97:0, v103:0, v106:0) -> f_211(v97:0, 1 + v103:0, 1 + v106:0) :|: v106:0 > 0 && v97:0 >= 1 + v103:0
9.53/3.61	The following rules are bounded:
9.53/3.61	f_211(v97:0, v103:0, v106:0) -> f_211(v97:0, 1 + v103:0, 1 + v106:0) :|: v106:0 > 0 && v97:0 >= 1 + v103:0
9.53/3.61	
9.53/3.61	----------------------------------------
9.53/3.61	
9.53/3.61	(10)
9.53/3.61	YES
9.83/3.64	EOF