# storm.belseqc27

Benchmark

id: | main_obstcl_rbrmax2_B125-B27 (POMDP)

Invocation (belseqc27)

    $BENCH_HOME/bin/storm-pomdp --prism $BENCH_HOME/models/obstcl/obstcl.prism --prop $BENCH_HOME/models/obstcl/obstcl.props rbrmax2 -const B1=25,B2=7 --timemem --statistics --revised --reward-aware --belief-exploration unfold --size-threshold 134217728

Storm-pomdp. Sequential approach, cost aware, with cutoffs and size threshold 2^27
Execution

Walltime: | 496.3933975696564s
Return code: | -9
Note(s): | Storm-pomdp. Sequential approach, cost aware, with cutoffs and size threshold 2^27

Log

    Storm-POMDP 1.9.1 (dev)

    Date: Mon Feb 10 14:16:44 2025
    Command line arguments: --prism $BENCH_HOME/models/obstcl/obstcl.prism --prop $BENCH_HOME/models/obstcl/obstcl.props rbrmax2 -const 'B1=25,B2=7' --timemem --statistics --revised --reward-aware --belief-exploration unfold --size-threshold 134217728
    Current working directory: $BENCH_HOME/experiments64gb

    Time for model input parsing: 0.004s.

    Time for model construction: 0.020s.

    --------------------------------------------------------------
    Model type: 	POMDP (sparse)
    States: 	25
    Transitions: 	115
    Choices: 	80
    Observations: 	10
    Reward Models:  steps, energy
    State Labels: 	3 labels
       * deadlock -> 0 item(s)
       * init -> 1 item(s)
       * goal -> 1 item(s)
    Choice Labels: 	4 labels
       * north -> 20 item(s)
       * east -> 20 item(s)
       * south -> 20 item(s)
       * west -> 20 item(s)
    --------------------------------------------------------------
    Analyzing property 'Pmax=? [true U^{rew{"energy"}<=25 , rew{"steps"}<=7 }"goal"]'
    Extend observation function to become reward aware.
    bounded reachability processing done. POMDP Information:
    --------------------------------------------------------------
    Model type: 	POMDP (sparse)
    States: 	43
    Transitions: 	202
    Choices: 	139
    Observations: 	23
    Reward Models:  steps, energy
    State Labels: 	3 labels
       * goal -> 2 item(s)
       * deadlock -> 0 item(s)
       * init -> 1 item(s)
    Choice Labels: 	4 labels
       * west -> 34 item(s)
       * south -> 35 item(s)
       * north -> 35 item(s)
       * east -> 35 item(s)
    --------------------------------------------------------------
    Transformed formula: Pmax=? [true U^{rew{"energy"}<=25 , rew{"steps"}<=7 }"goal"]
    Time for pre-processing: 0.000s.
    Exploring the belief MDP...
    Exploring the belief space...

    ############################## Notes ##############################
    Storm-pomdp. Sequential approach, cost aware, with cutoffs and size threshold 2^27