/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, 79 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 704 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 39 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 22 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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%i = alloca i32, align 4
		%c = alloca i32, align 4
		store 0, %1
		store 0, %i
		store 0, %c
		br %2
	2:
		%3 = load %i
		%4 = icmp sgt %3 10
		br %4, %5, %6
	5:
		br %11
	6:
		%7 = load %i
		%8 = add %7 1
		store %8, %i
		%9 = load %c
		%10 = add %9 1
		store %10, %c
		br %2
	11:
		%12 = load %c
		ret %12


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 12 rulesP rules:
f_147(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 4) -> f_149(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) :|: v60 <= 10 && v58 <= 9
f_149(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) -> f_151(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) :|: 0 = 0
f_151(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) -> f_153(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) :|: TRUE
f_153(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) -> f_155(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) :|: 0 = 0
f_155(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 9, 10, 4) -> f_157(v55, v56, v57, v60, 0, v64, v58, v61, v62, v63, 3, 1, 9, 10, 4, 2, 11) :|: v64 = 1 + v60 && 2 <= v64 && v64 <= 11
f_157(v55, v56, v57, v60, 0, v64, v58, v61, v62, v63, 3, 1, 9, 10, 4, 2, 11) -> f_158(v55, v56, v57, v60, 0, v64, v58, v61, v62, v63, 3, 1, 9, 10, 4, 2, 11) :|: TRUE
f_158(v55, v56, v57, v60, 0, v64, v58, v61, v62, v63, 3, 1, 9, 10, 4, 2, 11) -> f_159(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) :|: 0 = 0
f_159(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) -> f_160(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) :|: v64 = 1 + v60
f_160(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) -> f_161(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) :|: TRUE
f_161(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) -> f_162(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) :|: TRUE
f_162(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 10, 4, 2, 11) -> f_146(v55, v56, v57, v60, 0, v64, v61, v62, v63, 3, 1, 4) :|: TRUE
f_146(v55, v56, v57, v58, 0, v60, v61, v62, v63, 3, 1, 4) -> f_147(v55, v56, v57, v60, 0, v58, v61, v62, v63, 3, 1, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_147(v55:0, v56:0, v57:0, v60:0, 0, v58:0, v61:0, v62:0, v63:0, 3, 1, 4) -> f_147(v55:0, v56:0, v57:0, 1 + v60:0, 0, v60:0, v61:0, v62:0, v63:0, 3, 1, 4) :|: v58:0 < 10 && v60:0 < 11 && v60:0 > 0
Filtered unneeded arguments:
   f_147(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12) -> f_147(x4, x6)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_147(v60:0, v58:0) -> f_147(1 + v60:0, v60:0) :|: v60:0 < 11 && v60:0 > 0 && v58:0 < 10

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

(8)
Obligation:
Rules:
f_147(v60:0, v58:0) -> f_147(1 + v60:0, v60:0) :|: v60:0 < 11 && v60:0 > 0 && v58:0 < 10

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

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

(10)
Obligation:
Rules:
f_147(v60:0:0, v58:0:0) -> f_147(1 + v60:0:0, v60:0:0) :|: v60:0:0 < 11 && v60:0:0 > 0 && v58:0:0 < 10

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_147 ] = -1*f_147_1

The following rules are decreasing:
f_147(v60:0:0, v58:0:0) -> f_147(1 + v60:0:0, v60:0:0) :|: v60:0:0 < 11 && v60:0:0 > 0 && v58:0:0 < 10

The following rules are bounded:
f_147(v60:0:0, v58:0:0) -> f_147(1 + v60:0:0, v60:0:0) :|: v60:0:0 < 11 && v60:0:0 > 0 && v58:0:0 < 10


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

(12)
YES