Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/theory/arith/error_set.cpp	Lines:	197	308	64.0 %
Date:	2021-08-11	Branches:	167	625	26.7 %


/******************************************************************************
 * Top contributors (to current version):
 *   Tim King, Mathias Preiner
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
 * in the top-level source directory and their institutional affiliations.
 * All rights reserved.  See the file COPYING in the top-level source
 * directory for licensing information.
 * ****************************************************************************
 *
 * [[ Add one-line brief description here ]]
 *
 * [[ Add lengthier description here ]]
 * \todo document this file
 */

#include "theory/arith/error_set.h"

#include "smt/smt_statistics_registry.h"
#include "theory/arith/constraint.h"

using namespace std;

namespace cvc5 {
namespace theory {
namespace arith {


ErrorInformation::ErrorInformation()
  : d_variable(ARITHVAR_SENTINEL)
  , d_violated(NullConstraint)
  , d_sgn(0)
  , d_relaxed(false)
  , d_inFocus(false)
  , d_handle()
  , d_amount(NULL)
  , d_metric(0)
{
  Debug("arith::error::mem") << "def constructor " << d_variable << " "  << d_amount << endl;
}

ErrorInformation::ErrorInformation(ArithVar var, ConstraintP vio, int sgn)
  : d_variable(var)
  , d_violated(vio)
  , d_sgn(sgn)
  , d_relaxed(false)
  , d_inFocus(false)
  , d_handle()
  , d_amount(NULL)
  , d_metric(0)
{
  Assert(debugInitialized());
  Debug("arith::error::mem") << "constructor " << d_variable << " "  << d_amount << endl;
}


ErrorInformation::~ErrorInformation() {
  Assert(d_relaxed != true);
  if(d_amount != NULL){
    Debug("arith::error::mem") << d_amount << endl;
    Debug("arith::error::mem") << "destroy " << d_variable << " "  << d_amount << endl;
    delete d_amount;
    d_amount = NULL;
  }
}

ErrorInformation::ErrorInformation(const ErrorInformation& ei)
  : d_variable(ei.d_variable)
  , d_violated(ei.d_violated)
  , d_sgn(ei.d_sgn)
  , d_relaxed(ei.d_relaxed)
  , d_inFocus(ei.d_inFocus)
  , d_handle(ei.d_handle)
  , d_metric(0)
{
  if(ei.d_amount == NULL){
    d_amount = NULL;
  }else{
    d_amount = new DeltaRational(*ei.d_amount);
  }
  Debug("arith::error::mem") << "copy const " << d_variable << " "  << d_amount << endl;
}

ErrorInformation& ErrorInformation::operator=(const ErrorInformation& ei){
  d_variable = ei.d_variable;
  d_violated = ei.d_violated;
  d_sgn = ei.d_sgn;
  d_relaxed = (ei.d_relaxed);
  d_inFocus = (ei.d_inFocus);
  d_handle = (ei.d_handle);
  d_metric = ei.d_metric;
  if(d_amount != NULL && ei.d_amount != NULL){
    Debug("arith::error::mem") << "assignment assign " << d_variable << " "  << d_amount << endl;
    *d_amount = *ei.d_amount;
  }else if(ei.d_amount != NULL){
    d_amount = new DeltaRational(*ei.d_amount);
    Debug("arith::error::mem") << "assignment alloc " << d_variable << " "  << d_amount << endl;
  }else if(d_amount != NULL){
    Debug("arith::error::mem") << "assignment release " << d_variable << " "  << d_amount << endl;
    delete d_amount;
    d_amount = NULL;
  }else{
    d_amount = NULL;
  }
  return *this;
}

void ErrorInformation::reset(ConstraintP c, int sgn){
  Assert(!isRelaxed());
  Assert(c != NullConstraint);
  d_violated = c;
  d_sgn = sgn;

  if(d_amount != NULL){
    delete d_amount;
    Debug("arith::error::mem") << "reset " << d_variable << " "  << d_amount << endl;
    d_amount = NULL;
  }
}

void ErrorInformation::setAmount(const DeltaRational& am){
  if(d_amount == NULL){
    d_amount = new DeltaRational;
    Debug("arith::error::mem") << "setAmount " << d_variable << " "  << d_amount << endl;
  }
  (*d_amount) = am;
}

ErrorSet::Statistics::Statistics()
    : d_enqueues(
        smtStatisticsRegistry().registerInt("theory::arith::pqueue::enqueues")),
      d_enqueuesCollection(smtStatisticsRegistry().registerInt(
          "theory::arith::pqueue::enqueuesCollection")),
      d_enqueuesDiffMode(smtStatisticsRegistry().registerInt(
          "theory::arith::pqueue::enqueuesDiffMode")),
      d_enqueuesVarOrderMode(smtStatisticsRegistry().registerInt(
          "theory::arith::pqueue::enqueuesVarOrderMode")),
      d_enqueuesCollectionDuplicates(smtStatisticsRegistry().registerInt(
          "theory::arith::pqueue::enqueuesCollectionDuplicates")),
      d_enqueuesVarOrderModeDuplicates(smtStatisticsRegistry().registerInt(
          "theory::arith::pqueue::enqueuesVarOrderModeDuplicates"))
{
}

ErrorSet::ErrorSet(ArithVariables& vars,
                   TableauSizes tabSizes,
                   BoundCountingLookup lookups)
    : d_variables(vars),
      d_errInfo(),
      d_selectionRule(options::ErrorSelectionRule::VAR_ORDER),
      d_focus(ComparatorPivotRule(this, d_selectionRule)),
      d_outOfFocus(),
      d_signals(),
      d_tableauSizes(tabSizes),
      d_boundLookup(lookups)
{}

options::ErrorSelectionRule ErrorSet::getSelectionRule() const
{
  return d_selectionRule;
}

void ErrorSet::recomputeAmount(ErrorInformation& ei,
                               options::ErrorSelectionRule rule)
{
  switch(rule){
    case options::ErrorSelectionRule::MINIMUM_AMOUNT:
    case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
      ei.setAmount(computeDiff(ei.getVariable()));
      break;
    case options::ErrorSelectionRule::SUM_METRIC:
      ei.setMetric(sumMetric(ei.getVariable()));
      break;
    case options::ErrorSelectionRule::VAR_ORDER:
      // do nothing
      break;
  }
}

void ErrorSet::setSelectionRule(options::ErrorSelectionRule rule)
{
  if(rule != getSelectionRule()){
    FocusSet into(ComparatorPivotRule(this, rule));
    FocusSet::const_iterator iter = d_focus.begin();
    FocusSet::const_iterator i_end = d_focus.end();
    for(; iter != i_end; ++iter){
      ArithVar v = *iter;
      ErrorInformation& ei = d_errInfo.get(v);
      if(ei.inFocus()){
        recomputeAmount(ei, rule);
        FocusSetHandle handle = into.push(v);
        ei.setHandle(handle);
      }
    }
    d_focus.swap(into);
    d_selectionRule = rule;
  }
  Assert(getSelectionRule() == rule);
}

ComparatorPivotRule::ComparatorPivotRule(const ErrorSet* es,
                                         options::ErrorSelectionRule r)
    : d_errorSet(es), d_rule(r)
{}

bool ComparatorPivotRule::operator()(ArithVar v, ArithVar u) const {
  switch(d_rule){
    case options::ErrorSelectionRule::VAR_ORDER:
      // This needs to be the reverse of the minVariableOrder
      return v > u;
    case options::ErrorSelectionRule::SUM_METRIC:
    {
      uint32_t v_metric = d_errorSet->getMetric(v);
      uint32_t u_metric = d_errorSet->getMetric(u);
      if(v_metric == u_metric){
        return v > u;
      }else{
        return v_metric > u_metric;
      }
    }
    case options::ErrorSelectionRule::MINIMUM_AMOUNT:
    {
      const DeltaRational& vamt = d_errorSet->getAmount(v);
      const DeltaRational& uamt = d_errorSet->getAmount(u);
      int cmp = vamt.cmp(uamt);
      if(cmp == 0){
        return v > u;
      }else{
        return cmp > 0;
      }
    }
    case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
    {
      const DeltaRational& vamt = d_errorSet->getAmount(v);
      const DeltaRational& uamt = d_errorSet->getAmount(u);
      int cmp = vamt.cmp(uamt);
      if(cmp == 0){
        return v > u;
      }else{
        return cmp < 0;
      }
    }
  }
  Unreachable();
}

void ErrorSet::update(ErrorInformation& ei){
  if(ei.inFocus()){

    switch(getSelectionRule()){
      case options::ErrorSelectionRule::MINIMUM_AMOUNT:
      case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
        ei.setAmount(computeDiff(ei.getVariable()));
        d_focus.update(ei.getHandle(), ei.getVariable());
        break;
      case options::ErrorSelectionRule::SUM_METRIC:
        ei.setMetric(sumMetric(ei.getVariable()));
        d_focus.update(ei.getHandle(), ei.getVariable());
        break;
      case options::ErrorSelectionRule::VAR_ORDER:
        // do nothing
        break;
    }
  }
}

/** A variable becomes satisfied. */
void ErrorSet::transitionVariableOutOfError(ArithVar v) {
  Assert(!inconsistent(v));
  ErrorInformation& ei = d_errInfo.get(v);
  Assert(ei.debugInitialized());
  if(ei.isRelaxed()){
    ConstraintP viol = ei.getViolated();
    if(ei.sgn() > 0){
      d_variables.setLowerBoundConstraint(viol);
    }else{
      d_variables.setUpperBoundConstraint(viol);
    }
    Assert(!inconsistent(v));
    ei.setUnrelaxed();
  }
  if(ei.inFocus()){
    d_focus.erase(ei.getHandle());
    ei.setInFocus(false);
  }
  d_errInfo.remove(v);
}


void ErrorSet::transitionVariableIntoError(ArithVar v) {
  Assert(inconsistent(v));
  bool vilb = d_variables.cmpAssignmentLowerBound(v) < 0;
  int sgn = vilb ? 1 : -1;
  ConstraintP c = vilb ?
    d_variables.getLowerBoundConstraint(v) : d_variables.getUpperBoundConstraint(v);
  d_errInfo.set(v, ErrorInformation(v, c, sgn));
  ErrorInformation& ei = d_errInfo.get(v);

  switch(getSelectionRule()){
    case options::ErrorSelectionRule::MINIMUM_AMOUNT:
    case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
      ei.setAmount(computeDiff(v));
      break;
    case options::ErrorSelectionRule::SUM_METRIC:
      ei.setMetric(sumMetric(ei.getVariable()));
      break;
    case options::ErrorSelectionRule::VAR_ORDER:
      // do nothing
      break;
  }
  ei.setInFocus(true);
  FocusSetHandle handle = d_focus.push(v);
  ei.setHandle(handle);
}

void ErrorSet::dropFromFocus(ArithVar v) {
  Assert(inError(v));
  ErrorInformation& ei = d_errInfo.get(v);
  Assert(ei.inFocus());
  d_focus.erase(ei.getHandle());
  ei.setInFocus(false);
  d_outOfFocus.push_back(v);
}

void ErrorSet::addBackIntoFocus(ArithVar v) {
  Assert(inError(v));
  ErrorInformation& ei = d_errInfo.get(v);
  Assert(!ei.inFocus());
  switch(getSelectionRule()){
    case options::ErrorSelectionRule::MINIMUM_AMOUNT:
    case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
      ei.setAmount(computeDiff(v));
      break;
    case options::ErrorSelectionRule::SUM_METRIC:
      ei.setMetric(sumMetric(v));
      break;
    case options::ErrorSelectionRule::VAR_ORDER:
      // do nothing
      break;
  }

  ei.setInFocus(true);
  FocusSetHandle handle = d_focus.push(v);
  ei.setHandle(handle);
}

void ErrorSet::blur(){
  while(!d_outOfFocus.empty()){
    ArithVar v = d_outOfFocus.back();
    d_outOfFocus.pop_back();

    if(inError(v) && !inFocus(v)){
      addBackIntoFocus(v);
    }
  }
}



int ErrorSet::popSignal() {
  ArithVar back = d_signals.back();
  d_signals.pop_back();

  if(inError(back)){
    ErrorInformation& ei = d_errInfo.get(back);
    int prevSgn = ei.sgn();
    int focusSgn = ei.focusSgn();
    bool vilb = d_variables.cmpAssignmentLowerBound(back) < 0;
    bool viub = d_variables.cmpAssignmentUpperBound(back) > 0;
    if(vilb || viub){
      Assert(!vilb || !viub);
      int currSgn = vilb ? 1 : -1;
      if(currSgn != prevSgn){
        ConstraintP curr = vilb ?  d_variables.getLowerBoundConstraint(back)
          : d_variables.getUpperBoundConstraint(back);
        ei.reset(curr, currSgn);
      }
      update(ei);
    }else{
      transitionVariableOutOfError(back);
    }
    return focusSgn;
  }else if(inconsistent(back)){
    transitionVariableIntoError(back);
  }
  return 0;
}

void ErrorSet::clear(){
  // Nothing should be relaxed!
  d_signals.clear();
  d_errInfo.purge();
  d_focus.clear();
}

void ErrorSet::clearFocus(){
  for(ErrorSet::focus_iterator i =focusBegin(), i_end = focusEnd(); i != i_end; ++i){
    ArithVar f = *i;
    ErrorInformation& fei = d_errInfo.get(f);
    fei.setInFocus(false);
    d_outOfFocus.push_back(f);
  }
  d_focus.clear();
}

void ErrorSet::reduceToSignals(){
  for(error_iterator ei=errorBegin(), ei_end=errorEnd(); ei != ei_end; ++ei){
    ArithVar curr = *ei;
    signalVariable(curr);
  }

  d_errInfo.purge();
  d_focus.clear();
  d_outOfFocus.clear();
}

DeltaRational ErrorSet::computeDiff(ArithVar v) const{
  Assert(inconsistent(v));
  const DeltaRational& beta = d_variables.getAssignment(v);
  DeltaRational diff = d_variables.cmpAssignmentLowerBound(v) < 0 ?
    d_variables.getLowerBound(v) - beta:
    beta - d_variables.getUpperBound(v);

  Assert(diff.sgn() > 0);
  return diff;
}

void ErrorSet::debugPrint(std::ostream& out) const {
  static int instance = 0;
  ++instance;
  out << "error set debugprint " << instance << endl;
  for(error_iterator i = errorBegin(), i_end = errorEnd();
      i != i_end; ++i){
    ArithVar e = *i;
    const ErrorInformation& ei = d_errInfo[e];
    ei.print(out);
    out << "  ";
    d_variables.printModel(e, out);
    out << endl;
  }
  out << "focus ";
  for(focus_iterator i = focusBegin(), i_end = focusEnd();
      i != i_end; ++i){
    out << *i << " ";
  }
  out << ";" << endl;
}

void ErrorSet::focusDownToJust(ArithVar v) {
  clearFocus();

  ErrorInformation& vei = d_errInfo.get(v);
  vei.setInFocus(true);
  FocusSetHandle handle = d_focus.push(v);
  vei.setHandle(handle);
}

void ErrorSet::pushErrorInto(ArithVarVec& vec) const{
  for(error_iterator i = errorBegin(), e = errorEnd(); i != e; ++i ){
    vec.push_back(*i);
  }
}

void ErrorSet::pushFocusInto(ArithVarVec& vec) const{
  for(focus_iterator i = focusBegin(), e = focusEnd(); i != e; ++i ){
    vec.push_back(*i);
  }
}

}  // namespace arith
}  // namespace theory
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Tim King, Mathias Preiner
4		*
5		* This file is part of the cvc5 project.
6		*
7		* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8		* in the top-level source directory and their institutional affiliations.
9		* All rights reserved. See the file COPYING in the top-level source
10		* directory for licensing information.
11		* ****************************************************************************
12		*
13		* [[ Add one-line brief description here ]]
14		*
15		* [[ Add lengthier description here ]]
16		* \todo document this file
17		*/
18
19		#include "theory/arith/error_set.h"
20
21		#include "smt/smt_statistics_registry.h"
22		#include "theory/arith/constraint.h"
23
24		using namespace std;
25
26		namespace cvc5 {
27		namespace theory {
28		namespace arith {
29
30
31	535970	ErrorInformation::ErrorInformation()
32		: d_variable(ARITHVAR_SENTINEL)
33		, d_violated(NullConstraint)
34		, d_sgn(0)
35		, d_relaxed(false)
36		, d_inFocus(false)
37		, d_handle()
38		, d_amount(NULL)
39	535970	, d_metric(0)
40		{
41	535970	Debug("arith::error::mem") << "def constructor " << d_variable << " " << d_amount << endl;
42	535970	}
43
44	393698	ErrorInformation::ErrorInformation(ArithVar var, ConstraintP vio, int sgn)
45		: d_variable(var)
46		, d_violated(vio)
47		, d_sgn(sgn)
48		, d_relaxed(false)
49		, d_inFocus(false)
50		, d_handle()
51		, d_amount(NULL)
52	393698	, d_metric(0)
53		{
54	393698	Assert(debugInitialized());
55	393698	Debug("arith::error::mem") << "constructor " << d_variable << " " << d_amount << endl;
56	393698	}
57
58
59	2149274	ErrorInformation::~ErrorInformation() {
60	1074637	Assert(d_relaxed != true);
61	1074637	if(d_amount != NULL){
62	665	Debug("arith::error::mem") << d_amount << endl;
63	665	Debug("arith::error::mem") << "destroy " << d_variable << " " << d_amount << endl;
64	665	delete d_amount;
65	665	d_amount = NULL;
66		}
67	1074637	}
68
69	144969	ErrorInformation::ErrorInformation(const ErrorInformation& ei)
70	144969	: d_variable(ei.d_variable)
71	144969	, d_violated(ei.d_violated)
72	144969	, d_sgn(ei.d_sgn)
73	144969	, d_relaxed(ei.d_relaxed)
74	144969	, d_inFocus(ei.d_inFocus)
75		, d_handle(ei.d_handle)
76	724845	, d_metric(0)
77		{
78	144969	if(ei.d_amount == NULL){
79	144801	d_amount = NULL;
80		}else{
81	168	d_amount = new DeltaRational(*ei.d_amount);
82		}
83	144969	Debug("arith::error::mem") << "copy const " << d_variable << " " << d_amount << endl;
84	144969	}
85
86	786594	ErrorInformation& ErrorInformation::operator=(const ErrorInformation& ei){
87	786594	d_variable = ei.d_variable;
88	786594	d_violated = ei.d_violated;
89	786594	d_sgn = ei.d_sgn;
90	786594	d_relaxed = (ei.d_relaxed);
91	786594	d_inFocus = (ei.d_inFocus);
92	786594	d_handle = (ei.d_handle);
93	786594	d_metric = ei.d_metric;
94	786594	if(d_amount != NULL && ei.d_amount != NULL){
95		Debug("arith::error::mem") << "assignment assign " << d_variable << " " << d_amount << endl;
96		d_amount = ei.d_amount;
97	786594	}else if(ei.d_amount != NULL){
98		d_amount = new DeltaRational(*ei.d_amount);
99		Debug("arith::error::mem") << "assignment alloc " << d_variable << " " << d_amount << endl;
100	786594	}else if(d_amount != NULL){
101	229071	Debug("arith::error::mem") << "assignment release " << d_variable << " " << d_amount << endl;
102	229071	delete d_amount;
103	229071	d_amount = NULL;
104		}else{
105	557523	d_amount = NULL;
106		}
107	786594	return *this;
108		}
109
110	1092	void ErrorInformation::reset(ConstraintP c, int sgn){
111	1092	Assert(!isRelaxed());
112	1092	Assert(c != NullConstraint);
113	1092	d_violated = c;
114	1092	d_sgn = sgn;
115
116	1092	if(d_amount != NULL){
117	155	delete d_amount;
118	155	Debug("arith::error::mem") << "reset " << d_variable << " " << d_amount << endl;
119	155	d_amount = NULL;
120		}
121	1092	}
122
123	286768	void ErrorInformation::setAmount(const DeltaRational& am){
124	286768	if(d_amount == NULL){
125	229723	d_amount = new DeltaRational;
126	229723	Debug("arith::error::mem") << "setAmount " << d_variable << " " << d_amount << endl;
127		}
128	286768	(*d_amount) = am;
129	286768	}
130
131	9851	ErrorSet::Statistics::Statistics()
132		: d_enqueues(
133	19702	smtStatisticsRegistry().registerInt("theory::arith::pqueue::enqueues")),
134	9851	d_enqueuesCollection(smtStatisticsRegistry().registerInt(
135	19702	"theory::arith::pqueue::enqueuesCollection")),
136	9851	d_enqueuesDiffMode(smtStatisticsRegistry().registerInt(
137	19702	"theory::arith::pqueue::enqueuesDiffMode")),
138	9851	d_enqueuesVarOrderMode(smtStatisticsRegistry().registerInt(
139	19702	"theory::arith::pqueue::enqueuesVarOrderMode")),
140	9851	d_enqueuesCollectionDuplicates(smtStatisticsRegistry().registerInt(
141	19702	"theory::arith::pqueue::enqueuesCollectionDuplicates")),
142	9851	d_enqueuesVarOrderModeDuplicates(smtStatisticsRegistry().registerInt(
143	59106	"theory::arith::pqueue::enqueuesVarOrderModeDuplicates"))
144		{
145	9851	}
146
147	9851	ErrorSet::ErrorSet(ArithVariables& vars,
148		TableauSizes tabSizes,
149	9851	BoundCountingLookup lookups)
150		: d_variables(vars),
151		d_errInfo(),
152		d_selectionRule(options::ErrorSelectionRule::VAR_ORDER),
153	19702	d_focus(ComparatorPivotRule(this, d_selectionRule)),
154		d_outOfFocus(),
155		d_signals(),
156		d_tableauSizes(tabSizes),
157	29553	d_boundLookup(lookups)
158	9851	{}
159
160	2313739	options::ErrorSelectionRule ErrorSet::getSelectionRule() const
161		{
162	2313739	return d_selectionRule;
163		}
164
165	166218	void ErrorSet::recomputeAmount(ErrorInformation& ei,
166		options::ErrorSelectionRule rule)
167		{
168	166218	switch(rule){
169	155599	case options::ErrorSelectionRule::MINIMUM_AMOUNT:
170		case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
171	155599	ei.setAmount(computeDiff(ei.getVariable()));
172	155599	break;
173		case options::ErrorSelectionRule::SUM_METRIC:
174		ei.setMetric(sumMetric(ei.getVariable()));
175		break;
176	10619	case options::ErrorSelectionRule::VAR_ORDER:
177		// do nothing
178	10619	break;
179		}
180	166218	}
181
182	845389	void ErrorSet::setSelectionRule(options::ErrorSelectionRule rule)
183		{
184	845389	if(rule != getSelectionRule()){
185	329848	FocusSet into(ComparatorPivotRule(this, rule));
186	164924	FocusSet::const_iterator iter = d_focus.begin();
187	164924	FocusSet::const_iterator i_end = d_focus.end();
188	497360	for(; iter != i_end; ++iter){
189	166218	ArithVar v = *iter;
190	166218	ErrorInformation& ei = d_errInfo.get(v);
191	166218	if(ei.inFocus()){
192	166218	recomputeAmount(ei, rule);
193	166218	FocusSetHandle handle = into.push(v);
194	166218	ei.setHandle(handle);
195		}
196		}
197	164924	d_focus.swap(into);
198	164924	d_selectionRule = rule;
199		}
200	845389	Assert(getSelectionRule() == rule);
201	845389	}
202
203	174775	ComparatorPivotRule::ComparatorPivotRule(const ErrorSet* es,
204	174775	options::ErrorSelectionRule r)
205	174775	: d_errorSet(es), d_rule(r)
206	174775	{}
207
208	1031381	bool ComparatorPivotRule::operator()(ArithVar v, ArithVar u) const {
209	1031381	switch(d_rule){
210	550686	case options::ErrorSelectionRule::VAR_ORDER:
211		// This needs to be the reverse of the minVariableOrder
212	550686	return v > u;
213		case options::ErrorSelectionRule::SUM_METRIC:
214		{
215		uint32_t v_metric = d_errorSet->getMetric(v);
216		uint32_t u_metric = d_errorSet->getMetric(u);
217		if(v_metric == u_metric){
218		return v > u;
219		}else{
220		return v_metric > u_metric;
221		}
222		}
223	480695	case options::ErrorSelectionRule::MINIMUM_AMOUNT:
224		{
225	480695	const DeltaRational& vamt = d_errorSet->getAmount(v);
226	480695	const DeltaRational& uamt = d_errorSet->getAmount(u);
227	480695	int cmp = vamt.cmp(uamt);
228	480695	if(cmp == 0){
229	197333	return v > u;
230		}else{
231	283362	return cmp > 0;
232		}
233		}
234		case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
235		{
236		const DeltaRational& vamt = d_errorSet->getAmount(v);
237		const DeltaRational& uamt = d_errorSet->getAmount(u);
238		int cmp = vamt.cmp(uamt);
239		if(cmp == 0){
240		return v > u;
241		}else{
242		return cmp < 0;
243		}
244		}
245		}
246		Unreachable();
247		}
248
249	229263	void ErrorSet::update(ErrorInformation& ei){
250	229263	if(ei.inFocus()){
251
252	229263	switch(getSelectionRule()){
253	57162	case options::ErrorSelectionRule::MINIMUM_AMOUNT:
254		case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
255	57162	ei.setAmount(computeDiff(ei.getVariable()));
256	57162	d_focus.update(ei.getHandle(), ei.getVariable());
257	57162	break;
258		case options::ErrorSelectionRule::SUM_METRIC:
259		ei.setMetric(sumMetric(ei.getVariable()));
260		d_focus.update(ei.getHandle(), ei.getVariable());
261		break;
262	172101	case options::ErrorSelectionRule::VAR_ORDER:
263		// do nothing
264	172101	break;
265		}
266		}
267	229263	}
268
269		/** A variable becomes satisfied. */
270	300755	void ErrorSet::transitionVariableOutOfError(ArithVar v) {
271	300755	Assert(!inconsistent(v));
272	300755	ErrorInformation& ei = d_errInfo.get(v);
273	300755	Assert(ei.debugInitialized());
274	300755	if(ei.isRelaxed()){
275		ConstraintP viol = ei.getViolated();
276		if(ei.sgn() > 0){
277		d_variables.setLowerBoundConstraint(viol);
278		}else{
279		d_variables.setUpperBoundConstraint(viol);
280		}
281		Assert(!inconsistent(v));
282		ei.setUnrelaxed();
283		}
284	300755	if(ei.inFocus()){
285	300755	d_focus.erase(ei.getHandle());
286	300755	ei.setInFocus(false);
287		}
288	300755	d_errInfo.remove(v);
289	300755	}
290
291
292	393698	void ErrorSet::transitionVariableIntoError(ArithVar v) {
293	393698	Assert(inconsistent(v));
294	393698	bool vilb = d_variables.cmpAssignmentLowerBound(v) < 0;
295	393698	int sgn = vilb ? 1 : -1;
296	787396	ConstraintP c = vilb ?
297	787396	d_variables.getLowerBoundConstraint(v) : d_variables.getUpperBoundConstraint(v);
298	393698	d_errInfo.set(v, ErrorInformation(v, c, sgn));
299	393698	ErrorInformation& ei = d_errInfo.get(v);
300
301	393698	switch(getSelectionRule()){
302	74007	case options::ErrorSelectionRule::MINIMUM_AMOUNT:
303		case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
304	74007	ei.setAmount(computeDiff(v));
305	74007	break;
306		case options::ErrorSelectionRule::SUM_METRIC:
307		ei.setMetric(sumMetric(ei.getVariable()));
308		break;
309	319691	case options::ErrorSelectionRule::VAR_ORDER:
310		// do nothing
311	319691	break;
312		}
313	393698	ei.setInFocus(true);
314	393698	FocusSetHandle handle = d_focus.push(v);
315	393698	ei.setHandle(handle);
316	393698	}
317
318		void ErrorSet::dropFromFocus(ArithVar v) {
319		Assert(inError(v));
320		ErrorInformation& ei = d_errInfo.get(v);
321		Assert(ei.inFocus());
322		d_focus.erase(ei.getHandle());
323		ei.setInFocus(false);
324		d_outOfFocus.push_back(v);
325		}
326
327		void ErrorSet::addBackIntoFocus(ArithVar v) {
328		Assert(inError(v));
329		ErrorInformation& ei = d_errInfo.get(v);
330		Assert(!ei.inFocus());
331		switch(getSelectionRule()){
332		case options::ErrorSelectionRule::MINIMUM_AMOUNT:
333		case options::ErrorSelectionRule::MAXIMUM_AMOUNT:
334		ei.setAmount(computeDiff(v));
335		break;
336		case options::ErrorSelectionRule::SUM_METRIC:
337		ei.setMetric(sumMetric(v));
338		break;
339		case options::ErrorSelectionRule::VAR_ORDER:
340		// do nothing
341		break;
342		}
343
344		ei.setInFocus(true);
345		FocusSetHandle handle = d_focus.push(v);
346		ei.setHandle(handle);
347		}
348
349		void ErrorSet::blur(){
350		while(!d_outOfFocus.empty()){
351		ArithVar v = d_outOfFocus.back();
352		d_outOfFocus.pop_back();
353
354		if(inError(v) && !inFocus(v)){
355		addBackIntoFocus(v);
356		}
357		}
358		}
359
360
361
362	7484026	int ErrorSet::popSignal() {
363	7484026	ArithVar back = d_signals.back();
364	7484026	d_signals.pop_back();
365
366	7484026	if(inError(back)){
367	530018	ErrorInformation& ei = d_errInfo.get(back);
368	530018	int prevSgn = ei.sgn();
369	530018	int focusSgn = ei.focusSgn();
370	530018	bool vilb = d_variables.cmpAssignmentLowerBound(back) < 0;
371	530018	bool viub = d_variables.cmpAssignmentUpperBound(back) > 0;
372	530018	if(vilb \|\| viub){
373	229263	Assert(!vilb \|\| !viub);
374	229263	int currSgn = vilb ? 1 : -1;
375	229263	if(currSgn != prevSgn){
376	1618	ConstraintP curr = vilb ? d_variables.getLowerBoundConstraint(back)
377	1618	: d_variables.getUpperBoundConstraint(back);
378	1092	ei.reset(curr, currSgn);
379		}
380	229263	update(ei);
381		}else{
382	300755	transitionVariableOutOfError(back);
383		}
384	530018	return focusSgn;
385	6954008	}else if(inconsistent(back)){
386	393698	transitionVariableIntoError(back);
387		}
388	6954008	return 0;
389		}
390
391		void ErrorSet::clear(){
392		// Nothing should be relaxed!
393		d_signals.clear();
394		d_errInfo.purge();
395		d_focus.clear();
396		}
397
398		void ErrorSet::clearFocus(){
399		for(ErrorSet::focus_iterator i =focusBegin(), i_end = focusEnd(); i != i_end; ++i){
400		ArithVar f = *i;
401		ErrorInformation& fei = d_errInfo.get(f);
402		fei.setInFocus(false);
403		d_outOfFocus.push_back(f);
404		}
405		d_focus.clear();
406		}
407
408	715389	void ErrorSet::reduceToSignals(){
409	807530	for(error_iterator ei=errorBegin(), ei_end=errorEnd(); ei != ei_end; ++ei){
410	92141	ArithVar curr = *ei;
411	92141	signalVariable(curr);
412		}
413
414	715389	d_errInfo.purge();
415	715389	d_focus.clear();
416	715389	d_outOfFocus.clear();
417	715389	}
418
419	286768	DeltaRational ErrorSet::computeDiff(ArithVar v) const{
420	286768	Assert(inconsistent(v));
421	286768	const DeltaRational& beta = d_variables.getAssignment(v);
422	286768	DeltaRational diff = d_variables.cmpAssignmentLowerBound(v) < 0 ?
423	143724	d_variables.getLowerBound(v) - beta:
424	430492	beta - d_variables.getUpperBound(v);
425
426	286768	Assert(diff.sgn() > 0);
427	286768	return diff;
428		}
429
430		void ErrorSet::debugPrint(std::ostream& out) const {
431		static int instance = 0;
432		++instance;
433		out << "error set debugprint " << instance << endl;
434		for(error_iterator i = errorBegin(), i_end = errorEnd();
435		i != i_end; ++i){
436		ArithVar e = *i;
437		const ErrorInformation& ei = d_errInfo[e];
438		ei.print(out);
439		out << " ";
440		d_variables.printModel(e, out);
441		out << endl;
442		}
443		out << "focus ";
444		for(focus_iterator i = focusBegin(), i_end = focusEnd();
445		i != i_end; ++i){
446		out << *i << " ";
447		}
448		out << ";" << endl;
449		}
450
451		void ErrorSet::focusDownToJust(ArithVar v) {
452		clearFocus();
453
454		ErrorInformation& vei = d_errInfo.get(v);
455		vei.setInFocus(true);
456		FocusSetHandle handle = d_focus.push(v);
457		vei.setHandle(handle);
458		}
459
460		void ErrorSet::pushErrorInto(ArithVarVec& vec) const{
461		for(error_iterator i = errorBegin(), e = errorEnd(); i != e; ++i ){
462		vec.push_back(*i);
463		}
464		}
465
466		void ErrorSet::pushFocusInto(ArithVarVec& vec) const{
467		for(focus_iterator i = focusBegin(), e = focusEnd(); i != e; ++i ){
468		vec.push_back(*i);
469		}
470		}
471
472		} // namespace arith
473		} // namespace theory
474	29337	} // namespace cvc5