/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 172 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 887 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 35 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) CaseAnalysis [EQUIVALENT, 18 ms]
(12) AND
    (13) IntTRS
        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (15) IntTRS
        (16) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (17) YES
    (18) IntTRS
        (19) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (20) IntTRS
        (21) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (22) 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: true 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
		%y = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %x
		%3 = call i32 (...)* @__VERIFIER_nondet_int()
		store %3, %y
		br %4
	4:
		%5 = load %x
		%6 = icmp sgt %5 0
		br %6, %7, %13
	7:
		%8 = load %x
		%9 = load %y
		%10 = add %8 %9
		store %10, %x
		%11 = load %y
		%12 = add %11 -1
		store %12, %y
		br %4
	13:
		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 13 rulesP rules:
f_123(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_124(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 < v45
f_124(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_126(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_126(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_128(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: TRUE
f_128(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) -> f_130(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_130(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 4) -> f_131(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_131(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 4) -> f_132(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) :|: v51 = v45 + v46
f_132(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) -> f_133(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) :|: TRUE
f_133(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 4) -> f_134(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 4) :|: 0 = 0
f_134(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 4) -> f_135(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: 1 + v53 = v46
f_135(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) -> f_136(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: TRUE
f_136(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) -> f_137(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: TRUE
f_137(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) -> f_122(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 4) :|: TRUE
f_122(v37, v38, v39, v40, v41, v42, 1, v44, v45, v46, v47, v48, v49, 0, 3, 4) -> f_123(v37, v38, v39, v40, v41, v45, 1, v42, v44, v46, v47, v48, v49, 0, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_123(v37:0, v38:0, v39:0, v40:0, v41:0, v45:0, 1, v42:0, v44:0, 1 + v53:0, v47:0, v48:0, v49:0, 0, 3, 4) -> f_123(v37:0, v38:0, v39:0, v40:0, v41:0, v45:0 + (1 + v53:0), 1, v45:0, 1 + v53:0, v53:0, v47:0, v48:0, v49:0, 0, 3, 4) :|: v45:0 > 0
Filtered unneeded arguments:
   f_123(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_123(x6, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_123(v45:0, sum~cons_1~v53:0) -> f_123(v45:0 + (1 + v53:0), v53:0) :|: v45:0 > 0 && sum~cons_1~v53:0 = 1 + v53:0

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

(8)
Obligation:
Rules:
f_123(v45:0, sum~cons_1~v53:0) -> f_123(v45:0 + (1 + v53:0), v53:0) :|: v45:0 > 0 && sum~cons_1~v53:0 = 1 + v53:0

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

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

(10)
Obligation:
Rules:
f_123(v45:0:0, sum~cons_1~v53:0:0) -> f_123(v45:0:0 + (1 + v53:0:0), v53:0:0) :|: v45:0:0 > 0 && sum~cons_1~v53:0:0 = 1 + v53:0:0

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

(11) CaseAnalysis (EQUIVALENT)
Found the following inductive condition: 
f_123(x, x1): -1 - 4*x1>=0

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

(12)
Complex Obligation (AND)

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

(13)
Obligation:
Rules:
f_123(v45:0:0, sum~cons_1~v53:0:0) -> f_123(v45:0:0 + (1 + v53:0:0), v53:0:0) :|: v45:0:0 > 0 && sum~cons_1~v53:0:0 = 1 + v53:0:0 && -1 + -4 * sum~cons_1~v53:0:0 >= 0

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

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

(15)
Obligation:
Rules:
f_123(v45:0:0:0, sum~cons_1~v53:0:0:0) -> f_123(v45:0:0:0 + (1 + v53:0:0:0), v53:0:0:0) :|: 1 <= -4 * (1 + v53:0:0:0) && v45:0:0:0 > 0 && sum~cons_1~v53:0:0:0 = 1 + v53:0:0:0

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

(16) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_123(x, x1)] = -1 + x

The following rules are decreasing:
f_123(v45:0:0:0, sum~cons_1~v53:0:0:0) -> f_123(v45:0:0:0 + (1 + v53:0:0:0), v53:0:0:0) :|: 1 <= -4 * (1 + v53:0:0:0) && v45:0:0:0 > 0 && sum~cons_1~v53:0:0:0 = 1 + v53:0:0:0
The following rules are bounded:
f_123(v45:0:0:0, sum~cons_1~v53:0:0:0) -> f_123(v45:0:0:0 + (1 + v53:0:0:0), v53:0:0:0) :|: 1 <= -4 * (1 + v53:0:0:0) && v45:0:0:0 > 0 && sum~cons_1~v53:0:0:0 = 1 + v53:0:0:0

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

(17)
YES

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

(18)
Obligation:
Rules:
f_123(v45:0:0, sum~cons_1~v53:0:0) -> f_123(v45:0:0 + (1 + v53:0:0), v53:0:0) :|: v45:0:0 > 0 && sum~cons_1~v53:0:0 = 1 + v53:0:0 && -1 + -4 * sum~cons_1~v53:0:0 < 0

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

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

(20)
Obligation:
Rules:
f_123(v45:0:0:0, sum~cons_1~v53:0:0:0) -> f_123(v45:0:0:0 + (1 + v53:0:0:0), v53:0:0:0) :|: 1 > -4 * (1 + v53:0:0:0) && v45:0:0:0 > 0 && sum~cons_1~v53:0:0:0 = 1 + v53:0:0:0

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

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

The following rules are decreasing:
f_123(v45:0:0:0, sum~cons_1~v53:0:0:0) -> f_123(v45:0:0:0 + (1 + v53:0:0:0), v53:0:0:0) :|: 1 > -4 * (1 + v53:0:0:0) && v45:0:0:0 > 0 && sum~cons_1~v53:0:0:0 = 1 + v53:0:0:0
The following rules are bounded:
f_123(v45:0:0:0, sum~cons_1~v53:0:0:0) -> f_123(v45:0:0:0 + (1 + v53:0:0:0), v53:0:0:0) :|: 1 > -4 * (1 + v53:0:0:0) && v45:0:0:0 > 0 && sum~cons_1~v53:0:0:0 = 1 + v53:0:0:0

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

(22)
YES