+unsigned int reclaimNode1, reclaimNode2;
+
+static int procs = 2;
+
+
+/** This testcase can infer w2->release & w4->acquire.
+ The initial node that Head and Tail points to is 1, so when T3 enqueue with
+ node 2, and dequeue(get node 1), and enqueue node 1 again, the second time
+ it enqueues node 1 it actually first initialize node1->next. At the same
+ time in T2, it reads that node1->next (because it reads the old Tail at the
+ very beginning), then loads the Tail agian (w4), it can actully reads an old
+ value. And this is a bug because if node 1 is again dequeued, then for T2 to
+ update node1->next, it can potentially contaminate the memory...
+*/