/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 179 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 2615 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 75 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 9 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: "__VERIFIER_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "addition" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (m i32, n i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%3 = alloca i32, align 4
		store %m, %2
		store %n, %3
		%4 = load %3
		%5 = icmp eq %4 0
		br %5, %6, %8
	6:
		%7 = load %2
		store %7, %1
		br %26
	8:
		%9 = load %3
		%10 = icmp sgt %9 0
		br %10, %11, %17
	11:
		%12 = load %2
		%13 = add %12 1
		%14 = load %3
		%15 = sub %14 1
		%16 = call i32 @addition(i32 %13, i32 %15)
		store %16, %1
		br %26
	17:
		%18 = load %3
		%19 = icmp slt %18 0
		br %19, %20, %26
	20:
		%21 = load %2
		%22 = sub %21 1
		%23 = load %3
		%24 = add %23 1
		%25 = call i32 @addition(i32 %22, i32 %24)
		store %25, %1
		br %26
	26:
		%27 = load %1
		ret %27

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%m = alloca i32, align 4
		%n = alloca i32, align 4
		%result = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %m
		%3 = load %m
		%4 = icmp slt %3 0
		br %4, %8, %5
	5:
		%6 = load %m
		%7 = icmp sgt %6 2147483647
		br %7, %8, %9
	8:
		store 0, %1
		br %29
	9:
		%10 = call i32 @__VERIFIER_nondet_int()
		store %10, %n
		%11 = load %n
		%12 = icmp slt %11 0
		br %12, %16, %13
	13:
		%14 = load %n
		%15 = icmp sgt %14 2147483647
		br %15, %16, %17
	16:
		store 0, %1
		br %29
	17:
		%18 = load %m
		%19 = load %n
		%20 = call i32 @addition(i32 %18, i32 %19)
		store %20, %result
		%21 = load %result
		%22 = load %m
		%23 = load %n
		%24 = add %22 %23
		%25 = icmp eq %21 %24
		br %25, %26, %27
	26:
		store 0, %1
		br %29
	27:
		br %28
	28:
		Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error() noreturn
		unreachable
	29:
		%30 = load %1
		ret %30


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 19 rulesP rules:
f_347(v100, v101, v113, v102, v103, v104, v105, v106, v107, v108, v109, v114, 0, v111, v112, 3, 1, 4) -> f_349(v100, v101, v113, v115, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, 0, v111, v112, 3, 1, 4) :|: 1 <= v115 && v116 = 3 + v115 && 4 <= v116
f_349(v100, v101, v113, v115, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, 0, v111, v112, 3, 1, 4) -> f_350(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) :|: 1 <= v117 && v118 = 3 + v117 && 4 <= v118
f_350(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) -> f_351(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) :|: TRUE
f_351(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) -> f_352(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) :|: TRUE
f_352(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) -> f_353(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) :|: 0 = 0
f_353(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) -> f_355(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) :|: v101 != 0 && 1 <= v112
f_355(v100, v101, v113, v115, v117, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, 0, v111, v112, 3, 1, 4) -> f_357(v100, v101, v113, v115, v117, 0, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 1, 4) :|: 0 = 0
f_357(v100, v101, v113, v115, v117, 0, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 1, 4) -> f_359(v100, v101, v113, v115, v117, 0, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 1, 4) :|: TRUE
f_359(v100, v101, v113, v115, v117, 0, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 1, 4) -> f_361(v100, v101, v113, v115, v117, 0, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 1, 4) :|: 0 = 0
f_361(v100, v101, v113, v115, v117, 0, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 1, 4) -> f_363(v100, v101, v113, v115, v117, 0, 1, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) :|: 0 = 0
f_363(v100, v101, v113, v115, v117, 0, 1, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) -> f_365(v100, v101, v113, v115, v117, 0, 1, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) :|: TRUE
f_365(v100, v101, v113, v115, v117, 0, 1, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) -> f_367(v100, v101, v113, v115, v117, 0, 1, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) :|: 0 = 0
f_367(v100, v101, v113, v115, v117, 0, 1, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) -> f_369(v100, v101, v113, v115, v117, 0, 1, v139, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) :|: v139 = 1 + v100 && 1 <= v139
f_369(v100, v101, v113, v115, v117, 0, 1, v139, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) -> f_371(v100, v101, v113, v115, v117, 0, 1, v139, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) :|: 0 = 0
f_371(v100, v101, v113, v115, v117, 0, 1, v139, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) -> f_373(v100, v101, v113, v115, v117, 0, 1, v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) :|: 1 + v141 = v101 && 0 <= v141
f_373(v100, v101, v113, v115, v117, 0, 1, v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, v114, v116, v118, v111, v112, 3, 4) -> f_375(v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, v113, v114, v115, v116, v117, v118, 0, v111, v112, v100, v101, 1, 3, 4) :|: 0 = 0
f_375(v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, v113, v114, v115, v116, v117, v118, 0, v111, v112, v100, v101, 1, 3, 4) -> f_377(v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, v113, v114, v115, v116, v117, v118, 0, v111, v112, v100, v101, 3, 1, 4) :|: TRUE
f_377(v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, v113, v114, v115, v116, v117, v118, 0, v111, v112, v100, v101, 3, 1, 4) -> f_345(v139, v141, v102, v103, v104, v105, v106, v107, v108, v109, 0, v111, v112, 3, 1, 4) :|: TRUE
f_345(v100, v101, v102, v103, v104, v105, v106, v107, v108, v109, 0, v111, v112, 3, 1, 4) -> f_347(v100, v101, v113, v102, v103, v104, v105, v106, v107, v108, v109, v114, 0, v111, v112, 3, 1, 4) :|: 1 <= v113 && v114 = 3 + v113 && 4 <= v114
Combined rules. Obtained 1 rulesP rules:
f_347(v100:0, 1 + v141:0, v113:0, v102:0, v103:0, v104:0, v105:0, v106:0, v107:0, v108:0, v109:0, v114:0, 0, v111:0, v112:0, 3, 1, 4) -> f_347(1 + v100:0, v141:0, v113:1, v102:0, v103:0, v104:0, v105:0, v106:0, v107:0, v108:0, v109:0, 3 + v113:1, 0, v111:0, v112:0, 3, 1, 4) :|: v117:0 > 0 && v115:0 > 0 && v112:0 > 0 && v141:0 > -1 && v100:0 > -1 && v113:1 > 0
Filtered unneeded arguments:
   f_347(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_347(x1, x2, x15)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_347(v100:0, sum~cons_1~v141:0, v112:0) -> f_347(1 + v100:0, v141:0, v112:0) :|: v141:0 > -1 && v100:0 > -1 && v112:0 > 0 && sum~cons_1~v141:0 = 1 + v141:0

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

(8)
Obligation:
Rules:
f_347(v100:0, sum~cons_1~v141:0, v112:0) -> f_347(1 + v100:0, v141:0, v112:0) :|: v141:0 > -1 && v100:0 > -1 && v112:0 > 0 && sum~cons_1~v141:0 = 1 + v141:0

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

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

(10)
Obligation:
Rules:
f_347(v100:0:0, sum~cons_1~v141:0:0, v112:0:0) -> f_347(1 + v100:0:0, v141:0:0, v112:0:0) :|: v141:0:0 > -1 && v100:0:0 > -1 && v112:0:0 > 0 && sum~cons_1~v141:0:0 = 1 + v141:0:0

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

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_347(x, x1, x2)] = x1

The following rules are decreasing:
f_347(v100:0:0, sum~cons_1~v141:0:0, v112:0:0) -> f_347(1 + v100:0:0, v141:0:0, v112:0:0) :|: v141:0:0 > -1 && v100:0:0 > -1 && v112:0:0 > 0 && sum~cons_1~v141:0:0 = 1 + v141:0:0
The following rules are bounded:
f_347(v100:0:0, sum~cons_1~v141:0:0, v112:0:0) -> f_347(1 + v100:0:0, v141:0:0, v112:0:0) :|: v141:0:0 > -1 && v100:0:0 > -1 && v112:0:0 > 0 && sum~cons_1~v141:0:0 = 1 + v141:0:0

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

(12)
YES