/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 176 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 4229 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 81 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 25 ms]
(12) YES


----------------------------------------

(0)
Obligation:
c file /export/starexec/sandbox2/benchmark/theBenchmark.c
----------------------------------------

(1) CToLLVMProof (EQUIVALENT)
Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM.
----------------------------------------

(2)
Obligation:
LLVM Problem

Aliases:

Data layout:

"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"

Machine:

"x86_64-pc-linux-gnu"

Type definitions:

Global variables:

Function declarations and definitions:

*BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "r1" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (ls i32, a i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%3 = alloca i32, align 4
		store %ls, %2
		store %a, %3
		%4 = load %2
		%5 = icmp eq %4 0
		br %5, %6, %8
	6:
		%7 = load %3
		store %7, %1
		br %16
	8:
		%9 = load %2
		%10 = sub %9 1
		%11 = load %2
		%12 = add %11 1
		%13 = load %3
		%14 = add %12 %13
		%15 = call i32 @r1(i32 %10, i32 %14)
		store %15, %1
		br %16
	16:
		%17 = load %1
		ret %17

*BasicFunctionTypename: "rev" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (ls i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		store %ls, %1
		%2 = load %1
		%3 = call i32 @r1(i32 %2, i32 0)
		ret %3

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%ls = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %ls
		%3 = load %ls
		%4 = icmp sge %3 0
		br %4, %5, %8
	5:
		%6 = load %ls
		%7 = call i32 @rev(i32 %6)
		br %8
	8:
		ret 0


Analyze Termination of all function calls matching the pattern:
main()
----------------------------------------

(3) LLVMToTerminationGraphProof (EQUIVALENT)
Constructed symbolic execution graph for LLVM program and proved memory safety.
----------------------------------------

(4)
Obligation:
SE Graph
----------------------------------------

(5) SymbolicExecutionGraphToSCCProof (SOUND)
Splitted symbolic execution graph to 1 SCC.
----------------------------------------

(6)
Obligation:
SCC
----------------------------------------

(7) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 18 rulesP rules:
f_200(v67, v68, v77, v69, v70, v71, v72, v73, v74, v78, 0, v76, 3, 1, 4) -> f_201(v67, v68, v77, v79, v69, v70, v71, v72, v73, v74, v78, v80, 0, v76, 3, 1, 4) :|: 1 <= v79 && v80 = 3 + v79 && 4 <= v80
f_201(v67, v68, v77, v79, v69, v70, v71, v72, v73, v74, v78, v80, 0, v76, 3, 1, 4) -> f_202(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) :|: 1 <= v81 && v82 = 3 + v81 && 4 <= v82
f_202(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) -> f_203(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) :|: TRUE
f_203(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) -> f_204(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) :|: TRUE
f_204(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) -> f_205(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) :|: 0 = 0
f_205(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) -> f_207(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) :|: v67 != 0 && 1 <= v76
f_207(v67, v68, v77, v79, v81, v69, v70, v71, v72, v73, v74, v78, v80, v82, 0, v76, 3, 1, 4) -> f_209(v67, v68, v77, v79, v81, 0, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) :|: 0 = 0
f_209(v67, v68, v77, v79, v81, 0, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) -> f_211(v67, v68, v77, v79, v81, 0, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) :|: TRUE
f_211(v67, v68, v77, v79, v81, 0, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) -> f_213(v67, v68, v77, v79, v81, 0, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) :|: 0 = 0
f_213(v67, v68, v77, v79, v81, 0, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) -> f_215(v67, v68, v77, v79, v81, 0, v86, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) :|: 1 + v86 = v67 && 0 <= v86
f_215(v67, v68, v77, v79, v81, 0, v86, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) -> f_217(v67, v68, v77, v79, v81, 0, v86, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) :|: 0 = 0
f_217(v67, v68, v77, v79, v81, 0, v86, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4) -> f_219(v67, v68, v77, v79, v81, 0, v86, v87, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4, 2) :|: v87 = 1 + v67 && 2 <= v87
f_219(v67, v68, v77, v79, v81, 0, v86, v87, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4, 2) -> f_221(v67, v68, v77, v79, v81, 0, v86, v87, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4, 2) :|: 0 = 0
f_221(v67, v68, v77, v79, v81, 0, v86, v87, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4, 2) -> f_223(v67, v68, v77, v79, v81, 0, v86, v87, v102, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4, 2) :|: v102 = v87 + v68 && 2 <= v102
f_223(v67, v68, v77, v79, v81, 0, v86, v87, v102, v69, v70, v71, v72, v73, v74, v78, v80, v82, v76, 3, 1, 4, 2) -> f_225(v86, v102, v69, v70, v71, v72, v73, v74, v77, v78, v79, v80, v81, v82, 0, v76, v67, v68, v87, 3, 1, 4, 2) :|: 0 = 0
f_225(v86, v102, v69, v70, v71, v72, v73, v74, v77, v78, v79, v80, v81, v82, 0, v76, v67, v68, v87, 3, 1, 4, 2) -> f_227(v86, v102, v69, v70, v71, v72, v73, v74, v77, v78, v79, v80, v81, v82, 0, v76, v67, v68, 3, 1, 4, 2) :|: TRUE
f_227(v86, v102, v69, v70, v71, v72, v73, v74, v77, v78, v79, v80, v81, v82, 0, v76, v67, v68, 3, 1, 4, 2) -> f_199(v86, v102, v69, v70, v71, v72, v73, v74, 0, v76, 3, 1, 4) :|: TRUE
f_199(v67, v68, v69, v70, v71, v72, v73, v74, 0, v76, 3, 1, 4) -> f_200(v67, v68, v77, v69, v70, v71, v72, v73, v74, v78, 0, v76, 3, 1, 4) :|: 1 <= v77 && v78 = 3 + v77 && 4 <= v78
Combined rules. Obtained 1 rulesP rules:
f_200(1 + v86:0, v68:0, v77:0, v69:0, v70:0, v71:0, v72:0, v73:0, v74:0, v78:0, 0, v76:0, 3, 1, 4) -> f_200(v86:0, 1 + (1 + v86:0) + v68:0, v77:1, v69:0, v70:0, v71:0, v72:0, v73:0, v74:0, 3 + v77:1, 0, v76:0, 3, 1, 4) :|: v81:0 > 0 && v79:0 > 0 && v76:0 > 0 && v86:0 > -1 && 1 + (1 + v86:0) + v68:0 > 1 && v77:1 > 0
Filtered unneeded arguments:
   f_200(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_200(x1, x2, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_200(sum~cons_1~v86:0, v68:0, v76:0) -> f_200(v86:0, 1 + (1 + v86:0) + v68:0, v76:0) :|: v86:0 > -1 && 1 + (1 + v86:0) + v68:0 > 1 && v76:0 > 0 && sum~cons_1~v86:0 = 1 + v86:0

----------------------------------------

(8)
Obligation:
Rules:
f_200(sum~cons_1~v86:0, v68:0, v76:0) -> f_200(v86:0, 1 + (1 + v86:0) + v68:0, v76:0) :|: v86:0 > -1 && 1 + (1 + v86:0) + v68:0 > 1 && v76:0 > 0 && sum~cons_1~v86:0 = 1 + v86:0

----------------------------------------

(9) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(10)
Obligation:
Rules:
f_200(sum~cons_1~v86:0:0, v68:0:0, v76:0:0) -> f_200(v86:0:0, 1 + (1 + v86:0:0) + v68:0:0, v76:0:0) :|: v86:0:0 > -1 && 1 + (1 + v86:0:0) + v68:0:0 > 1 && v76:0:0 > 0 && sum~cons_1~v86:0:0 = 1 + v86:0:0

----------------------------------------

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_200 ] = f_200_1

The following rules are decreasing:
f_200(sum~cons_1~v86:0:0, v68:0:0, v76:0:0) -> f_200(v86:0:0, 1 + (1 + v86:0:0) + v68:0:0, v76:0:0) :|: v86:0:0 > -1 && 1 + (1 + v86:0:0) + v68:0:0 > 1 && v76:0:0 > 0 && sum~cons_1~v86:0:0 = 1 + v86:0:0

The following rules are bounded:
f_200(sum~cons_1~v86:0:0, v68:0:0, v76:0:0) -> f_200(v86:0:0, 1 + (1 + v86:0:0) + v68:0:0, v76:0:0) :|: v86:0:0 > -1 && 1 + (1 + v86:0:0) + v68:0:0 > 1 && v76:0:0 > 0 && sum~cons_1~v86:0:0 = 1 + v86:0:0


----------------------------------------

(12)
YES