/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


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


NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 178 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 495 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms]
(6) LLVM Symbolic Execution Lasso
(7) Lasso2IRS [EQUIVALENT, 39 ms]
(8) IntTRS
(9) IRS2T2 [EQUIVALENT, 0 ms]
(10) T2IntSys
(11) T2 [COMPLETE, 1015 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
		%c = alloca i32, align 4
		%x = alloca i32, align 4
		store 0, %1
		%2 = call i32 (...)* @__VERIFIER_nondet_int()
		store %2, %c
		%3 = call i32 (...)* @__VERIFIER_nondet_int()
		store %3, %x
		br %4
	4:
		%5 = load %x
		%6 = icmp sge %5 0
		br %6, %7, %11
	7:
		%8 = load %c
		%9 = load %x
		%10 = add %9 %8
		store %10, %x
		br %4
	11:
		%12 = load %1
		ret %12


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 29 rulesP rules:
f_97(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) -> f_98(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) :|: 0 <= v22
f_98(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) -> f_100(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) :|: 0 = 0
f_100(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) -> f_102(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) :|: TRUE
f_102(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) -> f_104(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) :|: 0 = 0
f_104(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) -> f_106(v15, v16, v17, v18, v19, v22, 1, v23, v24, v25, 0, 3, 4) :|: 0 = 0
f_106(v15, v16, v17, v18, v19, v22, 1, v23, v24, v25, 0, 3, 4) -> f_107(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) :|: v27 = v22 + v18
f_107(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) -> f_108(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) :|: TRUE
f_108(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) -> f_109(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) :|: TRUE
f_109(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) -> f_96(v15, v16, v17, v18, v19, v22, 1, v27, v23, v24, v25, 0, 3, 4) :|: TRUE
f_96(v15, v16, v17, v18, v19, v20, 1, v22, v23, v24, v25, 0, 3, 4) -> f_97(v15, v16, v17, v18, v19, v22, 1, v20, v23, v24, v25, 0, 3, 4) :|: 0 = 0
f_60 -> f_61(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2
f_61(v1, v2, 3, 1, 4) -> f_62(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4
f_62(v1, v3, v2, v4, 3, 1, 4) -> f_63(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6
f_63(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_64(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_64(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_65(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_65(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_66(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_66(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_67(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_67(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_68(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_68(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_69(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE
f_69(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_70(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0
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) :|: 0 <= v9
f_71(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_73(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_73(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_75(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: TRUE
f_75(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_77(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_77(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_79(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) :|: 0 = 0
f_79(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4) -> f_80(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: v11 = v9 + v7
f_80(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_81(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: TRUE
f_81(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_82(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: TRUE
f_82(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4) -> f_96(v1, v3, v5, v7, v9, v9, 1, v11, v2, v4, v6, 0, 3, 4) :|: TRUE
Combined rules. Obtained 2 rulesP rules:
f_60 -> f_97(v1:0, v3:0, v5:0, v7:0, v9:0, v9:0 + v7:0, 1, v9:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 0, 3, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v9:0 > -1
f_97(v15:0, v16:0, v17:0, v18:0, v19:0, v22:0, 1, v20:0, v23:0, v24:0, v25:0, 0, 3, 4) -> f_97(v15:0, v16:0, v17:0, v18:0, v19:0, v22:0 + v18:0, 1, v22:0, v23:0, v24:0, v25:0, 0, 3, 4) :|: v22:0 > -1
Filtered unneeded arguments:
   f_97(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14) -> f_97(x4, x6)
Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules:
f_60 -> f_97(v7:0, v9:0 + v7:0) :|: v9:0 > -1
f_97(v18:0, v22:0) -> f_97(v18:0, v22:0 + v18:0) :|: v22:0 > -1

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

(8)
Obligation:
Rules:
f_60 -> f_97(v7:0, v9:0 + v7:0) :|: v9:0 > -1
f_97(v18:0, v22:0) -> f_97(v18:0, v22:0 + v18:0) :|: v22:0 > -1
Start term: f_60

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

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

   (f_60_2,1)
   (f_97_2,2)

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

(10)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := nondet();
oldX3 := nondet();
assume(oldX3 > -1);
x0 := oldX2;
x1 := oldX3 + oldX2;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 > -1);
x0 := oldX0;
x1 := oldX1 + oldX0;
TO: 2;


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

(11) T2 (COMPLETE)
Found this recurrent set for cutpoint 5: oldX0 == 0 and oldX2 == 0 and oldX3 == 0 and x0 == 0 and x1 == 0

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

(12)
NO