We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
It considers trees such as the below not to contain counterexamples when they clearly do.
location: I_push[1[int]] V[] HYP (initial suffix): PIV: {} SDT: []-+ []-TRUE: s1 []-TRUE: s2 [Leaf-]
SUL (initial suffix): PIV: {} SDT: []-+ []-(s1=c1) | []-TRUE: s2 | [Leaf+] +-(s1!=c1) []-TRUE: s2 [Leaf-]
The way the expression is constructed should be reviewed. In my mind, hasCounterexample is akin to asking whether the two SDT's are not equivalent.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
It considers trees such as the below not to contain counterexamples when they clearly do.
location: I_push[1[int]] V[]
HYP (initial suffix): PIV: {}
SDT: []-+
[]-TRUE: s1
[]-TRUE: s2
[Leaf-]
SUL (initial suffix): PIV: {}
SDT: []-+
[]-(s1=c1)
| []-TRUE: s2
| [Leaf+]
+-(s1!=c1)
[]-TRUE: s2
[Leaf-]
The way the expression is constructed should be reviewed. In my mind, hasCounterexample is akin to asking whether the two SDT's are not equivalent.
The text was updated successfully, but these errors were encountered: