/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, 180 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 997 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 64 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 23 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
		%z = alloca i32, align 4
		%old_x = 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
		%4 = call i32 (...)* @__VERIFIER_nondet_int()
		store %4, %z
		br %5
	5:
		%6 = load %x
		%7 = icmp sgt %6 0
		br %7, %8, %12
	8:
		%9 = load %x
		%10 = load %y
		%11 = icmp slt %9 %10
		br %12
	12:
		%13 = phi [0, %5], [%11, %8]
		br %13, %14, %24
	14:
		%15 = load %x
		store %15, %old_x
		%16 = call i32 (...)* @__VERIFIER_nondet_int()
		store %16, %x
		%17 = load %x
		%18 = load %old_x
		%19 = mul 2 %18
		%20 = icmp sle %17 %19
		br %20, %21, %22
	21:
		br %24
	22:
		%23 = load %z
		store %23, %y
		br %5
	24:
		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 23 rulesP rules:
f_191(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v153, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_192(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v153, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_192(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v153, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_193(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v153, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: TRUE
f_193(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v153, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_194(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v153, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_194(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v153, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_195(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_195(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_196(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: v154 < v150 && 4 <= v150
f_196(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_198(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_198(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_200(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_200(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_202(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: TRUE
f_202(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_204(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_204(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_205(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: TRUE
f_205(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_206(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: TRUE
f_206(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_207(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: TRUE
f_207(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_208(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_208(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v151, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_209(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
f_209(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_210(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 6) :|: v226 = 2 * v154 && 6 <= v226
f_210(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 6) -> f_212(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) :|: v226 < v224 && 7 <= v224
f_212(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) -> f_214(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) :|: 0 = 0
f_214(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) -> f_216(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) :|: TRUE
f_216(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) -> f_218(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) :|: 0 = 0
f_218(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) -> f_219(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) :|: TRUE
f_219(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) -> f_220(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) :|: TRUE
f_220(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4, 7, 6) -> f_190(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v150, v224, v226, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: TRUE
f_190(v143, v144, v145, v146, v147, v148, v149, v150, v151, 1, v153, v154, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) -> f_191(v143, v144, v145, v146, v147, v148, v149, v150, v154, 1, v151, v153, v155, 0, v157, v158, v159, v160, v161, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_191(v143:0, v144:0, v145:0, v146:0, v147:0, v148:0, v149:0, v150:0, v154:0, 1, v151:0, v153:0, v155:0, 0, v157:0, v158:0, v159:0, v160:0, v161:0, 3, 2, 4) -> f_191(v143:0, v144:0, v145:0, v146:0, v147:0, v148:0, v149:0, v150:0, v224:0, 1, v154:0, v150:0, 2 * v154:0, 0, v157:0, v158:0, v159:0, v160:0, v161:0, 3, 2, 4) :|: v150:0 > 3 && v154:0 < v150:0 && 5 < 2 * v154:0 && v224:0 > 2 * v154:0 && v224:0 > 6
Filtered unneeded arguments:
   f_191(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22) -> f_191(x8, x9)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_191(v150:0, v154:0) -> f_191(v150:0, v224:0) :|: v154:0 < v150:0 && v150:0 > 3 && 5 < 2 * v154:0 && v224:0 > 6 && v224:0 > 2 * v154:0

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

(8)
Obligation:
Rules:
f_191(v150:0, v154:0) -> f_191(v150:0, v224:0) :|: v154:0 < v150:0 && v150:0 > 3 && 5 < 2 * v154:0 && v224:0 > 6 && v224:0 > 2 * v154:0

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

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

(10)
Obligation:
Rules:
f_191(v150:0:0, v154:0:0) -> f_191(v150:0:0, v224:0:0) :|: v224:0:0 > 6 && v224:0:0 > 2 * v154:0:0 && 5 < 2 * v154:0:0 && v150:0:0 > 3 && v154:0:0 < v150:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_191 ] = -1/4*f_191_2 + 1/4*f_191_1

The following rules are decreasing:
f_191(v150:0:0, v154:0:0) -> f_191(v150:0:0, v224:0:0) :|: v224:0:0 > 6 && v224:0:0 > 2 * v154:0:0 && 5 < 2 * v154:0:0 && v150:0:0 > 3 && v154:0:0 < v150:0:0

The following rules are bounded:
f_191(v150:0:0, v154:0:0) -> f_191(v150:0:0, v224:0:0) :|: v224:0:0 > 6 && v224:0:0 > 2 * v154:0:0 && 5 < 2 * v154:0:0 && v150:0:0 > 3 && v154:0:0 < v150:0:0


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

(12)
YES