Get rid of some initialisation which isn't really necessary and makes
which things more confusing.
Add in the glibc bug as a minimal_direct test.
Avoid an infinite loop in the interpreter if we get an interpreter
segfault immediately followed by a client one.
Add a new mode, icall, which looks for crashes due to bad indirect calls.
You generally don't want to have lots of threads waiting on the
same message, so try to avoid it by playing with the delay bias
strategy a little.
Final tweak to delay bias strategy: if the TX and RX sides have been
run equally often, delay both of them.  We then rely on the busy flag
to prevent us from self-deadlocking.
Unbreak the breakpoint-based patch skeleton.
Add a -l option to the test harness, to make it easier to specify a
log file.
Various tweaks to the test bugs.
Make the use of a fair lock in the CEP interpreter optional.
Tweak VERY_LOUD mode so that it dumps its logs at the end rather than
as you're going along.  This seems to reduce the probe effect a bit.
Fix a stupid deadlock bug in the unfair lock implementation.
Real, actual fix for the unfair lock deadlock.
Unrolling strlen to depth 64 is completely ridiculous; there's no way
the SMT solver can handle it.  Unroll to depth 8 instead.
Teach BDD quickSimplify that a < a is always false.
Teach BDD quick simplify more about the < operator.
Teach quickSimplify() more about the < operator.
Get rid of some redundant casts in the quick simplifier.
Do a final subst_eq pass on the verification condition, just to see if
it can eliminate anything.
Yet more rules for the < operator.