mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-19 19:02:02 +00:00
Code Activity

add theory_str::check_contain_by_substr

Browse source
This commit is contained in:
Murphy Berzish 2016-08-14 15:14:48 -04:00
parent 1f594b190a
commit ee6f1eef69
1 changed files with 66 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

67
src/smt/theory_str.cpp
View file

@ -4299,7 +4299,72 @@ void theory_str::check_contain_by_eqc_val(expr * varNode, expr * constNode) {
} }
void theory_str::check_contain_by_substr(expr * varNode, expr_ref_vector & willEqClass) { void theory_str::check_contain_by_substr(expr * varNode, expr_ref_vector & willEqClass) {
NOT_IMPLEMENTED_YET(); // TODO NEXT context & ctx = get_context();
ast_manager & m = get_manager();
expr_ref_vector litems(m);
// same deal as before, we do not track containPairIdxMap
// and so we check elements of contains_map instead
expr_ref_vector::iterator itor1 = contains_map.begin();
for (; itor1 != contains_map.end(); ++itor1) {
expr * boolVar = *itor1;
// boolVar is actually a Contains term
app * containsApp = to_app(boolVar);
expr * strAst = containsApp->get_arg(0);
expr * substrAst = containsApp->get_arg(1);
// we only want to inspect the Contains terms where either of strAst or substrAst
// are equal to varNode.
TRACE("t_str_detail", tout << "considering Contains with strAst = " << mk_pp(strAst, m) << ", substrAst = " << mk_pp(substrAst, m) << "..." << std::endl;);
if (varNode != strAst && varNode != substrAst) {
TRACE("t_str_detail", tout << "varNode not equal to strAst or substrAst, skip" << std::endl;);
continue;
}
TRACE("t_str_detail", tout << "varNode matched one of strAst or substrAst. Continuing" << std::endl;);
if (substrAst == varNode) {
bool strAstHasVal = false;
expr * strValue = get_eqc_value(strAst, strAstHasVal);
if (strAstHasVal) {
TRACE("t_str_detail", tout << mk_pp(strAst, m) << " has constant eqc value " << mk_pp(strValue) << std::endl;);
if (strValue != strAst) {
litems.push_back(ctx.mk_eq_atom(strAst, strValue));
}
std::string strConst = m_strutil.get_string_constant_value(strValue);
// iterate eqc (also eqc-to-be) of substr
for (expr_ref_vector::iterator itAst = willEqClass.begin(); itAst != willEqClass.end(); itAst++) {
bool counterEgFound = false;
if (is_concat(to_app(*itAst))) {
expr_ref_vector constList(m);
// get constant strings in concat
app * aConcat = to_app(*itAst);
get_const_str_asts_in_node(aConcat, constList);
for (expr_ref_vector::iterator cstItor = constList.begin();
cstItor != constList.end(); cstItor++) {
std::string pieceStr = m_strutil.get_string_constant_value(*cstItor);
if (strConst.find(pieceStr) == std::string::npos) {
TRACE("t_str_detail", tout << "Inconsistency found!" << std::endl;);
counterEgFound = true;
if (aConcat != substrAst) {
litems.push_back(ctx.mk_eq_atom(substrAst, aConcat));
}
expr_ref implyLHS(mk_and(litems), m);
expr_ref implyR(m.mk_not(boolVar), m);
assert_implication(implyLHS, implyR);
break;
}
}
}
if (counterEgFound) {
break;
}
}
}
}
}
} }
void theory_str::check_contain_by_eq_nodes(expr * n1, expr * n2) { void theory_str::check_contain_by_eq_nodes(expr * n1, expr * n2) {