$BENCH_HOME/bin/storm-pomdp --prism $BENCH_HOME/models/walk/walk.prism --prop $BENCH_HOME/models/walk/walk.props rbrmax1 -const N=40,B1=80 --timemem --statistics --revised --reward-aware --belief-exploration discretize --resolution 49 --triangulationmode static
Storm-pomdp. Sequential approach, cost aware, with discretization and resolution 49
Storm-POMDP 1.9.1 (dev)
Date: Mon Feb 10 15:03:44 2025
Command line arguments: --prism $BENCH_HOME/models/walk/walk.prism --prop $BENCH_HOME/models/walk/walk.props rbrmax1 -const 'N=40,B1=80' --timemem --statistics --revised --reward-aware --belief-exploration discretize --resolution 49 --triangulationmode static
Current working directory: $BENCH_HOME/experiments64gb
Time for model input parsing: 0.002s.
Time for model construction: 0.012s.
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 84
Transitions: 328
Choices: 207
Observations: 44
Reward Models: obsCost
State Labels: 3 labels
* deadlock -> 0 item(s)
* init -> 1 item(s)
* goal -> 1 item(s)
Choice Labels: 3 labels
* observe -> 41 item(s)
* move -> 82 item(s)
* stop -> 84 item(s)
--------------------------------------------------------------
Analyzing property 'Pmax=? [true Urew{"obsCost"}<=80 "goal"]'
Extend observation function to become reward aware.
bounded reachability processing done. POMDP Information:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 126
Transitions: 537
Choices: 333
Observations: 47
Reward Models: obsCost
State Labels: 3 labels
* goal -> 1 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 3 labels
* observe -> 83 item(s)
* stop -> 126 item(s)
* move -> 124 item(s)
--------------------------------------------------------------
Transformed formula: Pmax=? [true Urew{"obsCost"}<=80 "goal"]
Time for pre-processing: 0.000s.
Exploring the belief MDP...
Exploring the belief space...
Constructing the belief MDP...
--------------------------------------------------------------
Model type: MDP (sparse)
States: 3366288
Transitions: 71331905
Choices: 10098817
Reward Models: obsCost
State Labels: 3 labels
* target -> 1 item(s)
* init -> 1 item(s)
* bottom -> 1 item(s)
Choice Labels: none
--------------------------------------------------------------
Analyzing property 'Pmax=? [true Urew{"obsCost"}<=80 "target"]' on the belief MDP...
Transformation of transition rewards resulted in a model with 5049451 states. 1.500005644 times more states than the original belief MDP.
Merging of sink states resulted in a model with 5049445 states.
Epoch model for epoch <_> is cyclic.
WARN (TopologicalMinMaxLinearEquationSolver.cpp:148): Topological solver aborted after analyzing 718904/3357049 SCCs.
ERROR: The program received signal 15 and will be aborted in 3s.
Received signal 11
----------
Computation aborted after 1800.2604820728302 seconds since the total time limit of 1800 seconds was exceeded.
############################## Notes ##############################
Storm-pomdp. Sequential approach, cost aware, with discretization and resolution 49