Front end support for integer AND (#4717)
[cvc5.git] / NEWS
1 This file contains a summary of important user-visible changes.
2
3 Changes since 1.8
4 =================
5
6 New Features:
7 * A new parametric theory of sequences whose syntax is compatible with the
8 syntax for sequences used by Z3.
9 * Arrays: Added support for an `eqrange` predicate. `(eqrange a b i j)` is true
10 if arrays `a` and `b` are equal on all indices within indices `i` and `j`.
11 * Support for an integer operator `(_ iand n)` that returns the bitwise `and`
12 of two integers, seen as integers modulo n.
13
14 Improvements:
15 * New API: Added functions to retrieve the heap/nil term when using separation
16 logic.
17
18 Changes:
19 * SyGuS: Removed support for SyGuS-IF 1.0.
20 * Removed Java and Python bindings for the legacy API
21
22 Changes since 1.7
23 =================
24
25 New Features:
26 * New C++ and Python API: CVC4 has a new, more streamlined API. We plan to
27 make CVC4 1.8 the last version that ships with the legacy API.
28 * Strings: Full support of the new SMT-LIB standard for the theory of strings,
29 including:
30 * Support for `str.replace_re`, `str.replace_re_all`, `str.is_digit`,
31 `str.from_code`, `re.diff`, and `re.comp`
32 * Support for new operator names (e.g. `str.in_re` instead of `str.in.re`),
33 new escape sequences. The new syntax is enabled by default for smt2 files.
34 * Support for syntax-guided synthesis (SyGuS) problems in the new API. C++
35 examples of the SyGuS API can be found in `./examples/api/sygus_*.cpp`.
36 * Support for higher-order constraints. This includes treating function sorts
37 (constructible by `->`) as first-class sorts and handling partially applied
38 function symbols. Support for higher-order constraints can be enabled by
39 the option `--uf-ho`.
40 * Support for set comprehension binders `comprehension`.
41 * Eager bit-blasting: Support for SAT solver Kissat.
42
43 Improvements:
44 * API: Function definitions can now be requested to be global. If the `global`
45 parameter is set to true, they persist after popping the user context.
46 * Java/Python bindings: The bindings now allow users to catch exceptions
47 * Arithmetic: Performance improvements
48 * Linear solver: New lemmas inspired by unit-cube tests
49 * Non-linear solver: Expanded set of axioms
50 * Ackermannization: The Ackermannization preprocessing pass now supports
51 uninterpreted sorts and as a result all QF_UFBV problems are supported in
52 combination with eager bit blasting.
53
54 Changes:
55 * CVC language: Models printed in the CVC language now include an explicit end
56 marker to facilitate the communication over pipes with CVC4.
57 * API change: `SmtEngine::query()` has been renamed to
58 `SmtEngine::checkEntailed()` and `Result::Validity` has been renamed to
59 `Result::Entailment` along with corresponding changes to the enum values.
60 * Java API change: The name of CVC4's package is now `edu.stanford.CVC4`
61 instead of `edu.nyu.acsys.CVC4`.
62 * The default output language is changed from CVC to SMT-LIB 2.6. The
63 default output language is used when the problem language cannot be
64 easily inferred (for example when CVC4 is used from the API).
65 * Printing of BV constants: previously CVC4 would print BV constant
66 values as indexed symbols by default and in binary notation with the
67 option --bv-print-consts-in-binary. To be SMT-LIB compliant the
68 default behavior is now to print BV constant values in binary
69 notation and as indexed symbols with the new option
70 --bv-print-consts-as-indexed-symbols. The option
71 --bv-print-consts-in-binary has been removed.
72 * Updated to SyGuS language version 2.0 by default. This is the last release
73 that will support the SyGuS language version 1.0 (`--lang=sygus1`). A
74 script is provided to convert version 1.0 files to version 2.0, see
75 `./contrib/sygus-v1-to-v2.sh`.
76 * Support for user-provided rewrite rule quantifiers have been removed.
77 * Support for certain option aliases have been removed.
78 * Support for parallel portfolio builds has been removed.
79
80 Changes since 1.6
81 =================
82
83 New Features:
84 * Proofs:
85 * Support for bit-vector proofs with eager bitblasting (older versions only
86 supported proofs with lazy bitblasting).
87 * Strings:
88 * Support for `str.replaceall` operator.
89 * New option `--re-elim` to reduce regular expressions to extended string
90 operators, resulting in better performance on regular expression benchmarks
91 (enabled by default).
92 * SyGuS:
93 * Support for abduction (`--sygus-abduct`). Given a formula, this option uses
94 CVC4's SyGuS solver to find a sufficient condition such that the
95 conjunction of the condition and the formula is unsatisfiable.
96 * Support for two new term enumerator strategies: variable agnostic
97 (`--sygus-active-gen=var-agnostic`) and fast (`--sygus-active-gen=enum`).
98 By default, CVC4 tries to choose the best term enumerator strategy
99 automatically based on the input (`--sygus-active-gen=auto`).
100 * Support for streaming solutions of increasingly smaller size when using the
101 PBE solver (`--sygus-stream --sygus-pbe`). After the first solution is found
102 and printed, the solver will continue to look for new solutions and print
103 those, if any, that are smaller than previously printed solutions.
104 * Support for unification-based techniques in non-separable specifications
105 (`--sygus-unif`). For solving invariant problems a dedicate mode
106 (`--sygus-unif-boolean-heuristic-dt`) is available that builds candidate
107 solutions using heuristic decision tree learning.
108
109 Improvements:
110 * Strings:
111 * Significantly better performance on string benchmarks over the core theory
112 and those with extended string functions like substring, contains, and
113 replace.
114
115 Changes:
116 * API change: Expr::iffExpr() is renamed to Expr::eqExpr() to reflect its
117 actual behavior.
118 * Compiling the language bindings now requires SWIG 3 instead of SWIG 2.
119 * The CVC3 compatibility layer has been removed.
120 * The build system now uses CMake instead of Autotools. Please refer to
121 [INSTALL.md](https://github.com/CVC4/CVC4/blob/master/INSTALL.md) for
122 up-to-date instructions on how to build CVC4.
123
124 Changes since 1.5
125 =================
126
127 New Features:
128 * A new theory of floating points.
129 * Novel approach for solving quantified bit-vectors (BV).
130 * Eager bit-blasting: Support for SAT solver CaDiCaL.
131 * A new Gaussian Elimination preprocessing pass for the theory of bit-vectors.
132 * Support for transcendental functions (sin, cos, exp). In SMT2 input, this
133 can be enabled by adding T to the logic (e.g., QF_NRAT).
134 * Support for new operators in strings, including string inequality (str.<=)
135 and string code (str.code).
136 * Support for automated rewrite rule generation from sygus (*.sy) inputs using
137 syntax-guided enumeration (option --sygus-rr).
138
139 Improvements:
140 * Incremental unsat core support.
141 * Further development of rewrite rules for the theory of strings and regular
142 expressions.
143 * Many optimizations for syntax-guided synthesis, including improved symmetry
144 breaking for enumerative search and specialized algorithms for
145 programming-by-examples conjectures.
146
147 Changes:
148 * Eager bit-blasting: Removed support for SAT solver CryptoMinisat 4, added
149 support for CryptoMinisat 5.
150 * The LFSC proof checker now resides in its own repository on GitHub at
151 https://github.com/CVC4/LFSC. It is not distributed with CVC4 anymore.
152
153 Changes since 1.4
154 =================
155
156 * Improved heuristics for reasoning about non-linear arithmetic.
157 * Native support for syntax-guided synthesis (sygus).
158 * Support for many new heuristics for reasoning with quantifiers, including
159 finite model finding.
160 * Support for proofs for uninterpreted functions, arrays, bitvectors, and
161 their combinations.
162 * Performance improvements to existing theories.
163 * A new theory of sets with cardinality and relations.
164 * A new theory of strings.
165 * Support for unsat cores.
166 * Support for separation logic constraints.
167 * Simplification mode "incremental" no longer supported.
168 * Support for array constants in constraints.
169 * Syntax for array models has changed in some language front-ends.
170 * New input/output languages supported: "smt2.0" and "smtlib2.0" to
171 force SMT-LIB v2.0; "smt2.5" and "smtlib2.5" to force SMT-LIB v2.5;
172 "smt2.6" and "smtlib2.6" to force SMT-LIB v2.6;
173 "smt", "smtlib", "smt2", and "smtlib2" all refer to the current standard
174 version 2.6. If an :smt-lib-version is set in the input, that overrides
175 the command line.
176 * Abstract values in SMT-LIB models are now ascribed types (with "as").
177 * In SMT-LIB model output, real-sorted but integer-valued constants are
178 now printed in accordance with the standard (e.g. "1.0").
179
180 Changes since 1.3
181 =================
182
183 * CVC4 now supports libc++ in addition to libstdc++ (this especially
184 helps on Mac OS Mavericks).
185 * The LFSC proof checker has been incorporated into CVC4 sources.
186 * Theory of finite sets, handling the MLSS fragment (singleton, union,
187 intersection, set subtraction, membership and subset).
188 * By default, CVC4 builds in "production" mode (optimized, with fewer
189 internal checks on). The common alternative is a "debug" build, which
190 is much slower. By default, CVC4 builds with no GPL'ed dependences.
191 However, this is not the best-performing version; for that, you should
192 configure with "--enable-gpl --best", which links against GPL'ed
193 libraries that improve usability and performance. For details on
194 licensing and dependences, see the README file.
195 * Small API adjustments to Datatypes to even out the API and make it
196 function better in Java.
197 * Timed statistics are now properly updated even on process abort.
198 * Better automatic handling of output language setting when using CVC4
199 via API. Previously, the "automatic" language setting was sometimes
200 (though not always) defaulting to the internal "AST" language; it
201 should now (correctly) default to the same as the input language
202 (if the input language is supported as an output language), or the
203 "CVC4" native output language if no input language setting is applied.
204 * The SmtEngine cannot be safely copied with the copy constructor.
205 Previous versions inadvertently permitted clients to do this via the
206 API. This has been corrected, copy and assignment of the SmtEngine
207 is no longer permitted.
208
209 Changes since 1.2
210 =================
211
212 New features:
213 * SMT-LIB-compliant support for abs, to_real, to_int, is_int, which were
214 previously missing
215 * New bv2nat/int2bv operators for bitvector/integer inter-compatibility.
216 * Support in linear logics for /, div, and mod by constants (with the
217 --rewrite-divk command line option).
218 * Parsing support for TPTP's TFF and TFA formats.
219 * A new theory of strings: word (dis-)equations, length constraints,
220 regular expressions.
221 * Increased compliance to SMT-LIBv2, numerous bugs and usability issues
222 resolved.
223 * New :command-verbosity SMT option to silence success and error messages
224 on a per-command basis, and API changes to Command infrastructure to
225 support this.
226
227 Behavioral changes:
228 * It is no longer permitted to request model or proof generation if there's
229 been an intervening push/pop.
230 * User-defined symbols (define-funs) are no longer reported in the output
231 of get-model commands.
232 * Exit codes are now more standard for UNIX command-line tools. Exit code
233 zero means no error---but the result could be sat, unsat, or unknown---and
234 nonzero means error.
235
236 API changes:
237 * Expr::substitute() now capable of substituting operators (e.g.,
238 function symbols under an APPLY_UF)
239 * Numerous improvements to the Java language bindings
240
241 Changes since 1.1
242 =================
243
244 * Real arithmetic now has three simplex solvers for exact precision linear
245 arithmetic: the classical dual solver and two new solvers based on
246 techniques for minimizing the sum of infeasibilities. GLPK can now be used
247 as a heuristic backup to the exact precision solvers. GLPK must be enabled
248 at configure time. See --help for more information on enabling these solvers.
249 * added support for "bit0" and "bit1" bitvector constants in SMT-LIB v1.2
250 * support for theory "alternates": new ability to prototype new decision
251 procedures that are selectable at runtime
252 * various bugfixes
253
254 Changes since 1.0
255 =================
256
257 * bit-vector solver now has a specialized decision procedure for unsigned bit-
258 vector inequalities
259 * numerous important bug fixes, performance improvements, and usability
260 improvements
261 * support for multiline input in interactive mode
262 * Win32-building support via mingw
263 * SMT-LIB get-model output now is easier to machine-parse: contains (model...)
264 * user patterns for quantifier instantiation are now supported in the
265 SMT-LIBv1.2 parser
266 * --finite-model-find was incomplete when using --incremental, now fixed
267 * the E-matching procedure is slightly improved
268 * Boolean terms are now supported in datatypes
269 * tuple and record support have been added to the compatibility library
270 * driver verbosity change: for printing all commands as they're executed, you
271 now need verbosity level >= 3 (e.g., -vvv) instead of level 1 (-v). This
272 allows tracing the solver's activities (with -v and -vv) without having too
273 much output.
274 * to make CVC4 quieter in abnormal (e.g., "warning" conditions), you can
275 use -q. Previously, this would silence all output (including "sat" or
276 "unsat") as well. Now, single -q silences messages and warnings, and
277 double -qq silences all output (except on exception or signal).