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


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 174 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 4527 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 75 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [EQUIVALENT, 1193 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: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "strlen_rec" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (p *i8) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca *i8, align 8
		store %p, %2
		%3 = load %2
		%4 = load %3
		%5 = sext i8 %4 to i32
		%6 = icmp eq %5 0
		br %6, %7, %8
	7:
		store 0, %1
		br %13
	8:
		%9 = load %2
		%10 = getelementptr %9, 1
		%11 = call i32 @strlen_rec(*i8 %10)
		%12 = add 1 %11
		store %12, %1
		br %13
	13:
		%14 = load %1
		ret %14

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%length1 = alloca i32, align 4
		%nondetString1 = alloca *i8, align 8
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		store %2, %length1
		%3 = load %length1
		%4 = icmp slt %3 1
		br %4, %5, %6
	5:
		store 1, %length1
		br %6
	6:
		%7 = load %length1
		%8 = sext i32 %7 to i64
		%9 = mul %8 1
		%10 = alloca i8, numElementsLit: %9
		store %10, %nondetString1
		%11 = load %length1
		%12 = sub %11 1
		%13 = sext i32 %12 to i64
		%14 = load %nondetString1
		%15 = getelementptr %14, %13
		store 0, %15
		%16 = load %nondetString1
		%17 = call i32 @strlen_rec(*i8 %16)
		%18 = load %1
		ret %18


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 14 rulesP rules:
f_235(v110, v121, v111, v112, v113, v114, v115, v116, v117, v118, v122, 0, v120, 3, 7, 1, 4, 8) -> f_236(v110, v121, v123, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) :|: 1 <= v123 && v124 = 7 + v123 && 8 <= v124
f_236(v110, v121, v123, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) -> f_237(v110, v121, v123, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) :|: TRUE
f_237(v110, v121, v123, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) -> f_238(v110, v121, v123, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) :|: 0 = 0
f_238(v110, v121, v123, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) -> f_239(v110, v121, v123, v126, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) :|: TRUE
f_239(v110, v121, v123, v126, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) -> f_240(v110, v121, v123, v126, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) :|: 0 = 0
f_240(v110, v121, v123, v126, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 4, 8) -> f_242(v110, v121, v123, v126, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 2, 4, 8) :|: v126 != 0 && v110 < v112 && 2 <= v112
f_242(v110, v121, v123, v126, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, 0, v120, 3, 7, 1, 2, 4, 8) -> f_244(v110, v121, v123, v126, 0, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) :|: 0 = 0
f_244(v110, v121, v123, v126, 0, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) -> f_246(v110, v121, v123, v126, 0, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) :|: TRUE
f_246(v110, v121, v123, v126, 0, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) -> f_248(v110, v121, v123, v126, 0, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) :|: 0 = 0
f_248(v110, v121, v123, v126, 0, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) -> f_250(v110, v121, v123, v126, 0, v128, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) :|: v128 = 1 + v110 && 2 <= v128
f_250(v110, v121, v123, v126, 0, v128, v111, v112, v113, v114, v115, v116, v117, v118, v122, v124, v120, 3, 7, 1, 2, 4, 8) -> f_252(v128, v111, v112, v113, v114, v115, v116, v117, v118, v121, v122, v123, v124, 0, v120, v110, v126, 3, 7, 1, 2, 4, 8) :|: 0 = 0
f_252(v128, v111, v112, v113, v114, v115, v116, v117, v118, v121, v122, v123, v124, 0, v120, v110, v126, 3, 7, 1, 2, 4, 8) -> f_255(v128, v111, v112, v113, v114, v115, v116, v117, v118, v121, v122, v123, v124, 0, v120, v110, v126, 3, 7, 1, 2, 4, 8) :|: TRUE
f_255(v128, v111, v112, v113, v114, v115, v116, v117, v118, v121, v122, v123, v124, 0, v120, v110, v126, 3, 7, 1, 2, 4, 8) -> f_232(v128, v111, v112, v113, v114, v115, v116, v117, v118, 0, v120, 3, 7, 1, 4, 8) :|: TRUE
f_232(v110, v111, v112, v113, v114, v115, v116, v117, v118, 0, v120, 3, 7, 1, 4, 8) -> f_235(v110, v121, v111, v112, v113, v114, v115, v116, v117, v118, v122, 0, v120, 3, 7, 1, 4, 8) :|: 1 <= v121 && v122 = 3 + v121 && 4 <= v122
Combined rules. Obtained 2 rulesP rules:
f_235(v110:0, v121:0, v111:0, v112:0, v113:0, v114:0, v115:0, v116:0, v117:0, v118:0, v122:0, 0, v120:0, 3, 7, 1, 4, 8) -> f_235(1 + v110:0, v121:1, v111:0, v112:0, v113:0, v114:0, v115:0, v116:0, v117:0, v118:0, 3 + v121:1, 0, v120:0, 3, 7, 1, 4, 8) :|: v123:0 > 0 && v112:0 > v110:0 && v126:0 < 0 && v112:0 > 1 && v110:0 > 0 && v121:1 > 0
f_235(v110:0, v121:0, v111:0, v112:0, v113:0, v114:0, v115:0, v116:0, v117:0, v118:0, v122:0, 0, v120:0, 3, 7, 1, 4, 8) -> f_235(1 + v110:0, v121:1, v111:0, v112:0, v113:0, v114:0, v115:0, v116:0, v117:0, v118:0, 3 + v121:1, 0, v120:0, 3, 7, 1, 4, 8) :|: v123:0 > 0 && v112:0 > v110:0 && v126:0 > 0 && v112:0 > 1 && v110:0 > 0 && v121:1 > 0
Filtered unneeded arguments:
   f_235(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18) -> f_235(x1, x4)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_235(v110:0, v112:0) -> f_235(1 + v110:0, v112:0) :|: v112:0 > 1 && v110:0 > 0 && v112:0 > v110:0

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

(8)
Obligation:
Rules:
f_235(v110:0, v112:0) -> f_235(1 + v110:0, v112:0) :|: v112:0 > 1 && v110:0 > 0 && v112:0 > v110:0

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

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

   (f_235_2,1)

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

(10)
Obligation:
START: 0;

FROM: 0;
TO: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 > 1 && oldX0 > 0 && oldX1 > oldX0);
x0 := 1 + oldX0;
x1 := oldX1;
TO: 1;


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

(11) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 1, 3, 4 using the following rank functions:
    - Rank function 1:
      RF for loc. 5: 1-2*x0+2*x1
      RF for loc. 6: -2*x0+2*x1
      Bound for (chained) transitions 3: 2
      Bound for (chained) transitions 4: 2
    - Rank function 2:
      RF for loc. 5: 1
      RF for loc. 6: 0
      Bound for (chained) transitions 1: 1

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

(12)
YES