/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, 173 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 393 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 21 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
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %x
		%3 = load %x
		%4 = icmp sle %3 0
		br %4, %5, %6
	5:
		store 0, %1
		br %14
	6:
		br %7
	7:
		%8 = load %x
		%9 = icmp ne %8 0
		br %9, %10, %13
	10:
		%11 = load %x
		%12 = sub %11 1
		store %12, %x
		br %7
	13:
		store 0, %1
		br %14
	14:
		%15 = load %1
		ret %15


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 9 rulesP rules:
f_123(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 4) -> f_124(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) :|: v28 != 0 && 2 <= v26 && 2 <= v24
f_124(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) -> f_126(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) :|: 0 = 0
f_126(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) -> f_128(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) :|: TRUE
f_128(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 2, 4) -> f_130(v22, v23, v24, 0, v28, 1, v29, v30, 3, 2, 4) :|: 0 = 0
f_130(v22, v23, v24, 0, v28, 1, v29, v30, 3, 2, 4) -> f_132(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) :|: 1 + v31 = v28 && 0 <= v31
f_132(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) -> f_134(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) :|: TRUE
f_134(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) -> f_136(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) :|: TRUE
f_136(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 2, 4) -> f_122(v22, v23, v24, 0, v28, 1, v31, v29, v30, 3, 4) :|: TRUE
f_122(v22, v23, v24, 0, v26, 1, v28, v29, v30, 3, 4) -> f_123(v22, v23, v24, 0, v28, 1, v26, v29, v30, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_123(v22:0, v23:0, v24:0, 0, 1 + v31:0, 1, v26:0, v29:0, v30:0, 3, 4) -> f_123(v22:0, v23:0, v24:0, 0, v31:0, 1, 1 + v31:0, v29:0, v30:0, 3, 4) :|: v26:0 > 1 && v31:0 > -1 && v24:0 > 1
Filtered unneeded arguments:
   f_123(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f_123(x3, x5, x7)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_123(v24:0, sum~cons_1~v31:0, v26:0) -> f_123(v24:0, v31:0, 1 + v31:0) :|: v31:0 > -1 && v24:0 > 1 && v26:0 > 1 && sum~cons_1~v31:0 = 1 + v31:0

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

(8)
Obligation:
Rules:
f_123(v24:0, sum~cons_1~v31:0, v26:0) -> f_123(v24:0, v31:0, 1 + v31:0) :|: v31:0 > -1 && v24:0 > 1 && v26:0 > 1 && sum~cons_1~v31:0 = 1 + v31:0

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

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

(10)
Obligation:
Rules:
f_123(v24:0:0, sum~cons_1~v31:0:0, v26:0:0) -> f_123(v24:0:0, v31:0:0, 1 + v31:0:0) :|: v31:0:0 > -1 && v24:0:0 > 1 && v26:0:0 > 1 && sum~cons_1~v31:0:0 = 1 + v31:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_123 ] = f_123_2

The following rules are decreasing:
f_123(v24:0:0, sum~cons_1~v31:0:0, v26:0:0) -> f_123(v24:0:0, v31:0:0, 1 + v31:0:0) :|: v31:0:0 > -1 && v24:0:0 > 1 && v26:0:0 > 1 && sum~cons_1~v31:0:0 = 1 + v31:0:0

The following rules are bounded:
f_123(v24:0:0, sum~cons_1~v31:0:0, v26:0:0) -> f_123(v24:0:0, v31:0:0, 1 + v31:0:0) :|: v31:0:0 > -1 && v24:0:0 > 1 && v26:0:0 > 1 && sum~cons_1~v31:0:0 = 1 + v31:0:0


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

(12)
YES