/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/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, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 296 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) PolynomialOrderProcessor [EQUIVALENT, 9 ms]
(12) YES


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

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToLLVMProof (EQUIVALENT)
Compiled c-file /export/starexec/sandbox/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: "malloc" returnParam: *i8 parameters: (i64) 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
		%p = alloca *i32, align 8
		store 0, %1
		%2 = call *i8 @malloc(i64 4)
		%3 = bitcast *i8 %2 to *i32
		store %3, %p
		br %4
	4:
		%5 = load %p
		%6 = load %5
		%7 = icmp sge %6 0
		br %7, %8, %12
	8:
		%9 = load %p
		%10 = load %9
		%11 = add %10 -1
		store %11, %9
		br %4
	12:
		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 11 rulesP rules:
f_75(v1, v3, v5, v8, 1, v10, v2, v4, v6, 0, 3, 7, 4, 8) -> f_76(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) :|: 0 = 0
f_76(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) -> f_77(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) :|: 0 <= v10 && 1 <= v8
f_77(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) -> f_79(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) :|: 0 = 0
f_79(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) -> f_81(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) :|: TRUE
f_81(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) -> f_83(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) :|: 0 = 0
f_83(v1, v3, v5, v10, 1, v8, v2, v4, v6, 0, 3, 7, 4, 8) -> f_84(v1, v3, v5, v10, 1, v2, v4, v6, 0, 3, 7, 4, 8) :|: 0 = 0
f_84(v1, v3, v5, v10, 1, v2, v4, v6, 0, 3, 7, 4, 8) -> f_85(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) :|: 1 + v12 = v10 && 0 <= 1 + v12
f_85(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) -> f_86(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) :|: TRUE
f_86(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) -> f_87(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) :|: TRUE
f_87(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) -> f_74(v1, v3, v5, v10, 1, v12, v2, v4, v6, 0, 3, 7, 4, 8) :|: TRUE
f_74(v1, v3, v5, v8, 1, v10, v2, v4, v6, 0, 3, 7, 4, 8) -> f_75(v1, v3, v5, v8, 1, v10, v2, v4, v6, 0, 3, 7, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_75(v1:0, v3:0, v5:0, v8:0, 1, 1 + v12:0, v2:0, v4:0, v6:0, 0, 3, 7, 4, 8) -> f_75(v1:0, v3:0, v5:0, 1 + v12:0, 1, v12:0, v2:0, v4:0, v6:0, 0, 3, 7, 4, 8) :|: v8:0 > 0 && v12:0 > -2
Filtered unneeded arguments:
   f_75(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_75(x4, x6)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_75(v8:0, sum~cons_1~v12:0) -> f_75(1 + v12:0, v12:0) :|: v8:0 > 0 && v12:0 > -2 && sum~cons_1~v12:0 = 1 + v12:0

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

(8)
Obligation:
Rules:
f_75(v8:0, sum~cons_1~v12:0) -> f_75(1 + v12:0, v12:0) :|: v8:0 > 0 && v12:0 > -2 && sum~cons_1~v12:0 = 1 + v12:0

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

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

(10)
Obligation:
Rules:
f_75(v8:0:0, sum~cons_1~v12:0:0) -> f_75(1 + v12:0:0, v12:0:0) :|: v8:0:0 > 0 && v12:0:0 > -2 && sum~cons_1~v12:0:0 = 1 + v12:0:0

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

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

The following rules are decreasing:
f_75(v8:0:0, sum~cons_1~v12:0:0) -> f_75(1 + v12:0:0, v12:0:0) :|: v8:0:0 > 0 && v12:0:0 > -2 && sum~cons_1~v12:0:0 = 1 + v12:0:0
The following rules are bounded:
f_75(v8:0:0, sum~cons_1~v12:0:0) -> f_75(1 + v12:0:0, v12:0:0) :|: v8:0:0 > 0 && v12:0:0 > -2 && sum~cons_1~v12:0:0 = 1 + v12:0:0

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

(12)
YES