Skip to content

Fix breadth limit bug; implementation for prove #1931

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

Merged

Conversation

ana-pantilie
Copy link
Contributor

Fixes #1903


Reviewer checklist
  • Test coverage: stack test --coverage
  • Public API documentation: stack haddock

Comment on lines +1 to +27
<T>
<k>
DotVar2
</k>
<state>
n |-> 0
sum |-> S +Int N +Int N *Int ( N +Int -1 ) /Int 2
</state>
</T>
#And
{
N +Int -1 >=Int 0
#Equals
true
}
#And
{
N >=Int 0
#Equals
true
}
#And
{
false
#Equals
N <=Int 0
}
Copy link
Contributor Author

@ana-pantilie ana-pantilie Jun 29, 2020

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Two of the configurations are \bottom, and the other two configurations are identical. I'm pretty sure we detect and remove \bottom patterns for OrPatterns, but do we also remove duplicates? Edit: it looks like we do, here.

@ana-pantilie ana-pantilie marked this pull request as ready for review June 29, 2020 09:04
@ana-pantilie ana-pantilie requested a review from ttuegel June 29, 2020 12:58
@ana-pantilie ana-pantilie merged commit edcd219 into runtimeverification:master Jun 30, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Breadth limit does not work
2 participants