11.56/4.12	YES
11.56/4.14	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
11.56/4.14	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.56/4.14	
11.56/4.14	
11.56/4.14	Termination of the given C Problem could be proven:
11.56/4.14	
11.56/4.14	(0) C Problem
11.56/4.14	(1) CToLLVMProof [EQUIVALENT, 175 ms]
11.56/4.14	(2) LLVM problem
11.56/4.14	(3) LLVMToTerminationGraphProof [EQUIVALENT, 1629 ms]
11.56/4.14	(4) LLVM Symbolic Execution Graph
11.56/4.14	(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
11.56/4.14	(6) LLVM Symbolic Execution SCC
11.56/4.14	(7) SCC2IRS [SOUND, 44 ms]
11.56/4.14	(8) IntTRS
11.56/4.14	(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
11.56/4.14	(10) IntTRS
11.56/4.14	(11) RankingReductionPairProof [EQUIVALENT, 8 ms]
11.56/4.14	(12) YES
11.56/4.14	
11.56/4.14	
11.56/4.14	----------------------------------------
11.56/4.14	
11.56/4.14	(0)
11.56/4.14	Obligation:
11.56/4.14	c file /export/starexec/sandbox/benchmark/theBenchmark.c
11.56/4.14	----------------------------------------
11.56/4.14	
11.56/4.14	(1) CToLLVMProof (EQUIVALENT)
11.56/4.14	Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM.
11.56/4.14	----------------------------------------
11.56/4.14	
11.56/4.14	(2)
11.56/4.14	Obligation:
11.56/4.14	LLVM Problem
11.56/4.14	
11.56/4.14	Aliases:
11.56/4.14	
11.56/4.14	Data layout:
11.56/4.14	
11.56/4.14	"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.56/4.14	
11.56/4.14	Machine:
11.56/4.14	
11.56/4.14	"x86_64-pc-linux-gnu"
11.56/4.14	
11.56/4.14	Type definitions:
11.56/4.14	
11.56/4.14	Global variables:
11.56/4.14	
11.56/4.14	Function declarations and definitions:
11.56/4.14	
11.56/4.14	*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
11.56/4.14	*BasicFunctionTypename: "__VERIFIER_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc
11.56/4.14	*BasicFunctionTypename: "hanoi" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (n i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
11.56/4.14		0:
11.56/4.14			%1 = alloca i32, align 4
11.56/4.14			%2 = alloca i32, align 4
11.56/4.14			store %n, %2
11.56/4.14			%3 = load %2
11.56/4.14			%4 = icmp eq %3 1
11.56/4.14			br %4, %5, %6
11.56/4.14		5:
11.56/4.14			store 1, %1
11.56/4.14			br %12
11.56/4.14		6:
11.56/4.14			%7 = load %2
11.56/4.14			%8 = sub %7 1
11.56/4.14			%9 = call i32 @hanoi(i32 %8)
11.56/4.14			%10 = mul 2 %9
11.56/4.14			%11 = add %10 1
11.56/4.14			store %11, %1
11.56/4.14			br %12
11.56/4.14		12:
11.56/4.14			%13 = load %1
11.56/4.14			ret %13
11.56/4.14	
11.56/4.14	*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
11.66/4.14		0:
11.66/4.14			%1 = alloca i32, align 4
11.66/4.14			%n = alloca i32, align 4
11.66/4.14			%result = alloca i32, align 4
11.66/4.14			store 0, %1
11.66/4.14			%2 = call i32 @__VERIFIER_nondet_int()
11.66/4.14			store %2, %n
11.66/4.14			%3 = load %n
11.66/4.14			%4 = icmp slt %3 1
11.66/4.14			br %4, %8, %5
11.66/4.14		5:
11.66/4.14			%6 = load %n
11.66/4.14			%7 = icmp sgt %6 31
11.66/4.14			br %7, %8, %9
11.66/4.14		8:
11.66/4.14			store 0, %1
11.66/4.14			br %17
11.66/4.14		9:
11.66/4.14			%10 = load %n
11.66/4.14			%11 = call i32 @hanoi(i32 %10)
11.66/4.14			store %11, %result
11.66/4.14			%12 = load %result
11.66/4.14			%13 = icmp sge %12 0
11.66/4.14			br %13, %14, %15
11.66/4.14		14:
11.66/4.14			store 0, %1
11.66/4.14			br %17
11.66/4.14		15:
11.66/4.14			br %16
11.66/4.14		16:
11.66/4.14			Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error() noreturn
11.66/4.14			unreachable
11.66/4.14		17:
11.66/4.14			%18 = load %1
11.66/4.14			ret %18
11.66/4.14	
11.66/4.14	
11.66/4.14	Analyze Termination of all function calls matching the pattern:
11.66/4.14	main()
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(3) LLVMToTerminationGraphProof (EQUIVALENT)
11.66/4.14	Constructed symbolic execution graph for LLVM program and proved memory safety.
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(4)
11.66/4.14	Obligation:
11.66/4.14	SE Graph
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(5) SymbolicExecutionGraphToSCCProof (SOUND)
11.66/4.14	Splitted symbolic execution graph to 1 SCC.
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(6)
11.66/4.14	Obligation:
11.66/4.14	SCC
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(7) SCC2IRS (SOUND)
11.66/4.14	Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
11.66/4.14	Generated rules. Obtained 12 rulesP rules:
11.66/4.14	f_210(v51, v60, v52, v53, v54, v55, v56, v57, v61, 0, v59, 3, 1, 31, 4) -> f_212(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 1, 31, 4) :|: 1 <= v62 && v63 = 3 + v62 && 4 <= v63
11.66/4.14	f_212(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 1, 31, 4) -> f_213(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 1, 31, 4) :|: TRUE
11.66/4.14	f_213(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 1, 31, 4) -> f_214(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 1, 31, 4) :|: 0 = 0
11.66/4.14	f_214(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 1, 31, 4) -> f_216(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 2, 31, 1, 4) :|: v51 != 1 && 2 <= v51 && v51 <= 31 && 2 <= v59
11.66/4.14	f_216(v51, v60, v62, v52, v53, v54, v55, v56, v57, v61, v63, 0, v59, 3, 2, 31, 1, 4) -> f_218(v51, v60, v62, 0, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 2, 31, 1, 4) :|: 0 = 0
11.66/4.14	f_218(v51, v60, v62, 0, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 2, 31, 1, 4) -> f_220(v51, v60, v62, 0, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 2, 31, 1, 4) :|: TRUE
11.66/4.14	f_220(v51, v60, v62, 0, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 2, 31, 1, 4) -> f_222(v51, v60, v62, 0, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 2, 31, 1, 4) :|: 0 = 0
11.66/4.14	f_222(v51, v60, v62, 0, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 2, 31, 1, 4) -> f_224(v51, v60, v62, 0, v65, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 1, 2, 31, 4, 30) :|: 1 + v65 = v51 && 1 <= v65 && v65 <= 30
11.66/4.14	f_224(v51, v60, v62, 0, v65, v52, v53, v54, v55, v56, v57, v61, v63, v59, 3, 1, 2, 31, 4, 30) -> f_226(v65, v52, v53, v54, v55, v56, v57, v60, v61, v62, v63, 0, v59, v51, 3, 1, 2, 31, 4, 30) :|: 0 = 0
11.66/4.14	f_226(v65, v52, v53, v54, v55, v56, v57, v60, v61, v62, v63, 0, v59, v51, 3, 1, 2, 31, 4, 30) -> f_228(v65, v52, v53, v54, v55, v56, v57, v60, v61, v62, v63, 0, v59, v51, 3, 1, 2, 31, 4, 30) :|: TRUE
11.66/4.14	f_228(v65, v52, v53, v54, v55, v56, v57, v60, v61, v62, v63, 0, v59, v51, 3, 1, 2, 31, 4, 30) -> f_208(v65, v52, v53, v54, v55, v56, v57, 0, v59, 3, 1, 31, 4) :|: TRUE
11.66/4.14	f_208(v51, v52, v53, v54, v55, v56, v57, 0, v59, 3, 1, 31, 4) -> f_210(v51, v60, v52, v53, v54, v55, v56, v57, v61, 0, v59, 3, 1, 31, 4) :|: 1 <= v60 && v61 = 3 + v60 && 4 <= v61
11.66/4.14	Combined rules. Obtained 1 rulesP rules:
11.66/4.14	f_210(1 + v65:0, v60:0, v52:0, v53:0, v54:0, v55:0, v56:0, v57:0, v61:0, 0, v59:0, 3, 1, 31, 4) -> f_210(v65:0, v60:1, v52:0, v53:0, v54:0, v55:0, v56:0, v57:0, 3 + v60:1, 0, v59:0, 3, 1, 31, 4) :|: v62:0 > 0 && v65:0 > 0 && v65:0 < 31 && v59:0 > 1 && v60:1 > 0
11.66/4.14	Filtered unneeded arguments:
11.66/4.14	   f_210(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_210(x1, x11)
11.66/4.14	Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
11.66/4.14	f_210(sum~cons_1~v65:0, v59:0) -> f_210(v65:0, v59:0) :|: v65:0 < 31 && v59:0 > 1 && v65:0 > 0 && sum~cons_1~v65:0 = 1 + v65:0
11.66/4.14	
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(8)
11.66/4.14	Obligation:
11.66/4.14	Rules:
11.66/4.14	f_210(sum~cons_1~v65:0, v59:0) -> f_210(v65:0, v59:0) :|: v65:0 < 31 && v59:0 > 1 && v65:0 > 0 && sum~cons_1~v65:0 = 1 + v65:0
11.66/4.14	
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(9) IntTRSCompressionProof (EQUIVALENT)
11.66/4.14	Compressed rules.
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(10)
11.66/4.14	Obligation:
11.66/4.14	Rules:
11.66/4.14	f_210(sum~cons_1~v65:0:0, v59:0:0) -> f_210(v65:0:0, v59:0:0) :|: v65:0:0 < 31 && v59:0:0 > 1 && v65:0:0 > 0 && sum~cons_1~v65:0:0 = 1 + v65:0:0
11.66/4.14	
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(11) RankingReductionPairProof (EQUIVALENT)
11.66/4.14	Interpretation:
11.66/4.14	[ f_210 ] = f_210_1
11.66/4.14	
11.66/4.14	The following rules are decreasing:
11.66/4.14	f_210(sum~cons_1~v65:0:0, v59:0:0) -> f_210(v65:0:0, v59:0:0) :|: v65:0:0 < 31 && v59:0:0 > 1 && v65:0:0 > 0 && sum~cons_1~v65:0:0 = 1 + v65:0:0
11.66/4.14	
11.66/4.14	The following rules are bounded:
11.66/4.14	f_210(sum~cons_1~v65:0:0, v59:0:0) -> f_210(v65:0:0, v59:0:0) :|: v65:0:0 < 31 && v59:0:0 > 1 && v65:0:0 > 0 && sum~cons_1~v65:0:0 = 1 + v65:0:0
11.66/4.14	
11.66/4.14	
11.66/4.14	----------------------------------------
11.66/4.14	
11.66/4.14	(12)
11.66/4.14	YES
11.66/4.17	EOF