Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Conversation

@makaimann
Copy link
Collaborator

With repeated calls to check_until, provers are expected to start from their current state. Bmc and KInduction did this correctly, see here. However, the main loop always started from 0, for example here. This made the logger messages appear to be repeating work. This PR fixes that by starting the loop from the next target. reached_k_ is the highest already checked bound, so the next one to work on is reached_k_ + 1.

Copy link
Collaborator

@lonsing lonsing left a comment

Choose a reason for hiding this comment

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

Good catch!

@makaimann makaimann merged commit d611f73 into master Jul 11, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants