ss << "Looping word equation encountered." << std::endl;
throw LogicException(ss.str());
}
+ if (!options::stringProcessLoop())
+ {
+ d_out->setIncomplete();
+ return false;
+ }
NodeManager* nm = NodeManager::currentNM();
Node conc;
Trace("strings-loop") << "Detected possible loop for "
d_regexp_ant[str_in_re] = ant;
}
// we will be done
- if (options::stringProcessLoop())
- {
- info.d_conc = conc;
- info.d_id = INFER_FLOOP;
- info.d_nf_pair[0] = normal_form_src[i];
- info.d_nf_pair[1] = normal_form_src[j];
- return true;
- }
- d_out->setIncomplete();
- return false;
+ info.d_conc = conc;
+ info.d_id = INFER_FLOOP;
+ info.d_nf_pair[0] = normal_form_src[i];
+ info.d_nf_pair[1] = normal_form_src[j];
+ return true;
}
//return true for lemma, false if we succeed