/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, 179 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 700 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 57 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [EQUIVALENT, 1015 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: "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
		%4 = load %y
		%5 = icmp slt %4 1
		br %5, %6, %7
	6:
		store 0, %1
		br %21
	7:
		br %8
	8:
		%9 = load %x
		%10 = icmp sge %9 0
		br %10, %11, %20
	11:
		%12 = load %x
		%13 = load %y
		%14 = sub %12 %13
		store %14, %x
		%15 = call i32 @__VERIFIER_nondet_int()
		store %15, %y
		%16 = load %y
		%17 = icmp slt %16 1
		br %17, %18, %19
	18:
		br %20
	19:
		br %8
	20:
		store 0, %1
		br %21
	21:
		%22 = load %1
		ret %22


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 16 rulesP rules:
f_173(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) -> f_174(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) :|: 0 <= v59 && 1 <= v56
f_174(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) -> f_176(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) :|: 0 = 0
f_176(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) -> f_178(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) :|: TRUE
f_178(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) -> f_180(v50, v51, v52, v53, v54, 0, v59, 1, v58, v60, v61, v62, v63, 3, 4) :|: 0 = 0
f_180(v50, v51, v52, v53, v54, 0, v59, 1, v58, v60, v61, v62, v63, 3, 4) -> f_182(v50, v51, v52, v53, v54, 0, v59, 1, v60, v61, v62, v63, 3, 4) :|: 0 = 0
f_182(v50, v51, v52, v53, v54, 0, v59, 1, v60, v61, v62, v63, 3, 4) -> f_184(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v61, v62, v63, 3, 4) :|: v79 + v60 = v59
f_184(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v61, v62, v63, 3, 4) -> f_186(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v61, v62, v63, 3, 4) :|: TRUE
f_186(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v61, v62, v63, 3, 4) -> f_187(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: TRUE
f_187(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_188(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: TRUE
f_188(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_189(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: 0 = 0
f_189(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_191(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: 1 <= v81
f_191(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_193(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: 0 = 0
f_193(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_195(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: TRUE
f_195(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_197(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: TRUE
f_197(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) -> f_172(v50, v51, v52, v53, v54, 0, v59, 1, v60, v79, v81, v61, v62, v63, 3, 4) :|: TRUE
f_172(v50, v51, v52, v53, v54, 0, v56, 1, v58, v59, v60, v61, v62, v63, 3, 4) -> f_173(v50, v51, v52, v53, v54, 0, v59, 1, v56, v58, v60, v61, v62, v63, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_173(v50:0, v51:0, v52:0, v53:0, v54:0, 0, v79:0 + v60:0, 1, v56:0, v58:0, v60:0, v61:0, v62:0, v63:0, 3, 4) -> f_173(v50:0, v51:0, v52:0, v53:0, v54:0, 0, v79:0, 1, v79:0 + v60:0, v60:0, v81:0, v61:0, v62:0, v63:0, 3, 4) :|: v56:0 > 0 && v81:0 > 0 && v79:0 + v60:0 > -1
Filtered unneeded arguments:
   f_173(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_173(x7, x9, x11)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_173(sum~v79:0~v60:0, v56:0, v60:0) -> f_173(v79:0, v79:0 + v60:0, v81:0) :|: v81:0 > 0 && v79:0 + v60:0 > -1 && v56:0 > 0 && sum~v79:0~v60:0 = v79:0 + v60:0

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

(8)
Obligation:
Rules:
f_173(sum~v79:0~v60:0, v56:0, v60:0) -> f_173(v79:0, v79:0 + v60:0, v81:0) :|: v81:0 > 0 && v79:0 + v60:0 > -1 && v56:0 > 0 && sum~v79:0~v60:0 = v79:0 + v60:0

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

(9) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f_173_3,1)

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

(10)
Obligation:
START: 0;

FROM: 0;
TO: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := oldX0 - oldX2;
oldX4 := nondet();
assume(oldX4 > 0 && oldX3 + oldX2 > -1 && oldX1 > 0 && oldX0 = oldX3 + oldX2);
x0 := oldX0 - oldX2;
x1 := oldX3 + oldX2;
x2 := oldX4;
TO: 1;


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

(11) T2 (EQUIVALENT)
No proof given by T2
----------------------------------------

(12)
YES