mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05:31 +00:00
Code Activity

support for Indexof2 in theory_str

Browse source
This commit is contained in:
Murphy Berzish 2016-06-15 17:37:17 -04:00
parent 881e3056f3
commit dc5a334d42
6 changed files with 133 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

31
src/ast/rewriter/str_rewriter.cpp
View file

@ -130,6 +130,34 @@ br_status str_rewriter::mk_str_Indexof(expr * haystack, expr * needle, expr_ref
}
}
br_status str_rewriter::mk_str_Indexof2(expr * arg0, expr * arg1, expr * arg2, expr_ref & result) {
TRACE("t_str_rw", tout << "rewrite (Indexof2 " << mk_pp(arg0, m()) << " " << mk_pp(arg1, m()) << " " << mk_pp(arg2, m()) << ")" << std::endl;);
//if (getNodeType(t, args[0]) == my_Z3_ConstStr && getNodeType(t, args[1]) == my_Z3_ConstStr && getNodeType(t, args[2]) == my_Z3_Num) {
rational arg2Int;
if (m_strutil.is_string(arg0) && m_strutil.is_string(arg1) && m_autil.is_numeral(arg2, arg2Int)) {
TRACE("t_str_rw", tout << "evaluating constant Indexof2 expression" << std::endl;);
std::string arg0str = m_strutil.get_string_constant_value(arg0);
std::string arg1str = m_strutil.get_string_constant_value(arg1);
if (arg2Int >= rational((unsigned)arg0str.length())) {
result = m_autil.mk_numeral(rational(-1), true);
} else if (arg2Int < rational(0)) {
int index = arg0str.find(arg1str);
result = m_autil.mk_numeral(rational(index), true);
} else {
std::string suffixStr = arg0str.substr(arg2Int.get_unsigned(), arg0str.length() - arg2Int.get_unsigned());
if (suffixStr.find(arg1str) != std::string::npos) {
int index = suffixStr.find(arg1str) + arg2Int.get_unsigned();
result = m_autil.mk_numeral(rational(index), true);
} else {
result = m_autil.mk_numeral(rational(-1), true);
}
}
return BR_DONE;
} else {
return BR_FAILED;
}
}
br_status str_rewriter::mk_app_core(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
SASSERT(f->get_family_id() == get_fid());
@ -152,6 +180,9 @@ br_status str_rewriter::mk_app_core(func_decl * f, unsigned num_args, expr * con
case OP_STR_INDEXOF:
SASSERT(num_args == 2);
return mk_str_Indexof(args[0], args[1], result);
case OP_STR_INDEXOF2:
SASSERT(num_args == 3);
return mk_str_Indexof2(args[0], args[1], args[2], result);
default:
return BR_FAILED;
}

1
src/ast/rewriter/str_rewriter.h
View file

@ -45,6 +45,7 @@ public:
br_status mk_str_EndsWith(expr * haystack, expr * needle, expr_ref & result);
br_status mk_str_Contains(expr * haystack, expr * needle, expr_ref & result);
br_status mk_str_Indexof(expr * haystack, expr * needle, expr_ref & result);
br_status mk_str_Indexof2(expr * arg0, expr * arg1, expr * arg2, expr_ref & result);
bool reduce_eq(expr * l, expr * r, expr_ref_vector & lhs, expr_ref_vector & rhs, bool & change);
bool reduce_eq(expr_ref_vector& ls, expr_ref_vector& rs, expr_ref_vector& lhs, expr_ref_vector& rhs, bool& change);

10
src/ast/str_decl_plugin.cpp
View file

@ -31,6 +31,7 @@ str_decl_plugin::str_decl_plugin():
m_endswith_decl(0),
m_contains_decl(0),
m_indexof_decl(0),
m_indexof2_decl(0),
m_arith_plugin(0),
m_arith_fid(0),
m_int_sort(0){
@ -49,6 +50,7 @@ void str_decl_plugin::finalize(void) {
DEC_REF(m_endswith_decl);
DEC_REF(m_contains_decl);
DEC_REF(m_indexof_decl);
DEC_REF(m_indexof2_decl);
DEC_REF(m_int_sort);
}
@ -93,6 +95,12 @@ void str_decl_plugin::set_manager(ast_manager * m, family_id id) {
m_indexof_decl = m->mk_func_decl(symbol("Indexof"), s, s, i, func_decl_info(id, OP_STR_INDEXOF));
m_manager->inc_ref(m_indexof_decl);
{
sort * d[3] = { s, s, i };
m_indexof2_decl = m->mk_func_decl(symbol("Indexof2"), 3, d, i, func_decl_info(id, OP_STR_INDEXOF2));
m_manager->inc_ref(m_indexof2_decl);
}
}
decl_plugin * str_decl_plugin::mk_fresh() {
@ -115,6 +123,7 @@ func_decl * str_decl_plugin::mk_func_decl(decl_kind k) {
case OP_STR_ENDSWITH: return m_endswith_decl;
case OP_STR_CONTAINS: return m_contains_decl;
case OP_STR_INDEXOF: return m_indexof_decl;
case OP_STR_INDEXOF2: return m_indexof2_decl;
default: return 0;
}
}
@ -176,6 +185,7 @@ void str_decl_plugin::get_op_names(svector<builtin_name> & op_names, symbol cons
op_names.push_back(builtin_name("EndsWith", OP_STR_ENDSWITH));
op_names.push_back(builtin_name("Contains", OP_STR_CONTAINS));
op_names.push_back(builtin_name("Indexof", OP_STR_INDEXOF));
op_names.push_back(builtin_name("Indexof2", OP_STR_INDEXOF2));
}
void str_decl_plugin::get_sort_names(svector<builtin_name> & sort_names, symbol const & logic) {

2
src/ast/str_decl_plugin.h
View file

@ -36,6 +36,7 @@ enum str_op_kind {
OP_STR_ENDSWITH,
OP_STR_CONTAINS,
OP_STR_INDEXOF,
OP_STR_INDEXOF2,
// end
LAST_STR_OP
};
@ -53,6 +54,7 @@ protected:
func_decl * m_endswith_decl;
func_decl * m_contains_decl;
func_decl * m_indexof_decl;
func_decl * m_indexof2_decl;
arith_decl_plugin * m_arith_plugin;
family_id m_arith_fid;