$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 --unfold-reward-bound --belief-exploration discretize --resolution 15 --triangulationmode static
Storm-pomdp. Unfolds cost bounds, cost aware, with discretization and resolution 15
Storm-POMDP 1.9.1 (dev)
Date: Mon Feb 10 15:03:45 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 --unfold-reward-bound --belief-exploration discretize --resolution 15 --triangulationmode static
Current working directory: $BENCH_HOME/experiments64gb
Time for model input parsing: 0.001s.
Time for model construction: 0.009s.
--------------------------------------------------------------
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"]'
Perform explicit unfolding of reward bounds.
Extend observation function to become reward aware.
bounded reachability processing done. POMDP Information:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 10169
Transitions: 43303
Choices: 26858
Observations: 47
Reward Models: obsCost
State Labels: 4 labels
* goal -> 82 item(s)
* dim0_active -> 10044 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 3 labels
* observe -> 6684 item(s)
* stop -> 10169 item(s)
* move -> 10005 item(s)
--------------------------------------------------------------
Transformed formula: Pmax=? [(true & "dim0_active") U ("goal" & "dim0_active")]
Time for pre-processing: 0.008s.
Exploring the belief MDP...
Exploring the belief space...
Constructing the belief MDP...
--------------------------------------------------------------
Model type: MDP (sparse)
States: 1558876
Transitions: 18779905
Choices: 4673141
Reward Models: none
State Labels: 3 labels
* target -> 1 item(s)
* init -> 1 item(s)
* bottom -> 1 item(s)
Choice Labels: none
--------------------------------------------------------------
Time for exploring beliefs: 13.276s.
Time for building the belief MDP: 0.800s.
Time for analyzing the belief MDP: 22.890s.
##### POMDP Approximation Statistics ######
# Input model:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 10169
Transitions: 43101
Choices: 26858
Observations: 48
Reward Models: obsCost
State Labels: 4 labels
* goal -> 82 item(s)
* dim0_active -> 10044 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 3 labels
* observe -> 6684 item(s)
* stop -> 10169 item(s)
* move -> 10005 item(s)
--------------------------------------------------------------
# Max. Number of states with same observation: 3362
# Total check time: 38.008s
##########################################
Result: ≤ 0.9488427708
Time for POMDP analysis: 38.009s.
Performance statistics:
* peak memory usage: 2149MB
* CPU time: 37.424s
* wallclock time: 38.034s
############################## Notes ##############################
Storm-pomdp. Unfolds cost bounds, cost aware, with discretization and resolution 15