mirror of
https://github.com/Z3Prover/z3
synced 2025-04-28 03:15:50 +00:00
c47ca341b7
The bug was that axiom generation was not enabled on last_index, so no axioms got created to constrain last-index. With default settings the solver is now very slow on this example. It is related to that the smallest size of a satisfying assignment is above 24. Pending a good heuristic to find initial seeds and increments for iterative deepening, I am adding another parameter smt.seq.min_unfolding that when set to 30 helps for this example.
26 lines
525 B
C++
26 lines
525 B
C++
/*++
|
|
Copyright (c) 2018 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
theory_seq_params.cpp
|
|
|
|
Abstract:
|
|
|
|
Parameters for sequence theory plugin
|
|
|
|
Revision History:
|
|
|
|
|
|
--*/
|
|
|
|
#include "smt/params/theory_seq_params.h"
|
|
#include "smt/params/smt_params_helper.hpp"
|
|
|
|
void theory_seq_params::updt_params(params_ref const & _p) {
|
|
smt_params_helper p(_p);
|
|
m_split_w_len = p.seq_split_w_len();
|
|
m_seq_validate = p.seq_validate();
|
|
m_seq_max_unfolding = p.seq_max_unfolding();
|
|
m_seq_min_unfolding = p.seq_min_unfolding();
|
|
}
|