.\" Manual page for lpsinvelm version 201409.0 (Release). .\"
.\" Generated from lpsinvelm --generate-man-page. .\"
.TH LPSINVELM "1" "September 2017" "lpsinvelm mCRL2 toolset 201409.0 (Release)" "User Commands"
.SH NAME
lpsinvelm \- check invariants and use these to simplify or eliminate summands of an LPS
.SH SYNOPSIS
.B lpsinvelm
[\fIOPTION\fR]... --invfile=INVFILE [\fIINFILE\fR [\fIOUTFILE\fR]]
.SH DESCRIPTION
Checks whether the boolean formula (an mCRL2 data expression of sort Bool) 
provided as invariant is an invariant of the linear process specification (LPS) 
in INFILE. If this is the case, the tool eliminates all summands of the LPS 
whose condition violates the invariant, and writes the result to OUTFILE. If 
INFILE is present, stdin is used. If OUTFILE is not present, stdout is used.

The tool can also be used to simplify the conditions of the summands of the 
given LPS.
.SH OPTIONS
.TP
\fIOPTION\fR can be any of the following:
.TP
\fB-y\fR, \fB--all-violations\fR
do not terminate as soon as a single violation of the invariant is found, but 
report all violations instead
.TP
\fB-c\fR, \fB--counter-example\fR
display a valuation indicating why the invariant could possibly be violated if 
it is uncertain whether a summand violates the invariant
.TP
\fB-o\fR, \fB--induction\fR
apply induction on lists
.TP
\fB-i\fR\fIINVFILE\fR, \fB--invariant\fR=\fIINVFILE\fR
use the boolean formula (an mCRL2 data expression of sort Bool) in INVFILE as 
invariant
.TP
\fB-n\fR, \fB--no-check\fR
do not check if the invariant holds before eliminating unreachable summands
.TP
\fB-e\fR, \fB--no-elimination\fR
do not eliminate or simplify summands, but add the invariant to each condition
.TP
\fB-p\fR\fIPREFIX\fR, \fB--print-dot\fR=\fIPREFIX\fR
save a \&.dot file of the resulting BDD if it is impossible to determine whether 
a summand violates the invariant; PREFIX will be used as prefix of the output 
files
.TP
\fB-Q\fR\fINUM\fR, \fB--qlimit\fR=\fINUM\fR
limit enumeration of quantifiers to NUM variables\&. (Default NUM=1000, NUM=0 for 
unlimited)\&.
.TP
\fB-r\fR\fINAME\fR, \fB--rewriter\fR=\fINAME\fR
use rewrite strategy NAME:
\&'jitty\&' jitty rewriting (default)
\&'jittyc\&' compiled jitty rewriting
\&'jittyp\&' jitty rewriting with prover
.TP
\fB-l\fR, \fB--simplify-all\fR
simplify the conditions of all summands, instead of just eliminating the 
summands whose conditions in conjunction with the invariant are contradictions
.TP
\fB-z\fR\fISOLVER\fR, \fB--smt-solver\fR=\fISOLVER\fR
use SOLVER to remove inconsistent paths from the internally used BDDs (by 
default, no path elimination is applied):
\&'cvc\&' the SMT solver CVC3
.TP
\fB-t\fR\fILIMIT\fR, \fB--time-limit\fR=\fILIMIT\fR
spend at most LIMIT seconds on proving a single formula
.TP
\fB--timings\fR[=\fIFILE\fR]
append timing measurements to FILE\&. Measurements are written to standard error 
if no FILE is provided
.TP
Standard options:
.TP
\fB-q\fR, \fB--quiet\fR
do not display warning messages
.TP
\fB-v\fR, \fB--verbose\fR
display short intermediate messages
.TP
\fB-d\fR, \fB--debug\fR
display detailed intermediate messages
.TP
\fB--log-level\fR=\fILEVEL\fR
display intermediate messages up to and including level
.TP
\fB-h\fR, \fB--help\fR
display help information
.TP
\fB--version\fR
display version information

.SH AUTHOR
Written by Luc Engelen.
.SH "REPORTING BUGS"
Report bugs at <http://www.mcrl2.org/issuetracker>.
.SH COPYRIGHT
Copyright \(co 2014 Technische Universiteit Eindhoven.
.br
This is free software.  You may redistribute copies of it under the
terms of the Boost Software License <http://www.boost.org/LICENSE_1_0.txt>.
There is NO WARRANTY, to the extent permitted by law.
.SH "SEE ALSO"
See also the manual at <http://www.mcrl2.org/release/user_manual/tools/lpsinvelm.html>.