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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

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


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

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

(1) CToLLVMProof (EQUIVALENT)
Compiled c-file /export/starexec/sandbox/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: true visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%x = alloca i32, align 4
		%y = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %x
		%3 = call i32 (...)* @__VERIFIER_nondet_int()
		store %3, %y
		br %4
	4:
		%5 = load %x
		%6 = load %y
		%7 = icmp sgt %5 %6
		br %7, %8, %20
	8:
		%9 = load %x
		%10 = load %y
		%11 = sub %9 %10
		store %11, %x
		%12 = call i32 (...)* @__VERIFIER_nondet_int()
		store %12, %y
		%13 = load %y
		%14 = icmp slt %13 1
		br %14, %18, %15
	15:
		%16 = load %y
		%17 = icmp sgt %16 2
		br %17, %18, %19
	18:
		br %20
	19:
		br %4
	20:
		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 21 rulesP rules:
f_160(v102, v103, v104, v105, v106, v110, v108, 1, v107, v111, 0, v113, v114, v115, 3, 2, 4) -> f_161(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_161(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) -> f_162(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) :|: v111 < v110 && 2 <= v110
f_162(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) -> f_164(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_164(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) -> f_166(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_166(v102, v103, v104, v105, v106, v110, v111, 1, v107, v108, 0, v113, v114, v115, 3, 2, 4) -> f_168(v102, v103, v104, v105, v106, v110, v111, 1, v108, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_168(v102, v103, v104, v105, v106, v110, v111, 1, v108, 0, v113, v114, v115, 3, 2, 4) -> f_169(v102, v103, v104, v105, v106, v110, v111, 1, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_169(v102, v103, v104, v105, v106, v110, v111, 1, 0, v113, v114, v115, 3, 2, 4) -> f_170(v102, v103, v104, v105, v106, v110, v111, 1, v128, 0, v113, v114, v115, 3, 2, 4) :|: v128 + v111 = v110 && 1 <= v128
f_170(v102, v103, v104, v105, v106, v110, v111, 1, v128, 0, v113, v114, v115, 3, 2, 4) -> f_171(v102, v103, v104, v105, v106, v110, v111, 1, v128, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_171(v102, v103, v104, v105, v106, v110, v111, 1, v128, 0, v113, v114, v115, 3, 2, 4) -> f_172(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_172(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_173(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_173(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_174(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_174(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_176(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: 1 <= v130
f_176(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_178(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_178(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_180(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_180(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_182(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_182(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_184(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: v130 <= 2
f_184(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_186(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
f_186(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_188(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_188(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_190(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_190(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) -> f_159(v102, v103, v104, v105, v106, v110, v111, 1, v128, v130, 0, v113, v114, v115, 3, 2, 4) :|: TRUE
f_159(v102, v103, v104, v105, v106, v107, v108, 1, v110, v111, 0, v113, v114, v115, 3, 2, 4) -> f_160(v102, v103, v104, v105, v106, v110, v108, 1, v107, v111, 0, v113, v114, v115, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_160(v102:0, v103:0, v104:0, v105:0, v106:0, v128:0 + v111:0, v108:0, 1, v107:0, v111:0, 0, v113:0, v114:0, v115:0, 3, 2, 4) -> f_160(v102:0, v103:0, v104:0, v105:0, v106:0, v128:0, v111:0, 1, v128:0 + v111:0, v130:0, 0, v113:0, v114:0, v115:0, 3, 2, 4) :|: v128:0 + v111:0 > 1 && v128:0 + v111:0 > v111:0 && v128:0 > 0 && v130:0 < 3 && v130:0 > 0
Filtered unneeded arguments:
   f_160(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17) -> f_160(x6, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_160(sum~v128:0~v111:0, v111:0) -> f_160(v128:0, v130:0) :|: v128:0 + v111:0 > v111:0 && v128:0 + v111:0 > 1 && v128:0 > 0 && v130:0 > 0 && v130:0 < 3 && sum~v128:0~v111:0 = v128:0 + v111:0

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

(8)
Obligation:
Rules:
f_160(sum~v128:0~v111:0, v111:0) -> f_160(v128:0, v130:0) :|: v128:0 + v111:0 > v111:0 && v128:0 + v111:0 > 1 && v128:0 > 0 && v130:0 > 0 && v130:0 < 3 && sum~v128:0~v111:0 = v128:0 + v111:0

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

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

(10)
Obligation:
Rules:
f_160(sum~v128:0:0~v111:0:0, v111:0:0) -> f_160(v128:0:0, v130:0:0) :|: v130:0:0 > 0 && v130:0:0 < 3 && v128:0:0 > 0 && v128:0:0 + v111:0:0 > 1 && v128:0:0 + v111:0:0 > v111:0:0 && sum~v128:0:0~v111:0:0 = v128:0:0 + v111:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_160 ] = f_160_1 + -1*f_160_2

The following rules are decreasing:
f_160(sum~v128:0:0~v111:0:0, v111:0:0) -> f_160(v128:0:0, v130:0:0) :|: v130:0:0 > 0 && v130:0:0 < 3 && v128:0:0 > 0 && v128:0:0 + v111:0:0 > 1 && v128:0:0 + v111:0:0 > v111:0:0 && sum~v128:0:0~v111:0:0 = v128:0:0 + v111:0:0

The following rules are bounded:
f_160(sum~v128:0:0~v111:0:0, v111:0:0) -> f_160(v128:0:0, v130:0:0) :|: v130:0:0 > 0 && v130:0:0 < 3 && v128:0:0 > 0 && v128:0:0 + v111:0:0 > 1 && v128:0:0 + v111:0:0 > v111:0:0 && sum~v128:0:0~v111:0:0 = v128:0:0 + v111:0:0


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

(12)
YES