New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
(produce-abducts) Fatal failure at src/theory/eager_proof_generator.cpp:35 #6605
Comments
src/smt/abduction_solver.cpp:108
|
src/theory/uf/equality_engine.cpp:585
|
Last one appears to be specific to arrays solver:
|
This was referenced Oct 19, 2021
aniemetz
pushed a commit
that referenced
this issue
Oct 20, 2021
This addresses one of the issues related to #6605.
ajreynol
added a commit
that referenced
this issue
Oct 20, 2021
This makes the SyGuS solver robust to variables that are not closed enumerable, e.g. arrays of uninterpreted sorts. It corrects an issue in array's mkGroundTerm issue which would allow constants to enter into constraints for SyGuS problems with arrays. This method does not cause further issues currently since quantifiers is guarded in several places to ensure array constants are not constructed via this method. It also makes it so that we don't add explicit CEGIS refinement lemmas unless evaluation unfolding is enabled and the counterexamples are from closed enumerable types; there is no reason to add these unless we are combining with evaluation unfolding. This addresses several of the issues raised in #6605.
This issue is fixed due to a combination of the last 2 referenced PRs. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Commit: 0e9fed3
OS: Ubuntu 18.04
The text was updated successfully, but these errors were encountered: