Checking formulas with >=0 bound.

src/storm/logic/Bound.h

@@ -17,7 +17,7 @@ namespace storm {
             storm::expressions::Expression threshold;
 
             template <typename ValueType>
-            bool isSatisfied(ValueType const& compareValue) {
+            bool isSatisfied(ValueType const& compareValue) const {
                 ValueType thresholdAsValueType = storm::utility::convertNumber<ValueType>(threshold.evaluateAsRational());
                 switch(comparisonType) {
                     case ComparisonType::Greater:

src/storm/modelchecker/prctl/helper/rewardbounded/Dimension.h

@@ -12,13 +12,31 @@ namespace storm {
                 
                 template<typename ValueType>
                 struct Dimension {
+                    /// The formula describing this dimension
                     std::shared_ptr<storm::logic::Formula const> formula;
+
+                    /// The index of the associated objective
                     uint64_t objectiveIndex;
+
+                    /// A label that indicates the states where this dimension is still relevant (i.e., it is yet unknown whether the corresponding objective holds)
                     boost::optional<std::string> memoryLabel;
+
+                    /// True iff the objective is not bounded at all (i.e., it has lower bound >= 0)
+                    bool isNotBounded;
+
+                    /// True iff the objective is upper bounded, false if it has a lower bound or no bound at all.
                     bool isUpperBounded;
+
+                    /// Multiplying an epoch value with this factor yields the reward/cost in the original domain.
                     ValueType scalingFactor;
+
+                    /// The dimensions that are not satisfiable whenever the bound of this dimension is violated
                     storm::storage::BitVector dependentDimensions;
+
+                    /// The maximal epoch value that needs to be considered for this dimension
                     boost::optional<uint64_t> maxValue;
+
+                    /// Whether we minimize/maximize the objective for this dimension
                     boost::optional<storm::solver::OptimizationDirection> optimizationDirection;
                 };
             }

src/storm/modelchecker/prctl/helper/rewardbounded/MultiDimensionalRewardUnfolding.cpp

@@ -86,15 +86,20 @@ namespace storm {
                                     memLabel = "_" + memLabel;
                                 }
                                 dimension.memoryLabel = memLabel;
-                                dimension.isUpperBounded = subformula.hasUpperBound(dim);
-                                // for simplicity we do not allow intervals or unbounded formulas.
-                                // TODO: Quantiles: allow unbounded formulas
-                                STORM_LOG_THROW(subformula.hasLowerBound(dim) != dimension.isUpperBounded, storm::exceptions::NotSupportedException, "Bounded until formulas are only supported by this method if they consider either an upper bound or a lower bound. Got " << subformula << " instead.");
+                                // for simplicity we do not allow interval formulas.
+                                STORM_LOG_THROW(!subformula.hasLowerBound(dim) ||  !subformula.hasUpperBound(dim), storm::exceptions::NotSupportedException, "Bounded until formulas are only supported by this method if they consider either an upper bound or a lower bound. Got " << subformula << " instead.");
                                 // lower bounded until formulas with non-trivial left hand side are excluded as this would require some additional effort (in particular the ProductModel::transformMemoryState method).
                                 STORM_LOG_THROW(dimension.isUpperBounded || subformula.getLeftSubformula(dim).isTrueFormula(), storm::exceptions::NotSupportedException, "Lower bounded until formulas are only supported by this method if the left subformula is 'true'. Got " << subformula << " instead.");
-                                if (subformula.getTimeBoundReference(dim).isTimeBound() || subformula.getTimeBoundReference(dim).isStepBound()) {
+                                dimension.isUpperBounded = subformula.hasUpperBound(dim);
+                                // Treat formulas that aren't acutally bounded differently
+                                if ((!subformula.hasLowerBound(dim) && !subformula.hasUpperBound(dim)) || (subformula.hasLowerBound(dim) && !subformula.isLowerBoundStrict(dim) && !subformula.getLowerBound(dim).containsVariables() && storm::utility::isZero(subformula.getLowerBound(dim).evaluateAsRational()))) {
+                                    dimensionWiseEpochSteps.push_back(std::vector<uint64_t>(model.getTransitionMatrix().getRowCount(), 0));
+                                    dimension.scalingFactor = storm::utility::zero<ValueType>();
+                                    dimension.isNotBounded = true;
+                                } else if (subformula.getTimeBoundReference(dim).isTimeBound() || subformula.getTimeBoundReference(dim).isStepBound()) {
                                     dimensionWiseEpochSteps.push_back(std::vector<uint64_t>(model.getTransitionMatrix().getRowCount(), 1));
                                     dimension.scalingFactor = storm::utility::one<ValueType>();
+                                    dimension.isNotBounded = false;
                                 } else {
                                     STORM_LOG_ASSERT(subformula.getTimeBoundReference(dim).isRewardBound(), "Unexpected type of time bound.");
                                     std::string const& rewardName = subformula.getTimeBoundReference(dim).getRewardName();
@@ -105,6 +110,7 @@ namespace storm {
                                     auto discretizedRewardsAndFactor = storm::utility::vector::toIntegralVector<ValueType, uint64_t>(actionRewards);
                                     dimensionWiseEpochSteps.push_back(std::move(discretizedRewardsAndFactor.first));
                                     dimension.scalingFactor = std::move(discretizedRewardsAndFactor.second);
+                                    dimension.isNotBounded = false;
                                 }
                                 dimensions.emplace_back(std::move(dimension));
                             }
@@ -115,6 +121,7 @@ namespace storm {
                                 dimension.formula = subformula.restrictToDimension(dim);
                                 dimension.objectiveIndex = objIndex;
                                 dimension.isUpperBounded = true;
+                                dimension.isNotBounded = false;
                                 if (subformula.getTimeBoundReference(dim).isTimeBound() || subformula.getTimeBoundReference(dim).isStepBound()) {
                                     dimensionWiseEpochSteps.push_back(std::vector<uint64_t>(model.getTransitionMatrix().getRowCount(), 1));
                                     dimension.scalingFactor = storm::utility::one<ValueType>();
@@ -218,9 +225,11 @@ namespace storm {
                             isStrict = dimFormula.asCumulativeRewardFormula().isBoundStrict();
                         }
                         
-                        if (bound.containsVariables()) {
+                        if (!bound.containsVariables()) {
                             ValueType discretizedBound = storm::utility::convertNumber<ValueType>(bound.evaluateAsRational());
-                            STORM_LOG_THROW(dimensions[dim].isUpperBounded || isStrict || !storm::utility::isZero(discretizedBound), storm::exceptions::NotSupportedException, "Lower bounds need to be either strict or greater than zero.");
+                            // We always consider upper bounds to be non-strict and lower bounds to be strict.
+                            // Thus, >=N would become >N-1. However, note that the case N=0 needs extra treatment
+                            if (!dimensions[dim].isNotBounded) {
                                 discretizedBound /= dimensions[dim].scalingFactor;
                                 if (storm::utility::isInteger(discretizedBound)) {
                                     if (isStrict == dimensions[dim].isUpperBounded) {
@@ -235,14 +244,19 @@ namespace storm {
                             }
                         }
                     }
+                }
         
                 template<typename ValueType, bool SingleObjectiveMode>
                 typename MultiDimensionalRewardUnfolding<ValueType, SingleObjectiveMode>::Epoch MultiDimensionalRewardUnfolding<ValueType, SingleObjectiveMode>::getStartEpoch() {
                     Epoch startEpoch = epochManager.getZeroEpoch();
                     for (uint64_t dim = 0; dim < epochManager.getDimensionCount(); ++dim) {
+                        if (dimensions[dim].isNotBounded) {
+                            epochManager.setBottomDimension(startEpoch, dim);
+                        } else {
                             STORM_LOG_ASSERT(dimensions[dim].maxValue,  "No max-value for dimension " << dim << " was given.");
                             epochManager.setDimensionOfEpoch(startEpoch, dim, dimensions[dim].maxValue.get());
                         }
+                    }
                     STORM_LOG_TRACE("Start epoch is " << epochManager.toString(startEpoch));
                     return startEpoch;
                 }

src/storm/modelchecker/prctl/helper/rewardbounded/ProductModel.cpp

@@ -460,9 +460,13 @@ namespace storm {
                     
                     Epoch startEpoch = epochManager.getZeroEpoch();
                     for (uint64_t dim = 0; dim < epochManager.getDimensionCount(); ++dim) {
+                        if (dimensions[dim].isNotBounded) {
+                            epochManager.setBottomDimension(startEpoch, dim);
+                        } else {
                             STORM_LOG_ASSERT(dimensions[dim].maxValue,  "No max-value for dimension " << dim << " was given.");
                             epochManager.setDimensionOfEpoch(startEpoch, dim, dimensions[dim].maxValue.get());
                         }
+                    }
                     
                     std::set<Epoch> seenEpochs({startEpoch});
                     std::vector<Epoch> dfsStack({startEpoch});

src/storm/modelchecker/prctl/helper/rewardbounded/QuantileHelper.cpp

@@ -116,23 +116,13 @@ namespace storm {
                     // initialize data that will be needed for each epoch
                     std::vector<ValueType> x, b;
                     std::unique_ptr<storm::solver::MinMaxLinearEquationSolver<ValueType>> minMaxSolver;
-/*
-                    ValueType precision = rewardUnfolding.getRequiredEpochModelPrecision(initEpoch, storm::utility::convertNumber<ValueType>(storm::settings::getModule<storm::settings::modules::GeneralSettings>().getPrecision()));
-                    Environment preciseEnv = env;
-                    preciseEnv.solver().minMax().setPrecision(storm::utility::convertNumber<storm::RationalNumber>(precision));
 
                     auto& epochModel = rewardUnfolding.setCurrentEpoch(initEpoch);
-                    // If the epoch matrix is empty we do not need to solve a linear equation system
-                    if (epochModel.epochMatrix.getEntryCount() == 0) {
-                        rewardUnfolding.setSolutionForCurrentEpoch(analyzeTrivialMdpEpochModel<ValueType>(dir, epochModel));
-                    } else {
-                        rewardUnfolding.setSolutionForCurrentEpoch(analyzeNonTrivialMdpEpochModel<ValueType>(preciseEnv, dir, epochModel, x, b, minMaxSolver, lowerBound, upperBound));
-                    }
+                    rewardUnfolding.setSolutionForCurrentEpoch(epochModel.analyzeSingleObjective(env, quantileFormula.getSubformula().asProbabilityOperatorFormula().getOptimalityType(), x, b, minMaxSolver, lowerBound, upperBound));
 
                     ValueType numericResult = rewardUnfolding.getInitialStateResult(initEpoch);
                     std::cout << "Numeric result is " << numericResult;
                     return unboundedFormula->getBound().isSatisfied(numericResult);
-  */
                 }
 
 

src/storm/transformer/EndComponentEliminator.h

@@ -42,7 +42,7 @@ namespace storm {
              * If addSelfLoopAtSinkStates is true, such rows get a selfloop (with value 1). Otherwise, the row remains empty.
              */
             static EndComponentEliminatorReturnType transform(storm::storage::SparseMatrix<ValueType> const& originalMatrix, storm::storage::BitVector const& subsystemStates, storm::storage::BitVector const& possibleECRows, storm::storage::BitVector const& addSinkRowStates, bool addSelfLoopAtSinkStates = false) {
-                STORM_LOG_DEBUG("Invoked EndComponentEliminator on matrix with " << originalMatrix.getRowGroupCount() << " row groups.");
+                STORM_LOG_DEBUG("Invoked EndComponentEliminator on matrix with " << originalMatrix.getRowGroupCount() << " row groups and " << subsystemStates.getNumberOfSetBits() << " subsystem states.");
                 
                 storm::storage::MaximalEndComponentDecomposition<ValueType> ecs = computeECs(originalMatrix, possibleECRows, subsystemStates);