/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, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 3499 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 80 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 12 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: "cbzero" linkageType: EXTERNALLY_VISIBLE returnParam: BasicVoidType parameters: (b *i8, length i64) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca *i8, align 8
		%2 = alloca i64, align 8
		%p = alloca *i8, align 8
		store %b, %1
		store %length, %2
		%3 = load %1
		store %3, %p
		br %4
	4:
		%5 = load %2
		%6 = add %5 -1
		store %6, %2
		%7 = icmp ne %5 0
		br %7, %8, %11
	8:
		%9 = load %p
		%10 = getelementptr %9, 1
		store %10, %p
		store 0, %9
		br %4
	11:
		ret void

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%length = alloca i32, align 4
		%n = alloca i32, align 4
		%nondetArea = alloca *i8, align 8
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %length
		%3 = call i32 @__VERIFIER_nondet_int()
		store %3, %n
		%4 = load %length
		%5 = icmp slt %4 1
		br %5, %6, %7
	6:
		store 1, %length
		br %7
	7:
		%8 = load %n
		%9 = icmp slt %8 1
		br %9, %10, %11
	10:
		store 1, %n
		br %11
	11:
		%12 = load %n
		%13 = load %length
		%14 = icmp sgt %12 %13
		br %14, %15, %16
	15:
		store 0, %1
		br %24
	16:
		%17 = load %length
		%18 = sext i32 %17 to i64
		%19 = mul %18 1
		%20 = alloca i8, numElementsLit: %19
		store %20, %nondetArea
		%21 = load %nondetArea
		%22 = load %n
		%23 = sext i32 %22 to i64
		Unnamed Call-Instruction = call BasicVoidType @cbzero(*i8 %21, i64 %23)
		store 0, %1
		br %24
	24:
		%25 = load %1
		ret %25


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_406(v408, v409, v410, v411, v412, v413, v414, 1, v417, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_407(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: v434 = 1 + v417 && 3 <= v434
f_407(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_408(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: TRUE
f_408(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_409(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: TRUE
f_409(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_410(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: TRUE
f_410(v408, v409, v410, v411, v412, v413, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_411(v408, v409, v410, v411, v412, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: 0 = 0
f_411(v408, v409, v410, v411, v412, v414, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_412(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: 1 + v446 = v414 && 0 <= 1 + v446
f_412(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_413(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: TRUE
f_413(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_414(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: v414 != 0 && 0 <= v446 && 3 <= v430
f_414(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_416(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: 0 = 0
f_416(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_418(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: TRUE
f_418(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) -> f_405(v408, v409, v410, v411, v412, v414, v446, 1, v417, v434, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v425, v422, v423, 3, 7, 2, 4, 8) :|: TRUE
f_405(v408, v409, v410, v411, v412, v413, v414, 1, v416, v417, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v425, v422, v423, 3, 7, 2, 4, 8) -> f_406(v408, v409, v410, v411, v412, v413, v414, 1, v417, v418, v426, v419, v427, v420, v428, v421, v429, v430, v431, v432, v433, 0, v416, v425, v422, v423, 3, 7, 2, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_406(v408:0, v409:0, v410:0, v411:0, v412:0, v413:0, 1 + v446:0, 1, v417:0, v418:0, v426:0, v419:0, v427:0, v420:0, v428:0, v421:0, v429:0, v430:0, v431:0, v432:0, v433:0, 0, v416:0, v425:0, v422:0, v423:0, 3, 7, 2, 4, 8) -> f_406(v408:0, v409:0, v410:0, v411:0, v412:0, 1 + v446:0, v446:0, 1, 1 + v417:0, v418:0, v426:0, v419:0, v427:0, v420:0, v428:0, v421:0, v429:0, v430:0, v431:0, v432:0, v433:0, 0, v417:0, v425:0, v422:0, v423:0, 3, 7, 2, 4, 8) :|: v446:0 > -1 && v417:0 > 1 && v430:0 > 2
Filtered unneeded arguments:
   f_406(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24, x25, x26, x27, x28, x29, x30, x31) -> f_406(x7, x9, x18)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_406(sum~cons_1~v446:0, v417:0, v430:0) -> f_406(v446:0, 1 + v417:0, v430:0) :|: v417:0 > 1 && v430:0 > 2 && v446:0 > -1 && sum~cons_1~v446:0 = 1 + v446:0

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

(8)
Obligation:
Rules:
f_406(sum~cons_1~v446:0, v417:0, v430:0) -> f_406(v446:0, 1 + v417:0, v430:0) :|: v417:0 > 1 && v430:0 > 2 && v446:0 > -1 && sum~cons_1~v446:0 = 1 + v446:0

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

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

(10)
Obligation:
Rules:
f_406(sum~cons_1~v446:0:0, v417:0:0, v430:0:0) -> f_406(v446:0:0, 1 + v417:0:0, v430:0:0) :|: v417:0:0 > 1 && v430:0:0 > 2 && v446:0:0 > -1 && sum~cons_1~v446:0:0 = 1 + v446:0:0

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

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

The following rules are decreasing:
f_406(sum~cons_1~v446:0:0, v417:0:0, v430:0:0) -> f_406(v446:0:0, 1 + v417:0:0, v430:0:0) :|: v417:0:0 > 1 && v430:0:0 > 2 && v446:0:0 > -1 && sum~cons_1~v446:0:0 = 1 + v446:0:0
The following rules are bounded:
f_406(sum~cons_1~v446:0:0, v417:0:0, v430:0:0) -> f_406(v446:0:0, 1 + v417:0:0, v430:0:0) :|: v417:0:0 > 1 && v430:0:0 > 2 && v446:0:0 > -1 && sum~cons_1~v446:0:0 = 1 + v446:0:0

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

(12)
YES