Reachability can be computed from CNF inputs. This expects three separate DIMACS .cnf files as input:
./reach_algs/build/fromCNF s.cnf r.cnf t.cnfWhere s.cnf encodes the initial state(s), r.cnf encodes the transition relation, and t.cnf encodes the target state(s).
For a state-space of n variables, it is assumed that
s.cnfandt.cnfare CNF formulas over odd variables:{1, 3, ..., 2n-1}r.cnfis a CNF formula over odd and even variables{1, 3, ..., 2n-1} U {2, 4, ..., 2n}where the odd variables correspond to the source states, and the even variables are "primed copies" of the source variables and correspond to the target states of the transitions.