/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, 175 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 1701 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 64 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) RankingReductionPairProof [EQUIVALENT, 23 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
		%x = alloca *i32, align 8
		%y = alloca *i32, align 8
		store 0, %1
		%2 = alloca i8, numElementsLit: 4
		%3 = bitcast *i8 %2 to *i32
		store %3, %x
		%4 = alloca i8, numElementsLit: 4
		%5 = bitcast *i8 %4 to *i32
		store %5, %y
		%6 = load %y
		store 1, %6
		br %7
	7:
		%8 = load %x
		%9 = load %8
		%10 = icmp sgt %9 0
		br %10, %11, %22
	11:
		%12 = load %x
		%13 = load %12
		%14 = load %y
		%15 = load %14
		%16 = sub %13 %15
		%17 = load %x
		store %16, %17
		%18 = load %y
		%19 = load %18
		%20 = add %19 1
		%21 = load %y
		store %20, %21
		br %7
	22:
		ret 0


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_262(v119, v120, v121, v122, v123, v124, 1, v126, v127, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_263(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_263(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_264(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 < v127
f_264(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_266(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_266(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_268(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: TRUE
f_268(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_270(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_270(v119, v120, v121, v122, v123, v127, 1, v124, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_271(v119, v120, v121, v122, v123, v127, 1, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_271(v119, v120, v121, v122, v123, v127, 1, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_272(v119, v120, v121, v122, v123, v127, 1, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_272(v119, v120, v121, v122, v123, v127, 1, v126, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_273(v119, v120, v121, v122, v123, v127, 1, v128, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_273(v119, v120, v121, v122, v123, v127, 1, v128, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_274(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: v135 + v128 = v127
f_274(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_275(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_275(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_276(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: TRUE
f_276(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_277(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_277(v119, v120, v121, v122, v123, v127, 1, v128, v135, v126, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_278(v119, v120, v121, v122, v123, v127, 1, v128, v135, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_278(v119, v120, v121, v122, v123, v127, 1, v128, v135, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_279(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: v137 = 1 + v128 && 3 <= v137
f_279(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_280(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_280(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_281(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: TRUE
f_281(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_282(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: TRUE
f_282(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_261(v119, v120, v121, v122, v123, v127, 1, v128, v135, v137, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: TRUE
f_261(v119, v120, v121, v122, v123, v124, 1, v126, v127, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) -> f_262(v119, v120, v121, v122, v123, v124, 1, v126, v127, v128, v129, v130, v131, v132, v133, 0, 3, 7, 2, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_262(v119:0, v120:0, v121:0, v122:0, v123:0, v124:0, 1, v126:0, v135:0 + v128:0, v128:0, v129:0, v130:0, v131:0, v132:0, v133:0, 0, 3, 7, 2, 4, 8) -> f_262(v119:0, v120:0, v121:0, v122:0, v123:0, v135:0 + v128:0, 1, v128:0, v135:0, 1 + v128:0, v129:0, v130:0, v131:0, v132:0, v133:0, 0, 3, 7, 2, 4, 8) :|: v128:0 > 1 && v135:0 + v128:0 > 0
Filtered unneeded arguments:
   f_262(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_262(x9, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_262(sum~v135:0~v128:0, v128:0) -> f_262(v135:0, 1 + v128:0) :|: v128:0 > 1 && v135:0 + v128:0 > 0 && sum~v135:0~v128:0 = v135:0 + v128:0

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

(8)
Obligation:
Rules:
f_262(sum~v135:0~v128:0, v128:0) -> f_262(v135:0, 1 + v128:0) :|: v128:0 > 1 && v135:0 + v128:0 > 0 && sum~v135:0~v128:0 = v135:0 + v128:0

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

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

(10)
Obligation:
Rules:
f_262(sum~v135:0:0~v128:0:0, v128:0:0) -> f_262(v135:0:0, 1 + v128:0:0) :|: v128:0:0 > 1 && v135:0:0 + v128:0:0 > 0 && sum~v135:0:0~v128:0:0 = v135:0:0 + v128:0:0

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

(11) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_262 ] = 1/2*f_262_1

The following rules are decreasing:
f_262(sum~v135:0:0~v128:0:0, v128:0:0) -> f_262(v135:0:0, 1 + v128:0:0) :|: v128:0:0 > 1 && v135:0:0 + v128:0:0 > 0 && sum~v135:0:0~v128:0:0 = v135:0:0 + v128:0:0

The following rules are bounded:
f_262(sum~v135:0:0~v128:0:0, v128:0:0) -> f_262(v135:0:0, 1 + v128:0:0) :|: v128:0:0 > 1 && v135:0:0 + v128:0:0 > 0 && sum~v135:0:0~v128:0:0 = v135:0:0 + v128:0:0


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

(12)
YES