/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, 157 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 2281 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) LLVM Symbolic Execution SCC
(7) SCC2IRS [SOUND, 107 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [EQUIVALENT, 1082 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: "mlog" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%x_ref = alloca *i32, align 8
		%res = alloca *i32, align 8
		store %x, %1
		%2 = alloca i8, numElementsLit: 4
		%3 = bitcast *i8 %2 to *i32
		store %3, %x_ref
		%4 = alloca i8, numElementsLit: 4
		%5 = bitcast *i8 %4 to *i32
		store %5, %res
		%6 = load %1
		%7 = load %x_ref
		store %6, %7
		%8 = load %res
		store 0, %8
		br %9
	9:
		%10 = load %x_ref
		%11 = load %10
		%12 = icmp sgt %11 1
		br %12, %13, %21
	13:
		%14 = load %x_ref
		%15 = load %14
		%16 = sdiv %15 2
		%17 = load %x_ref
		store %16, %17
		%18 = load %res
		%19 = load %18
		%20 = add %19 1
		store %20, %18
		br %9
	21:
		%22 = load %res
		%23 = load %22
		ret %23

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		%3 = call i32 @mlog(i32 %2)
		ret %3


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_292(v137, v138, v139, v140, v141, v142, v143, 1, v145, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_293(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_293(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_294(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 1 < v145
f_294(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_296(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_296(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_298(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: TRUE
f_298(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_300(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_300(v137, v138, v139, v140, v141, v142, v145, 1, v143, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_302(v137, v138, v139, v140, v141, v142, v145, 1, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_302(v137, v138, v139, v140, v141, v142, v145, 1, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_304(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: v156 = v145 / 2
f_304(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_306(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_306(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_307(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: TRUE
f_307(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_308(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_308(v137, v138, v139, v140, v141, v142, v145, 1, v156, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_309(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
f_309(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_310(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: v158 = 1 + v147 && 2 <= v158
f_310(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_311(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: TRUE
f_311(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_312(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: TRUE
f_312(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_291(v137, v138, v139, v140, v141, v142, v145, 1, v156, v147, v158, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: TRUE
f_291(v137, v138, v139, v140, v141, v142, v143, 1, v145, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) -> f_292(v137, v138, v139, v140, v141, v142, v143, 1, v145, v146, v147, v148, v149, v150, v151, v152, v153, v154, 0, 3, 7, 2, 4, 8) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_292(v137:0, v138:0, v139:0, v140:0, v141:0, v142:0, v143:0, 1, v145:0, v146:0, v147:0, v148:0, v149:0, v150:0, v151:0, v152:0, v153:0, v154:0, 0, 3, 7, 2, 4, 8) -> f_292(v137:0, v138:0, v139:0, v140:0, v141:0, v142:0, v145:0, 1, v156:0, v147:0, 1 + v147:0, v148:0, v149:0, v150:0, v151:0, v152:0, v153:0, v154:0, 0, 3, 7, 2, 4, 8) :|: v145:0 > 1 && v147:0 > 0 && v156:0 = v145:0 / 2
Filtered unneeded arguments:
   f_292(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24) -> f_292(x9, x11)
Removed division, modulo operations, cleaned up constraints. Obtained 3 rules.P rules:
f_292(v145:0, v147:0) -> f_292'(v145:0, v147:0) :|: v145:0 > 1 && v147:0 > 0
f_292'(v145:0, v147:0) -> f_292(div, 1 + v147:0) :|: v147:0 > 0 && v145:0 > 1 && v145:0 < 0 && v145:0 - 2 * div <= 0 && v145:0 - 2 * div > -2
f_292'(v145:0, v147:0) -> f_292(div, 1 + v147:0) :|: v145:0 > 1 && v147:0 > 0 && v145:0 - 2 * div < 2 && v145:0 - 2 * div >= 0

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

(8)
Obligation:
Rules:
f_292(v145:0, v147:0) -> f_292'(v145:0, v147:0) :|: v145:0 > 1 && v147:0 > 0
f_292'(x, x1) -> f_292(x2, 1 + x1) :|: x1 > 0 && x > 1 && x < 0 && x - 2 * x2 <= 0 && x - 2 * x2 > -2
f_292'(x3, x4) -> f_292(x5, 1 + x4) :|: x3 > 1 && x4 > 0 && x3 - 2 * x5 < 2 && x3 - 2 * x5 >= 0

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

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

   (f_292_2,1)
   (f_292'_2,2)

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

(10)
Obligation:
START: 0;

FROM: 0;
TO: 1;

FROM: 0;
TO: 2;

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

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := nondet();
assume(oldX1 > 0 && oldX0 > 1 && oldX0 < 0 && oldX0 - 2 * oldX2 <= 0 && oldX0 - 2 * oldX2 > -2);
x0 := oldX2;
x1 := 1 + oldX1;
TO: 1;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := nondet();
assume(oldX0 > 1 && oldX1 > 0 && oldX0 - 2 * oldX2 < 2 && oldX0 - 2 * oldX2 >= 0);
x0 := oldX2;
x1 := 1 + oldX1;
TO: 1;


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

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

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

(12)
YES