/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, 174 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 2253 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 48 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 26 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: "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 = load %x
		%4 = icmp slt %3 0
		br %4, %5, %6
	5:
		store 0, %1
		br %16
	6:
		%7 = call i32 @__VERIFIER_nondet_int()
		store %7, %y
		%8 = load %y
		%9 = icmp slt %8 0
		br %9, %10, %11
	10:
		store 0, %1
		br %16
	11:
		%12 = call i32 @__VERIFIER_nondet_int()
		store %12, %z
		%13 = load %x
		%14 = load %y
		%15 = call i32 @le(i32 %13, i32 %14)
		br %16
	16:
		%17 = load %1
		ret %17

*BasicFunctionTypename: "le" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%3 = alloca i32, align 4
		store %x, %2
		store %y, %3
		%4 = load %2
		%5 = icmp sgt %4 0
		br %5, %6, %15
	6:
		%7 = load %3
		%8 = icmp sgt %7 0
		br %8, %9, %15
	9:
		%10 = load %2
		%11 = sub %10 1
		%12 = load %3
		%13 = sub %12 1
		%14 = call i32 @le(i32 %11, i32 %13)
		store %14, %1
		br %19
	15:
		%16 = load %2
		%17 = icmp eq %16 0
		%18 = zext i1 %17 to i32
		store %18, %1
		br %19
	19:
		%20 = load %1
		ret %20

