10.03/3.60	YES
10.03/3.60	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
10.03/3.60	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.03/3.60	
10.03/3.60	
10.03/3.60	Termination of the given C Problem could be proven:
10.03/3.60	
10.03/3.60	(0) C Problem
10.03/3.60	(1) CToLLVMProof [EQUIVALENT, 175 ms]
10.03/3.60	(2) LLVM problem
10.03/3.60	(3) LLVMToTerminationGraphProof [EQUIVALENT, 999 ms]
10.03/3.60	(4) LLVM Symbolic Execution Graph
10.03/3.60	(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
10.03/3.60	(6) LLVM Symbolic Execution SCC
10.03/3.60	(7) SCC2IRS [SOUND, 63 ms]
10.03/3.60	(8) IntTRS
10.03/3.60	(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
10.03/3.60	(10) IntTRS
10.03/3.60	(11) RankingReductionPairProof [EQUIVALENT, 171 ms]
10.03/3.60	(12) YES
10.03/3.60	
10.03/3.60	
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(0)
10.03/3.60	Obligation:
10.03/3.60	c file /export/starexec/sandbox/benchmark/theBenchmark.c
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(1) CToLLVMProof (EQUIVALENT)
10.03/3.60	Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM.
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(2)
10.03/3.60	Obligation:
10.03/3.60	LLVM Problem
10.03/3.60	
10.03/3.60	Aliases:
10.03/3.60	
10.03/3.60	Data layout:
10.03/3.60	
10.03/3.60	"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"
10.03/3.60	
10.03/3.60	Machine:
10.03/3.60	
10.03/3.60	"x86_64-pc-linux-gnu"
10.03/3.60	
10.03/3.60	Type definitions:
10.03/3.60	
10.03/3.60	Global variables:
10.03/3.60	
10.03/3.60	Function declarations and definitions:
10.03/3.60	
10.03/3.60	*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
10.03/3.60	*BasicFunctionTypename: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
10.03/3.60		0:
10.03/3.60			%1 = alloca i32, align 4
10.03/3.60			%c = alloca i32, align 4
10.03/3.60			store %x, %1
10.03/3.60			store 0, %c
10.03/3.60			br %2
10.03/3.60		2:
10.03/3.60			%3 = load %1
10.03/3.60			%4 = icmp sgt %3 1
10.03/3.60			br %4, %5, %8
10.03/3.60		5:
10.03/3.60			%6 = load %1
10.03/3.60			%7 = icmp slt %6 100
10.03/3.60			br %8
10.03/3.60		8:
10.03/3.60			%9 = phi [0, %2], [%7, %5]
10.03/3.60			br %9, %10, %16
10.03/3.60		10:
10.03/3.60			%11 = load %1
10.03/3.60			%12 = load %1
10.03/3.60			%13 = mul %11 %12
10.03/3.60			store %13, %1
10.03/3.60			%14 = load %c
10.03/3.60			%15 = add %14 1
10.03/3.60			store %15, %c
10.03/3.60			br %2
10.03/3.60		16:
10.03/3.60			%17 = load %c
10.03/3.60			ret %17
10.03/3.60	
10.03/3.60	*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
10.03/3.60		0:
10.03/3.60			%1 = alloca i32, align 4
10.03/3.60			store 0, %1
10.03/3.60			%2 = call i32 @__VERIFIER_nondet_int()
10.03/3.60			%3 = call i32 @test_fun(i32 %2)
10.03/3.60			ret %3
10.03/3.60	
10.03/3.60	
10.03/3.60	Analyze Termination of all function calls matching the pattern:
10.03/3.60	main()
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(3) LLVMToTerminationGraphProof (EQUIVALENT)
10.03/3.60	Constructed symbolic execution graph for LLVM program and proved memory safety.
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(4)
10.03/3.60	Obligation:
10.03/3.60	SE Graph
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(5) SymbolicExecutionGraphToSCCProof (SOUND)
10.03/3.60	Splitted symbolic execution graph to 1 SCC.
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(6)
10.03/3.60	Obligation:
10.03/3.60	SCC
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(7) SCC2IRS (SOUND)
10.03/3.60	Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
10.03/3.60	Generated rules. Obtained 18 rulesP rules:
10.03/3.60	f_277(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_278(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 1 < v219
10.03/3.60	f_278(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_280(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_280(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_282(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE
10.03/3.60	f_282(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_284(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_284(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_286(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: v219 < 100
10.03/3.60	f_286(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_289(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_289(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_292(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_292(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_294(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE
10.03/3.60	f_294(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_296(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_296(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_298(v214, v215, v216, v219, 1, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_298(v214, v215, v216, v219, 1, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_300(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: v249 = v219 * v219
10.03/3.60	f_300(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_301(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE
10.03/3.60	f_301(v214, v215, v216, v219, 1, v249, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_302(v214, v215, v216, v219, 1, v249, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	f_302(v214, v215, v216, v219, 1, v249, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_303(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: v251 = 1 + v221 && 2 <= v251
10.03/3.60	f_303(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_304(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE
10.03/3.60	f_304(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_305(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE
10.03/3.60	f_305(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_276(v214, v215, v216, v219, 1, v249, v221, v251, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: TRUE
10.03/3.60	f_276(v214, v215, v216, v217, 1, v219, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) -> f_277(v214, v215, v216, v219, 1, v217, v220, v221, v222, v223, v224, v225, 0, 3, 2, 99, 4) :|: 0 = 0
10.03/3.60	Combined rules. Obtained 1 rulesP rules:
10.03/3.60	f_277(v214:0, v215:0, v216:0, v219:0, 1, v217:0, v220:0, v221:0, v222:0, v223:0, v224:0, v225:0, 0, 3, 2, 99, 4) -> f_277(v214:0, v215:0, v216:0, v219:0 * v219:0, 1, v219:0, v221:0, 1 + v221:0, v222:0, v223:0, v224:0, v225:0, 0, 3, 2, 99, 4) :|: v219:0 > 1 && v221:0 > 0 && v219:0 < 100
10.03/3.60	Filtered unneeded arguments:
10.03/3.60	   f_277(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_277(x4, x8)
10.03/3.60	Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
10.03/3.60	f_277(v219:0, v221:0) -> f_277(v219:0 * v219:0, 1 + v221:0) :|: v221:0 > 0 && v219:0 < 100 && v219:0 > 1
10.03/3.60	
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(8)
10.03/3.60	Obligation:
10.03/3.60	Rules:
10.03/3.60	f_277(v219:0, v221:0) -> f_277(v219:0 * v219:0, 1 + v221:0) :|: v221:0 > 0 && v219:0 < 100 && v219:0 > 1
10.03/3.60	
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(9) IntTRSCompressionProof (EQUIVALENT)
10.03/3.60	Compressed rules.
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(10)
10.03/3.60	Obligation:
10.03/3.60	Rules:
10.03/3.60	f_277(v219:0:0, v221:0:0) -> f_277(v219:0:0 * v219:0:0, 1 + v221:0:0) :|: v221:0:0 > 0 && v219:0:0 < 100 && v219:0:0 > 1
10.03/3.60	
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(11) RankingReductionPairProof (EQUIVALENT)
10.03/3.60	Interpretation:
10.03/3.60	[ f_277 ] = -1/2*f_277_1
10.03/3.60	
10.03/3.60	The following rules are decreasing:
10.03/3.60	f_277(v219:0:0, v221:0:0) -> f_277(v219:0:0 * v219:0:0, 1 + v221:0:0) :|: v221:0:0 > 0 && v219:0:0 < 100 && v219:0:0 > 1
10.03/3.60	
10.03/3.60	The following rules are bounded:
10.03/3.60	f_277(v219:0:0, v221:0:0) -> f_277(v219:0:0 * v219:0:0, 1 + v221:0:0) :|: v221:0:0 > 0 && v219:0:0 < 100 && v219:0:0 > 1
10.03/3.60	
10.03/3.60	
10.03/3.60	----------------------------------------
10.03/3.60	
10.03/3.60	(12)
10.03/3.60	YES
10.39/3.66	EOF