You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

71 lines
3.3 KiB

  1. /*
  2. * MarkovAutomatonParserTest.cpp
  3. *
  4. * Created on: 25.02.2014
  5. * Author: Manuel Sascha Weiand
  6. */
  7. #include "gtest/gtest.h"
  8. #include "storm-config.h"
  9. #include "src/parser/MarkovAutomatonParser.h"
  10. #include "src/exceptions/FileIoException.h"
  11. TEST(MarkovAutomatonParserTest, NonExistingFile) {
  12. // No matter what happens, please do NOT create a file with the name "nonExistingFile.not"!
  13. ASSERT_THROW(storm::parser::MarkovAutomatonParser::parseMarkovAutomaton(STORM_CPP_TESTS_BASE_PATH "/nonExistingFile.not", STORM_CPP_TESTS_BASE_PATH "/nonExistingFile.not", STORM_CPP_TESTS_BASE_PATH "/nonExistingFile.not"), storm::exceptions::FileIoException);
  14. }
  15. TEST(MarkovAutomatonParserTest, BasicParsing) {
  16. // Get the parsing result.
  17. storm::models::MarkovAutomaton<double> result = storm::parser::MarkovAutomatonParser::parseMarkovAutomaton(STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_general.tra", STORM_CPP_TESTS_BASE_PATH "/functional/parser/lab_files/ma_general.lab", STORM_CPP_TESTS_BASE_PATH "/functional/parser/rew_files/ma_general.state.rew");
  18. // Test sizes and counts.
  19. ASSERT_EQ(6, result.getNumberOfStates());
  20. ASSERT_EQ(7, result.getNumberOfChoices());
  21. ASSERT_EQ(12, result.getNumberOfTransitions());
  22. // Test the exit rates. These have to be 0 for all non-Markovian states.
  23. std::vector<double> rates = result.getExitRates();
  24. ASSERT_EQ(2, result.getExitRate(0));
  25. ASSERT_FALSE(result.isMarkovianState(1));
  26. ASSERT_EQ(0, result.getExitRate(1));
  27. ASSERT_EQ(15, result.getExitRate(2));
  28. ASSERT_FALSE(result.isMarkovianState(3));
  29. ASSERT_EQ(0, result.getExitRate(3));
  30. ASSERT_FALSE(result.isMarkovianState(4));
  31. ASSERT_EQ(0, result.getExitRate(4));
  32. ASSERT_FALSE(result.isMarkovianState(5));
  33. ASSERT_EQ(0, result.getExitRate(5));
  34. // Test the labeling.
  35. ASSERT_EQ(3, result.getStateLabeling().getNumberOfAtomicPropositions());
  36. ASSERT_EQ(1, result.getInitialStates().getNumberOfSetBits());
  37. ASSERT_EQ(0, result.getLabelsForState(4).size());
  38. ASSERT_EQ(1, result.getStateLabeling().getLabeledStates("goal").getNumberOfSetBits());
  39. // Test the state rewards.
  40. ASSERT_TRUE(result.hasStateRewards());
  41. double rewardSum = 0;
  42. for(uint_fast64_t i = 0; i < result.getStateRewardVector().size(); i++) {
  43. rewardSum += result.getStateRewardVector()[i];
  44. }
  45. ASSERT_EQ(1015.765099984, rewardSum);
  46. ASSERT_EQ(0, result.getStateRewardVector()[0]);
  47. // Test the transition rewards.
  48. ASSERT_FALSE(result.hasTransitionRewards());
  49. }
  50. TEST(MarkovAutomatonParserTest, MismatchedFiles) {
  51. // Test file combinations that do not match, i.e. differing number of states, transitions, etc.
  52. // The labeling file contains a label for a non existent state.
  53. ASSERT_THROW(storm::parser::MarkovAutomatonParser::parseMarkovAutomaton(STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_general.tra", STORM_CPP_TESTS_BASE_PATH "/functional/parser/lab_files/ma_mismatched.lab"), storm::exceptions::OutOfRangeException);
  54. // The state reward file contains a reward for a non existent state.
  55. ASSERT_THROW(storm::parser::MarkovAutomatonParser::parseMarkovAutomaton(STORM_CPP_TESTS_BASE_PATH "/functional/parser/tra_files/ma_general.tra", STORM_CPP_TESTS_BASE_PATH "/functional/parser/lab_files/ma_general.lab", STORM_CPP_TESTS_BASE_PATH "/functional/parser/rew_files/ma_mismatched.state.rew"), storm::exceptions::OutOfRangeException);
  56. }