/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, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 905 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 107 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [EQUIVALENT, 1304 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: false 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
		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
		%5 = load %y
		%6 = mul 2 %5
		%7 = load %z
		%8 = icmp slt %6 %7
		br %8, %9, %10
	9:
		store 0, %1
		br %26
	10:
		br %11
	11:
		%12 = load %x
		%13 = icmp sge %12 0
		br %13, %14, %17
	14:
		%15 = load %z
		%16 = icmp eq %15 1
		br %17
	17:
		%18 = phi [0, %11], [%16, %14]
		br %18, %19, %25
	19:
		%20 = load %x
		%21 = load %y
		%22 = mul 2 %21
		%23 = sub %20 %22
		%24 = add %23 1
		store %24, %x
		br %11
	25:
		store 0, %1
		br %26
	26:
		%27 = load %1
		ret %27


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) SymbolicExecutionGraphToLassoProof (EQUIVALENT)
Converted SEGraph to 1 independent lasso.
----------------------------------------

(6)
Obligation:
Lasso
----------------------------------------

(7) Lasso2IRS (EQUIVALENT)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 51 rulesP rules:
f_195(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_196(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 <= v115 && 0 <= 1 + v114 && 1 <= v113
f_196(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_198(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_198(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_200(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: TRUE
f_200(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_202(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_202(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_204(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_204(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_206(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_206(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_208(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: TRUE
f_208(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) -> f_210(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_210(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v114, v116, v117, v118, v119, 3, 2, 4) -> f_211(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_211(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v114, v116, v117, v118, v119, 3, 2, 4) -> f_212(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v114, v116, v117, v118, v119, 3, 2, 4) :|: v111 = 2 * v109
f_212(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v114, v116, v117, v118, v119, 3, 2, 4) -> f_213(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v116, v117, v118, v119, 3, 2, 4) :|: v189 + v111 = v115
f_213(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v116, v117, v118, v119, 3, 2, 4) -> f_214(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) :|: v190 = 1 + v189
f_214(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) -> f_215(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) :|: TRUE
f_215(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) -> f_216(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) :|: TRUE
f_216(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) -> f_194(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v189, v190, v116, v117, v118, v119, 3, 2, 4) :|: TRUE
f_194(v104, v105, v106, v107, v108, v109, 1, v111, 0, v113, v114, v115, v116, v117, v118, v119, 3, 2, 4) -> f_195(v104, v105, v106, v107, v108, v109, 1, v111, 0, v115, v113, v114, v116, v117, v118, v119, 3, 2, 4) :|: 0 = 0
f_117 -> f_118(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2
f_118(v1, v2, 3, 1, 4) -> f_119(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4
f_119(v1, v3, v2, v4, 3, 1, 4) -> f_120(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6
f_120(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_121(v1, v3, v5, v7, v2, v4, v6, v8, 3, 1, 4) :|: 1 <= v7 && v8 = 3 + v7 && 4 <= v8
f_121(v1, v3, v5, v7, v2, v4, v6, v8, 3, 1, 4) -> f_122(v1, v3, v5, v7, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_122(v1, v3, v5, v7, v2, v4, v6, v8, 0, 3, 1, 4) -> f_123(v1, v3, v5, v7, v9, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_123(v1, v3, v5, v7, v9, v2, v4, v6, v8, 0, 3, 1, 4) -> f_124(v1, v3, v5, v7, v9, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_124(v1, v3, v5, v7, v9, v2, v4, v6, v8, 0, 3, 1, 4) -> f_125(v1, v3, v5, v7, v9, v11, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_125(v1, v3, v5, v7, v9, v11, v2, v4, v6, v8, 0, 3, 1, 4) -> f_126(v1, v3, v5, v7, v9, v11, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_126(v1, v3, v5, v7, v9, v11, v2, v4, v6, v8, 0, 3, 1, 4) -> f_127(v1, v3, v5, v7, v9, v11, v13, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_127(v1, v3, v5, v7, v9, v11, v13, v2, v4, v6, v8, 0, 3, 1, 4) -> f_128(v1, v3, v5, v7, v9, v11, v13, v2, v4, v6, v8, 0, 3, 1, 4) :|: TRUE
f_128(v1, v3, v5, v7, v9, v11, v13, v2, v4, v6, v8, 0, 3, 1, 4) -> f_129(v1, v3, v5, v7, v9, v11, v13, v2, v4, v6, v8, 0, 3, 1, 4) :|: 0 = 0
f_129(v1, v3, v5, v7, v9, v11, v13, v2, v4, v6, v8, 0, 3, 1, 4) -> f_130(v1, v3, v5, v7, v9, v11, v13, v15, v2, v4, v6, v8, 0, 3, 2, 1, 4) :|: v15 = 2 * v11
f_130(v1, v3, v5, v7, v9, v11, v13, v15, v2, v4, v6, v8, 0, 3, 2, 1, 4) -> f_131(v1, v3, v5, v7, v9, v11, v13, v15, v2, v4, v6, v8, 0, 3, 2, 1, 4) :|: 0 = 0
f_131(v1, v3, v5, v7, v9, v11, v13, v15, v2, v4, v6, v8, 0, 3, 2, 1, 4) -> f_133(v1, v3, v5, v7, v9, v11, v13, v15, v2, v4, v6, v8, 0, 3, 2, 1, 4) :|: v13 <= v15
f_133(v1, v3, v5, v7, v9, v11, v13, v15, v2, v4, v6, v8, 0, 3, 2, 1, 4) -> f_135(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) :|: 0 = 0
f_135(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) -> f_137(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) :|: TRUE
f_137(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) -> f_139(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) :|: TRUE
f_139(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) -> f_141(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) :|: 0 = 0
f_141(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) -> f_143(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) :|: 0 <= v9
f_143(v1, v3, v5, v7, v9, v11, v13, v15, 0, v2, v4, v6, v8, 3, 2, 1, 4) -> f_145(v1, v3, v5, v7, v9, v11, v13, v15, 0, 1, v2, v4, v6, v8, 3, 2, 4) :|: 0 = 0
f_145(v1, v3, v5, v7, v9, v11, v13, v15, 0, 1, v2, v4, v6, v8, 3, 2, 4) -> f_147(v1, v3, v5, v7, v9, v11, v13, v15, 0, 1, v2, v4, v6, v8, 3, 2, 4) :|: TRUE
f_147(v1, v3, v5, v7, v9, v11, v13, v15, 0, 1, v2, v4, v6, v8, 3, 2, 4) -> f_149(v1, v3, v5, v7, v9, v11, v13, v15, 0, 1, v2, v4, v6, v8, 3, 2, 4) :|: 0 = 0
f_149(v1, v3, v5, v7, v9, v11, v13, v15, 0, 1, v2, v4, v6, v8, 3, 2, 4) -> f_151(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: v13 = 1 && 2 <= v15 && 1 <= v11
f_151(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_154(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: 0 = 0
f_154(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_157(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: 0 = 0
f_157(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_160(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: TRUE
f_160(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_162(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: 0 = 0
f_162(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_164(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: 0 = 0
f_164(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_166(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) :|: v15 = 2 * v11
f_166(v1, v3, v5, v7, v9, v11, 1, v15, 0, v2, v4, v6, v8, 3, 2, 4) -> f_168(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v2, v4, v6, v8, 3, 2, 4) :|: v25 + v15 = v9
f_168(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v2, v4, v6, v8, 3, 2, 4) -> f_169(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v26, v2, v4, v6, v8, 3, 2, 4) :|: v26 = 1 + v25
f_169(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v26, v2, v4, v6, v8, 3, 2, 4) -> f_170(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v26, v2, v4, v6, v8, 3, 2, 4) :|: TRUE
f_170(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v26, v2, v4, v6, v8, 3, 2, 4) -> f_171(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v26, v2, v4, v6, v8, 3, 2, 4) :|: TRUE
f_171(v1, v3, v5, v7, v9, v11, 1, v15, 0, v25, v26, v2, v4, v6, v8, 3, 2, 4) -> f_194(v1, v3, v5, v7, v9, v11, 1, v15, 0, v9, v25, v26, v2, v4, v6, v8, 3, 2, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_117 -> f_195(v1:0, v3:0, v5:0, v7:0, v25:0 + 2 * v11:0, v11:0, 1, 2 * v11:0, 0, 1 + v25:0, v25:0 + 2 * v11:0, v25:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 3 + v7:0, 3, 2, 4) :|: 2 * v11:0 > 1 && v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v7:0 > 0 && v11:0 > 0 && v25:0 + 2 * v11:0 > -1
f_195(v104:0, v105:0, v106:0, v107:0, v108:0, v109:0, 1, 2 * v109:0, 0, v189:0 + 2 * v109:0, v113:0, v114:0, v116:0, v117:0, v118:0, v119:0, 3, 2, 4) -> f_195(v104:0, v105:0, v106:0, v107:0, v108:0, v109:0, 1, 2 * v109:0, 0, 1 + v189:0, v189:0 + 2 * v109:0, v189:0, v116:0, v117:0, v118:0, v119:0, 3, 2, 4) :|: v114:0 > -2 && v113:0 > 0 && v189:0 + 2 * v109:0 > -1
Filtered unneeded arguments:
   f_195(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f_195(x6, x8, x10, x11, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_117 -> f_195(v11:0, 2 * v11:0, 1 + v25:0, v25:0 + 2 * v11:0, v25:0) :|: v11:0 > 0 && v25:0 + 2 * v11:0 > -1 && 2 * v11:0 > 1
f_195(v109:0, times~cons_2~v109:0, sum~v189:0~times~cons_2~v109:0, v113:0, v114:0) -> f_195(v109:0, 2 * v109:0, 1 + v189:0, v189:0 + 2 * v109:0, v189:0) :|: v113:0 > 0 && v189:0 + 2 * v109:0 > -1 && v114:0 > -2 && times~cons_2~v109:0 = 2 * v109:0 && sum~v189:0~times~cons_2~v109:0 = v189:0 + 2 * v109:0

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

(8)
Obligation:
Rules:
f_117 -> f_195(v11:0, 2 * v11:0, 1 + v25:0, v25:0 + 2 * v11:0, v25:0) :|: v11:0 > 0 && v25:0 + 2 * v11:0 > -1 && 2 * v11:0 > 1
f_195(v109:0, times~cons_2~v109:0, sum~v189:0~times~cons_2~v109:0, v113:0, v114:0) -> f_195(v109:0, 2 * v109:0, 1 + v189:0, v189:0 + 2 * v109:0, v189:0) :|: v113:0 > 0 && v189:0 + 2 * v109:0 > -1 && v114:0 > -2 && times~cons_2~v109:0 = 2 * v109:0 && sum~v189:0~times~cons_2~v109:0 = v189:0 + 2 * v109:0
Start term: f_117

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

(9) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f_117_5,1)
   (f_195_5,2)

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

(10)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := x4;
oldX5 := nondet();
oldX6 := nondet();
assume(oldX5 > 0 && oldX6 + 2 * oldX5 > -1 && 2 * oldX5 > 1);
x0 := oldX5;
x1 := 2 * oldX5;
x2 := 1 + oldX6;
x3 := oldX6 + 2 * oldX5;
x4 := oldX6;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
oldX4 := x4;
oldX5 := nondet();
assume(oldX3 > 0 && oldX5 + 2 * oldX0 > -1 && oldX4 > -2 && oldX1 = 2 * oldX0 && oldX2 = oldX5 + 2 * oldX0);
x0 := oldX0;
x1 := 2 * oldX0;
x2 := 1 + oldX5;
x3 := oldX5 + 2 * oldX0;
x4 := oldX5;
TO: 2;


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

(11) T2 (EQUIVALENT)
Used the following cutpoint-specific lexicographic rank functions:
 * For cutpoint 5, used the following rank functions/bounds (in descending priority order):
    - RF x2, bound 0

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

(12)
YES