[Workload] Write a test that fails the linearizability checker.

Background:

In the case of a network partition, KV with sync writes compromises on the C in the CAP theorem (which represents linearizability specifically) and instead demonstrates sequentially consistency.

What's the task?

Write a test which demonstrates that using sync writes fails the linearizability checker under a network partition, but passes the sequential consistency checker.

Note that my initial understanding of the problem is incorrect, sequential consistency is also "not available during some types of network failures. Some or all nodes must pause operations in order to ensure safety."  (see: https://jepsen.io/consistency).

This changes the semantics of the test. The isolated node becomes "unavailable" from a process' perspective once the SDK observes a new cluster state with that node missing which perhaps means that sequential consistency may hold.