./deagle --no-assertions --datarace --32 /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i


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


Deagle version 2.1 64-bit x86_64 linux
which contains:
CBMC version 5.67.0 (SVCOMP2023_221122-2-g2121ef1a2) 64-bit x86_64 linux
Parsing /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i
Converting
Type-checking 46_monabsex2_vs-b
Generating GOTO Program
Adding CPROVER library (x86_64)
file <builtin-library-pthread_create> line 20: warning: pointer parameter types differ between declaration and definition "pthread_create"
old definition in module 46_monabsex2_vs-b file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i line 404
signed int (pthread_t *, const pthread_attr_t *, void * (*)(void *), void *)
new definition in module <built-in-library> file <builtin-library-pthread_create> line 20
signed int (pthread_t *thread, const pthread_attr_t *attr, void * (*start_routine)(void *), void *arg)
Removal of function pointers and virtual functions
file <builtin-library-__spawned_thread> line 34 function __spawned_thread: replacing function pointer by 1 possible targets
Generic Property Instrumentation
Running with 8 object bits, 24 offset bits (default)
Starting Bounded Model Checking
[Warning][Deadcode] Function "__bswap_32" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:67:1)
[Warning][Deadcode] Function "__bswap_64" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:72:1)
[Warning][Deadcode] Function "__uint16_identity" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:77:1)
[Warning][Deadcode] Function "__uint32_identity" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:82:1)
[Warning][Deadcode] Function "__uint64_identity" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:87:1)
[Warning][Race] Memory location l@46_monabsex2_vs-b.i:685:7 (race with conf. 110):
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:688:4)
  write with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:690:2)
[Warning][Race] Memory location s@46_monabsex2_vs-b.i:684:7 (race with conf. 110):
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:688:4)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:689:3)
  write with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i:689:3)

Summary for all memory locations:
	safe:            0
	vulnerable:      0
	unsafe:          2
	-------------------
	total:           2
Use SV-COMP unwinding strategy: 2
Deagle's solver is set!!!!!!
Unwinding loop main.0 iteration 1 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i line 696 function main thread 0
Not unwinding loop main.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i line 696 function main thread 0
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
Handling datarace, passing the problem to goblint first
getcwd: /mnt/goblint-svcomp/benchexec/tools-pldi/deagle
/mnt/goblint-svcomp/benchexec/tools-pldi/deagle/goblint/goblint /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i | tee goblint/goblint_output: 0
Lines where datarace may occur: 688 689 690 691 
The number of races before goblint filter: 18
The number of races after goblint filter: 8
Race categories: 6
	688(1) - 690(1) l:
		l#2 l#5
	690(1) - 688(1) l:
		l#3 l#4
	690(1) - 690(1) l:
		l#3 l#5
	688(1) - 689(1) s:
		s#2 s#7
	689(1) - 688(1) s:
		s#4 s#5
	689(1) - 689(1) s:
		s#3 s#7
		s#4 s#6
		s#4 s#7
Runtime Symex: 0.094492s
Adding SC constraints
Shared __CPROVER_threads_exited: 2R/3W
Shared __CPROVER_next_thread_id: 1R/3W
Shared s: 4R/3W
Shared l: 2R/3W
size of program expression: 213 steps
no slicing due to threads
Generated 0 VCC(s), 0 remaining after simplification
Runtime Postprocess Equation: 0.000472458s
Passing problem to propositional reduction
converting SSA
Runtime Convert SSA: 0.000631901s
Set Deagle solver's graph
Running propositional reduction
Post-processing
Runtime Post-process: 0.000222273s
Solving with Deagle's Closure solver
800 variables, 1162 clauses
ClosureSolver finishes with 6 conflicts, 258 decisions, and 829 propagations. 1 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000390577s
Runtime decision procedure: 0.00456501s
Running propositional reduction
Solving with Deagle's Closure solver
800 variables, 492 clauses
ClosureSolver finishes with 6 conflicts, 493 decisions, and 1222 propagations. 1 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 8.6051e-05s
Runtime decision procedure: 9.6931e-05s
Running propositional reduction
Solving with Deagle's Closure solver
800 variables, 493 clauses
ClosureSolver finishes with 6 conflicts, 728 decisions, and 1615 propagations. 1 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 7.4841e-05s
Runtime decision procedure: 8.3951e-05s
Running propositional reduction
Solving with Deagle's Closure solver
800 variables, 494 clauses
ClosureSolver finishes with 6 conflicts, 966 decisions, and 2008 propagations. 1 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 7.245e-05s
Runtime decision procedure: 8.1522e-05s
Running propositional reduction
Solving with Deagle's Closure solver
800 variables, 495 clauses
ClosureSolver finishes with 6 conflicts, 1202 decisions, and 2401 propagations. 1 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 6.9811e-05s
Runtime decision procedure: 7.859e-05s
Running propositional reduction
Solving with Deagle's Closure solver
800 variables, 495 clauses
ClosureSolver finishes with 6 conflicts, 1448 decisions, and 2794 propagations. 1 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 8.2742e-05s
Runtime decision procedure: 9.1682e-05s

** Results:
/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i function main
[nodatarace.assertion.0] line 696 No data races on variable l between line 688 and line 690: FAILURE
[nodatarace.assertion.1] line 696 No data races on variable l between line 690 and line 688: FAILURE
[nodatarace.assertion.2] line 696 No data races on variable l between line 690 and line 690: FAILURE
[nodatarace.assertion.3] line 696 No data races on variable s between line 688 and line 689: FAILURE
[nodatarace.assertion.4] line 696 No data races on variable s between line 689 and line 688: FAILURE
[nodatarace.assertion.5] line 696 No data races on variable s between line 689 and line 689: FAILURE

** 6 of 6 failed (7 iterations)
VERIFICATION FAILED
