br_status bvarray2uf_rewriter_cfg::reduce_app(func_decl * f, unsigned num, expr * const * args, expr_ref & result, proof_ref & result_pr) { br_status res = BR_FAILED; if (m_manager.is_eq(f) && is_bv_array(f->get_domain()[0])) { SASSERT(num == 2); // From [1]: Finally, we replace equations of the form t = s, // where t and s are arrays, with \forall x . f_t(x) = f_s(x). func_decl_ref f_t(mk_uf_for_array(args[0]), m_manager); func_decl_ref f_s(mk_uf_for_array(args[1]), m_manager); sort * sorts[1] = { get_index_sort(m_manager.get_sort(args[0])) }; symbol names[1] = { symbol("x") }; var_ref x(m_manager.mk_var(0, sorts[0]), m_manager); expr_ref body(m_manager); body = m_manager.mk_eq(m_manager.mk_app(f_t, x.get()), m_manager.mk_app(f_s, x.get())); result = m_manager.mk_forall(1, sorts, names, body); res = BR_DONE; } else if (m_manager.is_distinct(f) && is_bv_array(f->get_domain()[0])) { result = m_manager.mk_distinct_expanded(num, args); res = BR_REWRITE1; } else if (f->get_family_id() == null_family_id) { TRACE("bvarray2uf_rw", tout << "UF APP: " << f->get_name() << std::endl; );
func_decl_ref bvarray2uf_rewriter_cfg::mk_uf_for_array(expr * e) { SASSERT(is_bv_array(e)); if (m_array_util.is_as_array(e)) return func_decl_ref(static_cast<func_decl*>(to_app(e)->get_decl()->get_parameter(0).get_ast()), m_manager); else { app * a = to_app(e); func_decl * bv_f = 0; if (!m_arrays_fs.find(e, bv_f)) { sort * domain = get_index_sort(a); sort * range = get_value_sort(a); bv_f = m_manager.mk_fresh_func_decl("f_t", "", 1, &domain, range); if (is_uninterp_const(e)) { if (m_emc) m_emc->insert(to_app(e)->get_decl(), m_array_util.mk_as_array(m_manager.get_sort(e), bv_f)); } else if (m_fmc) m_fmc->insert(bv_f); m_arrays_fs.insert(e, bv_f); m_manager.inc_ref(bv_f); } return func_decl_ref(bv_f, m_manager); } }
bool bvarray2uf_rewriter_cfg::is_bv_array(expr * e) { return is_bv_array(m_manager.get_sort(e)); }