NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 173 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 786 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 67 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [COMPLETE, 1383 ms]
(12) NO


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

(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: 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 slt %5 10
		br %6, %7, %12
	7:
		%8 = load %y
		%9 = sub 0 %8
		store %9, %x
		%10 = load %y
		%11 = add %10 1
		store %11, %y
		br %4
	12:
		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) SymbolicExecutionGraphToLassoProof (EQUIVALENT)
Converted SEGraph to 1 independent lasso.
----------------------------------------

(6)
Obligation:
Lasso
----------------------------------------

(7) Lasso2IRS (EQUIVALENT)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 34 rulesP rules:
f_117(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 4) -> f_118(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) :|: v45 < 10 && 0 <= 9 + v44 && 0 <= 8 + v46
f_118(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) -> f_120(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) :|: 0 = 0
f_120(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) -> f_122(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) :|: TRUE
f_122(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) -> f_124(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 9, 8, 4) :|: 0 = 0
f_124(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 9, 8, 4) -> f_125(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) :|: v51 + v46 = 0 && v51 <= 8
f_125(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) -> f_126(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) :|: TRUE
f_126(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) -> f_127(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 9, 8, 4) :|: 0 = 0
f_127(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 9, 8, 4) -> f_128(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) :|: v53 = 1 + v46 && 0 <= 7 + v53
f_128(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) -> f_129(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) :|: TRUE
f_129(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) -> f_130(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) :|: TRUE
f_130(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) -> f_116(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 4) :|: TRUE
f_116(v37, v38, v39, v40, v41, v42, 1, v44, v45, v46, v47, v48, v49, 0, 3, 9, 4) -> f_117(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 4) :|: 0 = 0
f_63 -> f_64(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2
f_64(v1, v2, 3, 1, 4) -> f_65(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4
f_65(v1, v3, v2, v4, 3, 1, 4) -> f_66(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6
f_66(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_67(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_67(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_68(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_68(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_69(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_69(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_70(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_70(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_71(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_71(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_72(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_72(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_73(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0
f_73(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_74(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4, 9) :|: v7 < 10
f_74(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4, 9) -> f_76(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) :|: 0 = 0
f_76(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) -> f_78(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) :|: TRUE
f_78(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) -> f_80(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) :|: 0 = 0
f_80(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) -> f_81(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) :|: v11 + v9 = 0
f_81(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) -> f_82(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) :|: TRUE
f_82(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) -> f_83(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) :|: 0 = 0
f_83(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) -> f_84(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) :|: v13 = 1 + v9
f_84(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) -> f_85(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) :|: TRUE
f_85(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) -> f_86(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) :|: TRUE
f_86(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) -> f_101(v1, v3, v5, v7, v9, v7, 1, v9, v11, v13, v2, v4, v6, 0, 3, 9, 4) :|: TRUE
f_101(v19, v20, v21, v22, v23, v24, 1, v26, v27, v28, v29, v30, v31, 0, 3, 9, 4) -> f_116(v19, v20, v21, v22, v23, v24, 1, v26, v27, v28, v29, v30, v31, 0, 3, 9, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_63 -> f_117(v1:0, v3:0, v5:0, v7:0, v9:0, v11:0, 1, v9:0, 1 + v9:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 0, 3, 9, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v11:0 + v9:0 = 0 && v7:0 < 10
f_117(v37:0, v38:0, v39:0, v40:0, v41:0, v45:0, 1, v44:0, v46:0, v47:0, v48:0, v49:0, 0, 3, 9, 4) -> f_117(v37:0, v38:0, v39:0, v40:0, v41:0, v51:0, 1, v46:0, 1 + v46:0, v47:0, v48:0, v49:0, 0, 3, 9, 4) :|: v44:0 > -10 && v45:0 < 10 && v46:0 > -9 && v51:0 < 9 && v51:0 + v46:0 = 0
Filtered unneeded arguments:
   f_117(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_117(x6, x8, x9)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_63 -> f_117(v11:0, v9:0, 1 + v9:0) :|: v11:0 + v9:0 = 0
f_117(v45:0, v44:0, v46:0) -> f_117(v51:0, v46:0, 1 + v46:0) :|: v45:0 < 10 && v44:0 > -10 && v46:0 > -9 && v51:0 + v46:0 = 0 && v51:0 < 9

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

(8)
Obligation:
Rules:
f_63 -> f_117(v11:0, v9:0, 1 + v9:0) :|: v11:0 + v9:0 = 0
f_117(v45:0, v44:0, v46:0) -> f_117(v51:0, v46:0, 1 + v46:0) :|: v45:0 < 10 && v44:0 > -10 && v46:0 > -9 && v51:0 + v46:0 = 0 && v51:0 < 9
Start term: f_63

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

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

   (f_63_3,1)
   (f_117_3,2)

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

(10)
Obligation:
START: 1;

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

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(oldX2 - 0);
assume(oldX0 < 10 && oldX1 > -10 && oldX2 > -9 && oldX3 + oldX2 = 0 && oldX3 < 9);
x0 := -(oldX2 - 0);
x1 := oldX2;
x2 := 1 + oldX2;
TO: 2;


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

(11) T2 (COMPLETE)
Found this recurrent set for cutpoint 5: oldX3+oldX4 <= 0 and 0 <= oldX3+oldX4 and x0-oldX3 <= 0 and 0 <= oldX3+x1 and 1 <= oldX3+x2 and oldX4+x0 <= 0 and oldX4-x1 <= 0 and oldX4-x2 <= -1 and x0+x1 <= 0 and 0 <= x0+x1 and x0+x2 <= 1 and 1 <= x0+x2 and x1-x2 <= -1 and x2-x1 <= 1 and x0+-9 <= 0 and -x1+-9 <= 0 and -x2+-8 <= 0

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

(12)
NO