mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-20 23:56:37 +00:00
Code Activity

start using z3's egraph for slicing

Browse source
This commit is contained in:
Jakob Rath 2023-07-08 20:34:46 +02:00
parent b4edc4d20c
commit 51ce17bcd4
2 changed files with 32 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
src/math/polysat/slicing.cpp
View file

@ -46,6 +46,28 @@ Recycle the z3 egraph?
namespace polysat {
slicing::slicing(solver& s):
m_solver(s),
m_egraph(m_ast)
{
m_slice_sort = m_ast.mk_uninterpreted_sort(symbol("slice"));
}
func_decl* slicing::get_concat_decl(unsigned arity) {
SASSERT(arity >= 2);
func_decl* decl = m_concat_decls.get(arity, nullptr);
if (!decl) {
ptr_vector<sort> domain;
for (unsigned i = arity; i-- > 0; )
domain.push_back(m_slice_sort);
SASSERT_EQ(arity, domain.size());
// TODO: mk_fresh_func_decl("concat", ...) if overload doesn't work
func_decl* decl = m_ast.mk_func_decl(symbol("slice-concat"), arity, domain.data(), m_slice_sort);
m_concat_decls.setx(arity, decl, nullptr);
}
return decl;
}
void slicing::push_scope() {
m_scopes.push_back(m_trail.size());
}

11
src/math/polysat/slicing.h
View file

@ -24,6 +24,7 @@ Notation:
--*/
#pragma once
#include "ast/euf/euf_egraph.h"
#include "math/polysat/types.h"
#include "math/polysat/constraint.h"
#include <optional>
@ -38,6 +39,14 @@ namespace polysat {
solver& m_solver;
ast_manager m_ast;
euf::egraph m_egraph;
sort* m_slice_sort;
ptr_vector<func_decl> m_concat_decls;
func_decl* get_concat_decl(unsigned arity);
using dep_t = sat::literal;
using dep_vector = sat::literal_vector;
static constexpr sat::literal null_dep = sat::null_literal;
@ -214,7 +223,7 @@ namespace polysat {
bool invariant() const;
public:
slicing(solver& s): m_solver(s) {}
slicing(solver& s);
void push_scope();
void pop_scope(unsigned num_scopes = 1);