mirror of
https://github.com/Z3Prover/z3
synced 2025-08-22 11:07:51 +00:00
* Introduce X-macro-based trace tag definition - Created trace_tags.def to centralize TRACE tag definitions - Each tag includes a symbolic name and description - Set up enum class TraceTag for type-safe usage in TRACE macros * Add script to generate Markdown documentation from trace_tags.def - Python script parses trace_tags.def and outputs trace_tags.md * Refactor TRACE_NEW to prepend TraceTag and pass enum to is_trace_enabled * trace: improve trace tag handling system with hierarchical tagging - Introduce hierarchical tag-class structure: enabling a tag class activates all child tags - Unify TRACE, STRACE, SCTRACE, and CTRACE under enum TraceTag - Implement initial version of trace_tag.def using X(tag, tag_class, description) (class names and descriptions to be refined in a future update) * trace: replace all string-based TRACE tags with enum TraceTag - Migrated all TRACE, STRACE, SCTRACE, and CTRACE macros to use enum TraceTag values instead of raw string literals * trace : add cstring header * trace : Add Markdown documentation generation from trace_tags.def via mk_api_doc.py * trace : rename macro parameter 'class' to 'tag_class' and remove Unicode comment in trace_tags.h. * trace : Add TODO comment for future implementation of tag_class activation * trace : Disable code related to tag_class until implementation is ready (#7663).
153 lines
4.5 KiB
C++
153 lines
4.5 KiB
C++
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
fpa2bv_tactic.cpp
|
|
|
|
Abstract:
|
|
|
|
Tactic that converts floating points to bit-vectors
|
|
|
|
Author:
|
|
|
|
Christoph (cwinter) 2012-02-09
|
|
|
|
Notes:
|
|
|
|
--*/
|
|
#include "tactic/tactical.h"
|
|
#include "ast/fpa/fpa2bv_rewriter.h"
|
|
#include "tactic/core/simplify_tactic.h"
|
|
#include "tactic/fpa/fpa2bv_tactic.h"
|
|
#include "tactic/fpa/fpa2bv_model_converter.h"
|
|
|
|
class fpa2bv_tactic : public tactic {
|
|
struct imp {
|
|
ast_manager & m;
|
|
fpa2bv_converter m_conv;
|
|
fpa2bv_rewriter m_rw;
|
|
unsigned m_num_steps;
|
|
|
|
imp(ast_manager & _m, params_ref const & p):
|
|
m(_m),
|
|
m_conv(m),
|
|
m_rw(m, m_conv, p) {
|
|
}
|
|
|
|
void updt_params(params_ref const & p) {
|
|
m_rw.cfg().updt_params(p);
|
|
}
|
|
|
|
void operator()(goal_ref const & g,
|
|
goal_ref_buffer & result) {
|
|
bool proofs_enabled = g->proofs_enabled();
|
|
result.reset();
|
|
tactic_report report("fpa2bv", *g);
|
|
m_rw.reset();
|
|
|
|
TRACE(fpa2bv, g->display(tout << "BEFORE: " << std::endl););
|
|
|
|
if (g->inconsistent()) {
|
|
result.push_back(g.get());
|
|
return;
|
|
}
|
|
|
|
m_num_steps = 0;
|
|
expr_ref new_curr(m);
|
|
proof_ref new_pr(m);
|
|
unsigned size = g->size();
|
|
for (unsigned idx = 0; idx < size; idx++) {
|
|
if (g->inconsistent())
|
|
break;
|
|
expr * curr = g->form(idx);
|
|
m_rw(curr, new_curr, new_pr);
|
|
m_num_steps += m_rw.get_num_steps();
|
|
if (proofs_enabled) {
|
|
proof * pr = g->pr(idx);
|
|
new_pr = m.mk_modus_ponens(pr, new_pr);
|
|
}
|
|
g->update(idx, new_curr, new_pr, g->dep(idx));
|
|
|
|
if (is_app(new_curr)) {
|
|
const app * a = to_app(new_curr.get());
|
|
if (a->get_family_id() == m_conv.fu().get_family_id() &&
|
|
a->get_decl_kind() == OP_FPA_IS_NAN) {
|
|
// Inject auxiliary lemmas that fix e to the one and only NaN value,
|
|
// that is (= e (fp #b0 #b1...1 #b0...01)), so that the value propagation
|
|
// has a value to propagate.
|
|
expr_ref sgn(m), sig(m), exp(m);
|
|
m_conv.split_fp(new_curr, sgn, exp, sig);
|
|
result.back()->assert_expr(m.mk_eq(sgn, m_conv.bu().mk_numeral(0, 1)));
|
|
result.back()->assert_expr(m.mk_eq(exp, m_conv.bu().mk_bv_neg(m_conv.bu().mk_numeral(1, m_conv.bu().get_bv_size(exp)))));
|
|
result.back()->assert_expr(m.mk_eq(sig, m_conv.bu().mk_numeral(1, m_conv.bu().get_bv_size(sig))));
|
|
}
|
|
}
|
|
}
|
|
|
|
if (g->models_enabled())
|
|
g->add(mk_fpa2bv_model_converter(m, m_conv));
|
|
|
|
g->inc_depth();
|
|
result.push_back(g.get());
|
|
|
|
for (expr* e : m_conv.m_extra_assertions) {
|
|
proof* pr = nullptr;
|
|
if (proofs_enabled)
|
|
pr = m.mk_asserted(e);
|
|
result.back()->assert_expr(e, pr);
|
|
}
|
|
|
|
TRACE(fpa2bv, g->display(tout << "AFTER:\n");
|
|
if (g->mc()) g->mc()->display(tout); tout << std::endl; );
|
|
}
|
|
};
|
|
|
|
imp * m_imp;
|
|
params_ref m_params;
|
|
|
|
public:
|
|
fpa2bv_tactic(ast_manager & m, params_ref const & p):
|
|
m_params(p) {
|
|
m_imp = alloc(imp, m, p);
|
|
}
|
|
|
|
tactic * translate(ast_manager & m) override {
|
|
return alloc(fpa2bv_tactic, m, m_params);
|
|
}
|
|
|
|
~fpa2bv_tactic() override {
|
|
dealloc(m_imp);
|
|
}
|
|
|
|
char const* name() const override { return "fp2bv"; }
|
|
|
|
void updt_params(params_ref const & p) override {
|
|
m_params.append(p);
|
|
m_imp->updt_params(m_params);
|
|
}
|
|
|
|
void collect_param_descrs(param_descrs & r) override {
|
|
}
|
|
|
|
void operator()(goal_ref const & in,
|
|
goal_ref_buffer & result) override {
|
|
try {
|
|
(*m_imp)(in, result);
|
|
}
|
|
catch (rewriter_exception & ex) {
|
|
throw tactic_exception(ex.what());
|
|
}
|
|
}
|
|
|
|
void cleanup() override {
|
|
imp * d = alloc(imp, m_imp->m, m_params);
|
|
std::swap(d, m_imp);
|
|
dealloc(d);
|
|
}
|
|
|
|
};
|
|
|
|
tactic * mk_fpa2bv_tactic(ast_manager & m, params_ref const & p) {
|
|
return clean(alloc(fpa2bv_tactic, m, p));
|
|
}
|