Browse Source

Further improved treatment of solutions with only unreachable target states.

Former-commit-id: c36920c46c
tempestpy_adaptions
dehnert 11 years ago
parent
commit
2201581ac3
  1. 37
      src/counterexamples/SMTMinimalCommandSetGenerator.h

37
src/counterexamples/SMTMinimalCommandSetGenerator.h

@ -995,18 +995,23 @@ namespace storm {
throw storm::exceptions::InvalidStateException() << "Target must be unreachable for this analysis.";
}
storm::storage::BitVector unreachableRelevantStates = ~reachableStates & relevancyInformation.relevantStates;
storm::storage::BitVector statesThatCanReachTargetStates = storm::utility::graph::performProbGreater0E(subMdp, subMdp.getBackwardTransitions(), phiStates, psiStates);
std::vector<std::set<uint_fast64_t>> guaranteedLabelSets = storm::utility::counterexamples::getGuaranteedLabelSets(originalMdp, statesThatCanReachTargetStates, relevancyInformation.relevantLabels);
std::vector<std::set<uint_fast64_t>> const& choiceLabeling = originalMdp.getChoiceLabeling();
std::set<std::set<uint_fast64_t>> cutLabels;
uint_fast64_t numberOfBorderStates = 0;
for (auto state : reachableStates) {
bool isBorderState = false;
for (auto currentChoice : relevancyInformation.relevantChoicesForRelevantStates.at(state)) {
if (!storm::utility::set::isSubsetOf(choiceLabeling[currentChoice], commandSet)) {
for (typename storm::storage::SparseMatrix<T>::ConstIndexIterator successorIt = originalMdp.getTransitionMatrix().constColumnIteratorBegin(currentChoice), successorIte = originalMdp.getTransitionMatrix()x^.constColumnIteratorEnd(currentChoice); successorIt != successorIte; ++successorIt) {
if (unreachableRelevantStates.get(*successorIt)) {
isBorderState = true;
}
}
if (isBorderState) {
std::set<uint_fast64_t> currentLabelSet;
for (auto label : choiceLabeling[currentChoice]) {
if (commandSet.find(label) == commandSet.end()) {
@ -1020,9 +1025,6 @@ namespace storm {
cutLabels.insert(currentLabelSet);
}
}
if (isBorderState) {
++numberOfBorderStates;
}
}
@ -1042,34 +1044,7 @@ namespace storm {
}
LOG4CPLUS_DEBUG(logger, "Asserting reachability implications.");
// std::cout << "reachability implications:" << std::endl;
// for (auto e : formulae) {
// std::cout << e << ", ";
// }
// std::cout << std::endl;
assertDisjunction(context, solver, formulae);
//
// std::cout << "formulae: " << std::endl;
// for (auto e : formulae) {
// std::cout << e << ", ";
// }
// std::cout << std::endl;
//
// storm::storage::BitVector unreachableRelevantStates = ~reachableStates & relevancyInformation.relevantStates;
// std::cout << unreachableRelevantStates.toString() << std::endl;
// std::cout << reachableStates.toString() << std::endl;
// std::cout << "reachable commands" << std::endl;
// for (auto label : reachableLabels) {
// std::cout << label << ", ";
// }
// std::cout << std::endl;
// std::cout << "cut commands" << std::endl;
// for (auto label : cutLabels) {
// std::cout << label << ", ";
// }
// std::cout << std::endl;
}
#endif

Loading…
Cancel
Save