Storm.automatic

Benchmark
Model:dpm v.2 (MA)
Parameter(s)N = 4, C = 8, TIME_BOUND = 5
Property:PmaxQueuesFullBound (prob-reach-time-bounded)
Invocation (automatic)
/home/tq429871/storm/build/bin/storm --jani /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ma/dpm/dpm.jani --janiproperty PmaxQueuesFullBound --constants N=4,C=8,TIME_BOUND=5 --engine automatic --sylvan:maxmem 4096 --sylvan:threads 4 --timemem --precision 0.001
Automatic selection
Execution
Walltime:29.940091133117676s
Return code:0
Relative Error:0.0
Log
Storm 1.6.2

Date: Sat Sep  5 21:03:02 2020
Command line arguments: --jani /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ma/dpm/dpm.jani --janiproperty PmaxQueuesFullBound --constants 'N=4,C=8,TIME_BOUND=5' --engine automatic '--sylvan:maxmem' 4096 '--sylvan:threads' 4 --timemem --precision 0.001
Current working directory: /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks

Time for model input parsing: 0.004s.

Automatic engine picked the following settings: 
	engine=sparse	 bisimulation=false	 exact=false
Time for model construction: 1.020s.

-------------------------------------------------------------- 
Model type: 	Markov Automaton (sparse)
States: 	356426
Transitions: 	681242
Choices: 	418842
Markovian St.: 	94730
Max. Rate.: 	4.1
Reward Models:  none
State Labels: 	3 labels
   * deadlock -> 0 item(s)
   * (((((((((((4 < 1) | (items1 = 8)) & ((4 < 2) | (items2 = 8))) & ((4 < 3) | (items3 = 8))) & ((4 < 4) | (items4 = 8))) & ((4 < 5) | (items5 = 8))) & ((4 < 6) | (items6 = 8))) & ((4 < 7) | (items7 = 8))) & ((4 < 8) | (items8 = 8))) & ((4 < 9) | (items9 = 8))) & ((4 < 10) | (items10 = 8))) -> 10 item(s)
   * init -> 1 item(s)
Choice Labels: 	none
-------------------------------------------------------------- 

Time for model preprocessing: 0.000s.

-------------------------------------------------------------- 
Model type: 	Markov Automaton (sparse)
States: 	356426
Transitions: 	681242
Choices: 	418842
Markovian St.: 	94730
Max. Rate.: 	4.1
Reward Models:  none
State Labels: 	3 labels
   * deadlock -> 0 item(s)
   * (((((((((((4 < 1) | (items1 = 8)) & ((4 < 2) | (items2 = 8))) & ((4 < 3) | (items3 = 8))) & ((4 < 4) | (items4 = 8))) & ((4 < 5) | (items5 = 8))) & ((4 < 6) | (items6 = 8))) & ((4 < 7) | (items7 = 8))) & ((4 < 8) | (items8 = 8))) & ((4 < 9) | (items9 = 8))) & ((4 < 10) | (items10 = 8))) -> 10 item(s)
   * init -> 1 item(s)
Choice Labels: 	none
-------------------------------------------------------------- 

Model checking property "PmaxQueuesFullBound": Pmax=? [true U<=5 (((((((((((4 < 1) | (items1 = 8)) & ((4 < 2) | (items2 = 8))) & ((4 < 3) | (items3 = 8))) & ((4 < 4) | (items4 = 8))) & ((4 < 5) | (items5 = 8))) & ((4 < 6) | (items6 = 8))) & ((4 < 7) | (items7 = 8))) & ((4 < 8) | (items8 = 8))) & ((4 < 9) | (items9 = 8))) & ((4 < 10) | (items10 = 8)))] ...
 WARN (numerical.cpp:130): Fox-Glynn: right = 627 >> lambda = 400, cannot bound the right tail. The results are unreliable.
ERROR (numerical.cpp:222): Fox-Glynn: 627 > 600, underflow is possible.
 WARN (numerical.cpp:130): Fox-Glynn: right = 627 >> lambda = 400, cannot bound the right tail. The results are unreliable.
ERROR (numerical.cpp:222): Fox-Glynn: 627 > 600, underflow is possible.
 WARN (numerical.cpp:130): Fox-Glynn: right = 627 >> lambda = 400, cannot bound the right tail. The results are unreliable.
ERROR (numerical.cpp:222): Fox-Glynn: 627 > 600, underflow is possible.
 WARN (numerical.cpp:130): Fox-Glynn: right = 627 >> lambda = 400, cannot bound the right tail. The results are unreliable.
ERROR (numerical.cpp:222): Fox-Glynn: 627 > 600, underflow is possible.
Result (for initial states): 2.232421354e-08
Time for model checking: 28.652s.

Performance statistics:
  * peak memory usage: 101MB
  * CPU time: 29.584s
  * wallclock time: 29.683s