*BasicFunctionTypename: "random" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%x = alloca i32, align 4
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %x
		%3 = load %x
		%4 = icmp slt %3 0
		br %4, %5, %8
	5:
		%6 = load %x
		%7 = sub 0 %6
		store %7, %1
		br %10
	8:
		%9 = load %x
		store %9, %1
		br %10
	10:
		%11 = load %1
		ret %11


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 20 rulesP rules:
f_329(v95, v96, v109, v97, v98, v99, v100, v101, v102, v103, v104, v110, 0, v106, v107, v108, 3, 1, 4) -> f_330(v95, v96, v109, v111, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, 0, v106, v107, v108, 3, 1, 4) :|: 1 <= v111 && v112 = 3 + v111 && 4 <= v112
f_330(v95, v96, v109, v111, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, 0, v106, v107, v108, 3, 1, 4) -> f_331(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) :|: 1 <= v113 && v114 = 3 + v113 && 4 <= v114
f_331(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) -> f_332(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) :|: TRUE
f_332(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) -> f_333(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) :|: TRUE
f_333(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) -> f_334(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) :|: 0 = 0
f_334(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) -> f_335(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) :|: 0 < v95 && 1 <= v106
f_335(v95, v96, v109, v111, v113, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 1, 4) -> f_337(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 0 = 0
f_337(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_339(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: TRUE
f_339(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_341(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 0 = 0
f_341(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_343(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 0 < v96 && 1 <= v107
f_343(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_346(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 0 = 0
f_346(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_349(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: TRUE
f_349(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_352(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 0 = 0
f_352(v95, v96, v109, v111, v113, 1, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_355(v95, v96, v109, v111, v113, 1, v117, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 1 + v117 = v95 && 0 <= v117
f_355(v95, v96, v109, v111, v113, 1, v117, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_358(v95, v96, v109, v111, v113, 1, v117, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 0 = 0
f_358(v95, v96, v109, v111, v113, 1, v117, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_361(v95, v96, v109, v111, v113, 1, v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) :|: 1 + v136 = v96 && 0 <= v136
f_361(v95, v96, v109, v111, v113, 1, v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, v110, v112, v114, 0, v106, v107, v108, 3, 4) -> f_364(v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, v109, v110, v111, v112, v113, v114, 0, v106, v107, v108, v95, v96, 1, 3, 4) :|: 0 = 0
f_364(v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, v109, v110, v111, v112, v113, v114, 0, v106, v107, v108, v95, v96, 1, 3, 4) -> f_367(v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, v109, v110, v111, v112, v113, v114, 0, v106, v107, v108, v95, v96, 3, 1, 4) :|: TRUE
f_367(v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, v109, v110, v111, v112, v113, v114, 0, v106, v107, v108, v95, v96, 3, 1, 4) -> f_328(v117, v136, v97, v98, v99, v100, v101, v102, v103, v104, 0, v106, v107, v108, 3, 1, 4) :|: TRUE
f_328(v95, v96, v97, v98, v99, v100, v101, v102, v103, v104, 0, v106, v107, v108, 3, 1, 4) -> f_329(v95, v96, v109, v97, v98, v99, v100, v101, v102, v103, v104, v110, 0, v106, v107, v108, 3, 1, 4) :|: 1 <= v109 && v110 = 3 + v109 && 4 <= v110
Combined rules. Obtained 1 rulesP rules:
f_329(1 + v117:0, 1 + v136:0, v109:0, v97:0, v98:0, v99:0, v100:0, v101:0, v102:0, v103:0, v104:0, v110:0, 0, v106:0, v107:0, v108:0, 3, 1, 4) -> f_329(v117:0, v136:0, v109:1, v97:0, v98:0, v99:0, v100:0, v101:0, v102:0, v103:0, v104:0, 3 + v109:1, 0, v106:0, v107:0, v108:0, 3, 1, 4) :|: v113:0 > 0 && v111:0 > 0 && v106:0 > 0 && v117:0 > -1 && v107:0 > 0 && v136:0 > -1 && v109:1 > 0
Filtered unneeded arguments:
   f_329(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f_329(x1, x2, x14, x15)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_329(sum~cons_1~v117:0, sum~cons_1~v136:0, v106:0, v107:0) -> f_329(v117:0, v136:0, v106:0, v107:0) :|: v117:0 > -1 && v106:0 > 0 && v136:0 > -1 && v107:0 > 0 && sum~cons_1~v117:0 = 1 + v117:0 && sum~cons_1~v136:0 = 1 + v136:0

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

(8)
Obligation:
Rules:
f_329(sum~cons_1~v117:0, sum~cons_1~v136:0, v106:0, v107:0) -> f_329(v117:0, v136:0, v106:0, v107:0) :|: v117:0 > -1 && v106:0 > 0 && v136:0 > -1 && v107:0 > 0 && sum~cons_1~v117:0 = 1 + v117:0 && sum~cons_1~v136:0 = 1 + v136:0

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

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

(10)
Obligation:
Rules:
f_329(sum~cons_1~v117:0:0, sum~cons_1~v136:0:0, v106:0:0, v107:0:0) -> f_329(v117:0:0, v136:0:0, v106:0:0, v107:0:0) :|: v136:0:0 > -1 && v107:0:0 > 0 && v106:0:0 > 0 && v117:0:0 > -1 && sum~cons_1~v117:0:0 = 1 + v117:0:0 && sum~cons_1~v136:0:0 = 1 + v136:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_329 ] = f_329_1

The following rules are decreasing:
f_329(sum~cons_1~v117:0:0, sum~cons_1~v136:0:0, v106:0:0, v107:0:0) -> f_329(v117:0:0, v136:0:0, v106:0:0, v107:0:0) :|: v136:0:0 > -1 && v107:0:0 > 0 && v106:0:0 > 0 && v117:0:0 > -1 && sum~cons_1~v117:0:0 = 1 + v117:0:0 && sum~cons_1~v136:0:0 = 1 + v136:0:0

The following rules are bounded:
f_329(sum~cons_1~v117:0:0, sum~cons_1~v136:0:0, v106:0:0, v107:0:0) -> f_329(v117:0:0, v136:0:0, v106:0:0, v107:0:0) :|: v136:0:0 > -1 && v107:0:0 > 0 && v106:0:0 > 0 && v117:0:0 > -1 && sum~cons_1~v117:0:0 = 1 + v117:0:0 && sum~cons_1~v136:0:0 = 1 + v136:0:0


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

(12)
YES