diff options
| author | Andres Noetzli <andres.noetzli@gmail.com> | 2020-01-13 18:08:09 -0800 |
|---|---|---|
| committer | Andres Noetzli <andres.noetzli@gmail.com> | 2020-01-21 02:29:21 -0800 |
| commit | 189643f4ef373ab5bdfb0f380b4e2392907749c4 (patch) | |
| tree | 111f50a43034552fe55517ab245bf8fb3bd2ca2a | |
| parent | 32a3fa39cc8a34c81b541c064da3b7c5060bbe47 (diff) | |
split len consts
| -rw-r--r-- | src/theory/strings/theory_strings.cpp | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/src/theory/strings/theory_strings.cpp b/src/theory/strings/theory_strings.cpp index 4eaa9c3aa..6d3a0b6c0 100644 --- a/src/theory/strings/theory_strings.cpp +++ b/src/theory/strings/theory_strings.cpp @@ -3177,8 +3177,7 @@ void TheoryStrings::processSimpleNEq(NormalForm& nfi, Node length_term_j = d_state.getLength(nfjv[index], lexp); //split on equality between string lengths (note that splitting on equality between strings is worse since it is harder to process) if (!d_state.areDisequal(length_term_i, length_term_j) - && !d_state.areEqual(length_term_i, length_term_j) - && !nfiv[index].isConst() && !nfjv[index].isConst()) + && !d_state.areEqual(length_term_i, length_term_j)) { // AJR: remove the latter 2 conditions? Trace("strings-solve-debug") << "Non-simple Case 1 : string lengths neither equal nor disequal" << std::endl; //try to make the lengths equal via splitting on demand |