$BENCH_HOME/bin/storm-pomdp --prism $BENCH_HOME/models/clean/clean.prism --prop $BENCH_HOME/models/clean/clean.props rbrmax2 -const N=6,B1=55,B2=5 --timemem --statistics --revised --unfold-reward-bound --belief-exploration discretize --resolution 8 --triangulationmode static
Storm-pomdp. Unfolds cost bounds, not cost aware, with discretization and resolution 8
Storm-POMDP 1.9.1 (dev)
Date: Mon Feb 10 10:00:20 2025
Command line arguments: --prism $BENCH_HOME/models/clean/clean.prism --prop $BENCH_HOME/models/clean/clean.props rbrmax2 -const 'N=6,B1=55,B2=5' --timemem --statistics --revised --unfold-reward-bound --belief-exploration discretize --resolution 8 --triangulationmode static
Current working directory: $BENCH_HOME/experiments64gb
Time for model input parsing: 0.001s.
Time for model construction: 0.010s.
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 37
Transitions: 74
Choices: 50
Observations: 2
Reward Models: energy, clean
State Labels: 3 labels
* deadlock -> 0 item(s)
* init -> 1 item(s)
* goal -> 1 item(s)
Choice Labels: 3 labels
* clean -> 13 item(s)
* move -> 13 item(s)
* consume -> 24 item(s)
--------------------------------------------------------------
Analyzing property 'Pmax=? [true U^{rew{"energy"}<=55 , rew{"clean"}>5 }"goal"]'
Perform explicit unfolding of reward bounds.
bounded reachability processing done. POMDP Information:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 3468
Transitions: 6915
Choices: 4816
Observations: 2
Reward Models: none
State Labels: 5 labels
* dim0_active -> 3431 item(s)
* goal -> 309 item(s)
* dim1_active -> 75 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 3 labels
* move -> 1348 item(s)
* consume -> 2120 item(s)
* clean -> 1348 item(s)
--------------------------------------------------------------
Transformed formula: Pmax=? [(true & "dim0_active") U (("goal" & "dim0_active") & "dim1_active")]
Time for pre-processing: 0.002s.
Exploring the belief MDP...
Exploring the belief space...
Constructing the belief MDP...
--------------------------------------------------------------
Model type: MDP (sparse)
States: 55025997
Transitions: 161430614
Choices: 77263803
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: 373.007s.
Time for building the belief MDP: 20.053s.
Time for analyzing the belief MDP: 21.845s.
##### POMDP Approximation Statistics ######
# Input model:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 3468
Transitions: 6891
Choices: 4816
Observations: 3
Reward Models: none
State Labels: 5 labels
* dim0_active -> 3431 item(s)
* goal -> 309 item(s)
* dim1_active -> 75 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 3 labels
* move -> 1348 item(s)
* consume -> 2120 item(s)
* clean -> 1348 item(s)
--------------------------------------------------------------
# Max. Number of states with same observation: 2120
# Pre-computations detected that the belief MDP is finite.
# Total check time: 458.778s
##########################################
Result: ≤ 0.9967641168
Time for POMDP analysis: 458.778s.
Performance statistics:
* peak memory usage: 35338MB
* CPU time: 443.020s
* wallclock time: 458.794s
############################## Notes ##############################
Storm-pomdp. Unfolds cost bounds, not cost aware, with discretization and resolution 8