seq_verify [-b] [-f <filename>] [-h] [-p <partition method>] [-t <timeOut>] [-B] [-i] [-r] <filename> [<filename>]
Please read the documentation for the command
comb_verify before reading on. The concepts of roots and leaves
in this command are the same as for comb_verify, except for an
added constraint: the set of leaves has to be the set of all primary inputs.
This obviously produces the constraint that both networks have the
same number of primary inputs. Moreover, no pseudo inputs should be present
in the two networks being compared. The set of roots can be an arbitrary
subset of nodes.
The command verifies whether any state, where the values of two corresponding roots differ, can be reached from the set of initial states of the product machine. If this happens, a debug trace is provided.
The sequential verification is done by building the product finite state machine.
The command has two execution modes, just as for comb_verify.
In the first mode, two BLIF-MV files are given as arguments to the
command:
vis> seq_verify foo.mv bar.mvIn the second mode, a single BLIF-MV file is taken. This is network2. It is assumed that network1 is from a hierarchy that has already been read in. If a network is present at the current node (i.e. flatten_hierarchy has been executed), it is used for verification; otherwise the command does nothing.
vis> read_blifmv foo.mv vis> flatten_hierarchy vis> seq_verify bar.mvCommand options:
build_partition_mdds for more information). If this option is
not specified, then the default method "inout" is used.