Support shrinking in idempotent graphs

[eborden]

On failure an idempotent graph should be able to shrink results to produce the smallest failure case possible. There are a lot of variables here. Should every value be shrunken iteratively? Should they all be shrunken at once? If shrinking causes the test not to fail do we immediately stop and use the last iteration or continue to the next value for shrinking?