./deagle --no-assertions --datarace --32 /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.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/06_ticket.i
Converting
Type-checking 06_ticket
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 06_ticket file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i line 410
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/06_ticket.i:73:1)
[Warning][Deadcode] Function "__bswap_64" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:78:1)
[Warning][Deadcode] Function "__uint16_identity" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:83:1)
[Warning][Deadcode] Function "__uint32_identity" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:88:1)
[Warning][Deadcode] Function "__uint64_identity" will never be called: 1LoC (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:93:1)
[Warning][Race] Memory location now_serving@06_ticket.i:691:19 (race with conf. 110):
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:695:3)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:713:4)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:721:2)
  write with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:721:2)
[Warning][Race] Memory location next_ticket@06_ticket.i:690:19 (race with conf. 110):
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:695:3)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:700:4)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:701:4)
  write with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:701:4)
[Warning][Race] Memory location c@06_ticket.i:723:5 (race with conf. 110):
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:726:2)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:727:4)
  read with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:728:2)
  write with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:726:2)
  write with {} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i:728:2)

Summary for all memory locations:
	safe:            0
	vulnerable:      0
	unsafe:          3
	-------------------
	total:           3
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/06_ticket.i line 734 function main thread 0
Not unwinding loop main.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i line 734 function main thread 0
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
Unwinding loop acquire_lock.0 iteration 1 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i line 712 function acquire_lock thread 1
Not unwinding loop acquire_lock.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i line 712 function acquire_lock thread 1
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
Unwinding loop acquire_lock.0 iteration 1 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i line 712 function acquire_lock thread 2
Not unwinding loop acquire_lock.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i line 712 function acquire_lock thread 2
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/06_ticket.i | tee goblint/goblint_output: 0
Lines where datarace may occur: 695 696 700 701 702 713 714 721 722 726 727 728 729 
The number of races before goblint filter: 49
The number of races after goblint filter: 23
Race categories: 11
	726(1) - 726(1) c:
		c#2 c#8
		c#3 c#7
		c#3 c#8
	726(1) - 727(1) c:
		c#3 c#9
	726(1) - 728(1) c:
		c#2 c#11
		c#3 c#10
		c#3 c#11
	727(1) - 726(1) c:
		c#4 c#8
	727(1) - 728(1) c:
		c#4 c#11
	728(1) - 726(1) c:
		c#5 c#8
		c#6 c#7
		c#6 c#8
	728(1) - 727(1) c:
		c#6 c#9
	728(1) - 728(1) c:
		c#5 c#11
		c#6 c#10
		c#6 c#11
	713(1) - 721(1) now_serving:
		now_serving#4 now_serving#13
		now_serving#5 now_serving#13
	721(1) - 713(1) now_serving:
		now_serving#7 now_serving#10
		now_serving#7 now_serving#11
	721(1) - 721(1) now_serving:
		now_serving#6 now_serving#13
		now_serving#7 now_serving#12
		now_serving#7 now_serving#13
Runtime Symex: 0.19981s
Adding SC constraints
Shared __CPROVER_threads_exited: 2R/3W
Shared __CPROVER_next_thread_id: 1R/3W
Shared next_ticket: 2R/3W
Shared now_serving: 8R/3W
Shared c: 6R/5W
size of program expression: 378 steps
no slicing due to threads
Generated 0 VCC(s), 0 remaining after simplification
Runtime Postprocess Equation: 0.00144006s
Passing problem to propositional reduction
converting SSA
Runtime Convert SSA: 0.00283383s
Set Deagle solver's graph
Running propositional reduction
Post-processing
Runtime Post-process: 0.000231164s
Solving with Deagle's Closure solver
3933 variables, 12174 clauses
ClosureSolver finishes with 7 conflicts, 747 decisions, and 4548 propagations. 3 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000836044s
Runtime decision procedure: 0.00901504s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10828 clauses
ClosureSolver finishes with 8 conflicts, 1506 decisions, and 8590 propagations. 6 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000407197s
Runtime decision procedure: 0.000424107s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10829 clauses
ClosureSolver finishes with 8 conflicts, 2123 decisions, and 11906 propagations. 6 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000331396s
Runtime decision procedure: 0.000348025s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10830 clauses
ClosureSolver finishes with 8 conflicts, 2710 decisions, and 15222 propagations. 6 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000306105s
Runtime decision procedure: 0.000319347s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10831 clauses
ClosureSolver finishes with 8 conflicts, 3321 decisions, and 18538 propagations. 6 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000331526s
Runtime decision procedure: 0.000346717s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10832 clauses
ClosureSolver finishes with 8 conflicts, 3926 decisions, and 21854 propagations. 6 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000318396s
Runtime decision procedure: 0.000334695s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10833 clauses
ClosureSolver finishes with 9 conflicts, 4494 decisions, and 25266 propagations. 7 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000567971s
Runtime decision procedure: 0.000583712s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10834 clauses
ClosureSolver finishes with 9 conflicts, 5066 decisions, and 28535 propagations. 7 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000333585s
Runtime decision procedure: 0.000349225s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10835 clauses
ClosureSolver finishes with 9 conflicts, 5632 decisions, and 31804 propagations. 7 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000307795s
Runtime decision procedure: 0.000320117s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10836 clauses
ClosureSolver finishes with 9 conflicts, 6188 decisions, and 35073 propagations. 7 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000315735s
Runtime decision procedure: 0.000329726s
Running propositional reduction
Solving with Deagle's Closure solver
3933 variables, 10836 clauses
ClosureSolver finishes with 9 conflicts, 6792 decisions, and 38342 propagations. 7 theory propagations and 0 cycles included.
SAT checker: instance is SATISFIABLE
Runtime Solver: 0.000421547s
Runtime decision procedure: 0.000435728s

** Results:
/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/pthread-ext/06_ticket.i function main
[nodatarace.assertion.0] line 734 No data races on variable c between line 726 and line 726: FAILURE
[nodatarace.assertion.1] line 734 No data races on variable c between line 726 and line 727: FAILURE
[nodatarace.assertion.2] line 734 No data races on variable c between line 726 and line 728: FAILURE
[nodatarace.assertion.3] line 734 No data races on variable c between line 727 and line 726: FAILURE
[nodatarace.assertion.4] line 734 No data races on variable c between line 727 and line 728: FAILURE
[nodatarace.assertion.5] line 734 No data races on variable c between line 728 and line 726: FAILURE
[nodatarace.assertion.6] line 734 No data races on variable c between line 728 and line 727: FAILURE
[nodatarace.assertion.7] line 734 No data races on variable c between line 728 and line 728: FAILURE
[nodatarace.assertion.8] line 734 No data races on variable now_serving between line 713 and line 721: FAILURE
[nodatarace.assertion.9] line 734 No data races on variable now_serving between line 721 and line 713: FAILURE
[nodatarace.assertion.10] line 734 No data races on variable now_serving between line 721 and line 721: FAILURE

** 11 of 11 failed (12 iterations)
VERIFICATION FAILED
