However, they are still only guaranteed to be correct on a subset of the possible configurations.
when using a non-deterministic oracle for training in Algorithm 2, the function o(t; c, T ) returns true if T is reachable from c and t ∈ o n (c, T ).