PRISM
=====
Version: 4.8.1
Date: Fri Sep 13 10:51:35 GMT+01:00 2024
Hostname: r23m0212.hpc.itc.rwth-aachen.de
Memory limits: cudd=1g, java(heap)=1g
Command line: prism /rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/ctmc/embedded/embedded.prism -const MAX_COUNT=4 -steadystate -explicit -relative -epsilon 0.001
Parsing model file "/rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/ctmc/embedded/embedded.prism"...
Type: CTMC
Modules: sensors proci actuators proco procm bus
Variables: s i a o m count comp reqi reqo
---------------------------------------------------------------------
Computing steady-state probabilities...
Building model...
Model constants: MAX_COUNT=4
Computing reachable states... 5168 states
Reachable states exploration and model construction done in 0.071 secs.
Sorting reachable states list...
Time for model construction: 0.116 seconds.
Type: CTMC
States: 5168 (1 initial)
Transitions: 21773
Building embedded DTMC...
Doing steady-state computation in embedded DTMC (with exit-rate weighting for BSCC probabilities)...
Computing probability of reaching BSCC 1
Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain... done (0.003 seconds)
Starting Prob0...
Prob0 took 0.003 seconds.
Starting Prob1...
Prob1 took 0.004 seconds.
target=1, yes=216, no=3852, maybe=1100
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 374 iterations, 2572372 multiplications and 0.102 seconds.
Probabilistic reachability took 0.122 seconds.
Probability of reaching BSCC 1: 0.00915847148369742
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.003 seconds.
target=1, yes=126, no=4332, maybe=710
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 212 iterations, 972656 multiplications and 0.031 seconds.
Probabilistic reachability took 0.035 seconds.
Probability of reaching BSCC 2: 1.9585281858731759E-7
Computing probability of reaching BSCC 3
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.002 seconds.
target=1, yes=108, no=3558, maybe=1502
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 404 iterations, 3732960 multiplications and 0.139 seconds.
Probabilistic reachability took 0.142 seconds.
Probability of reaching BSCC 3: 4.717171023702061E-4
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=216, no=3852, maybe=1100
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 248 iterations, 1705744 multiplications and 0.053 seconds.
Probabilistic reachability took 0.054 seconds.
Probability of reaching BSCC 4: 0.0026296964812020807
Computing probability of reaching BSCC 5
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=72, no=4092, maybe=1004
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 408 iterations, 2590800 multiplications and 0.076 seconds.
Probabilistic reachability took 0.078 seconds.
Probability of reaching BSCC 5: 1.3935995583753663E-5
Computing probability of reaching BSCC 6
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=42, no=4556, maybe=570
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 267 iterations, 1030620 multiplications and 0.028 seconds.
Probabilistic reachability took 0.028 seconds.
Probability of reaching BSCC 6: 1.3103989757765094E-10
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=36, no=3906, maybe=1226
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 443 iterations, 3460716 multiplications and 0.112 seconds.
Probabilistic reachability took 0.113 seconds.
Probability of reaching BSCC 7: 7.130621070044187E-7
Computing probability of reaching BSCC 8
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4340, maybe=756
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 301 iterations, 1486338 multiplications and 0.042 seconds.
Probabilistic reachability took 0.044 seconds.
Probability of reaching BSCC 8: 1.6216636206689555E-6
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4092, maybe=1004
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 407 iterations, 2584450 multiplications and 0.078 seconds.
Probabilistic reachability took 0.078 seconds.
Probability of reaching BSCC 9: 0.04013574005405877
Computing probability of reaching BSCC 10
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=42, no=4704, maybe=422
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 266 iterations, 804916 multiplications and 0.018 seconds.
Probabilistic reachability took 0.019 seconds.
Probability of reaching BSCC 10: 3.7742683003667425E-7
Computing probability of reaching BSCC 11
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=36, no=3906, maybe=1226
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 442 iterations, 3452904 multiplications and 0.107 seconds.
Probabilistic reachability took 0.108 seconds.
Probability of reaching BSCC 11: 0.002053622263629259
Computing probability of reaching BSCC 12
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4608, maybe=488
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 300 iterations, 997800 multiplications and 0.025 seconds.
Probabilistic reachability took 0.025 seconds.
Probability of reaching BSCC 12: 0.004670285582760853
Computing probability of reaching BSCC 13
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4340, maybe=756
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 402 iterations, 1985076 multiplications and 0.056 seconds.
Probabilistic reachability took 0.057 seconds.
Probability of reaching BSCC 13: 4.12717338102108E-5
Computing probability of reaching BSCC 14
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=42, no=4556, maybe=570
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 247 iterations, 953420 multiplications and 0.025 seconds.
Probabilistic reachability took 0.026 seconds.
Probability of reaching BSCC 14: 9.109184404963984E-10
Computing probability of reaching BSCC 15
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=36, no=3906, maybe=1226
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 416 iterations, 3249792 multiplications and 0.1 seconds.
Probabilistic reachability took 0.1 seconds.
Probability of reaching BSCC 15: 3.018958092771475E-6
Computing probability of reaching BSCC 16
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4092, maybe=1004
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 263 iterations, 1670050 multiplications and 0.05 seconds.
Probabilistic reachability took 0.05 seconds.
Probability of reaching BSCC 16: 1.6980429394459737E-5
Computing probability of reaching BSCC 17
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=24, no=4484, maybe=660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 432 iterations, 1905120 multiplications and 0.052 seconds.
Probabilistic reachability took 0.052 seconds.
Probability of reaching BSCC 17: 6.523797930014772E-8
Computing probability of reaching BSCC 18
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=14, no=4700, maybe=454
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 288 iterations, 929664 multiplications and 0.022 seconds.
Probabilistic reachability took 0.023 seconds.
Probability of reaching BSCC 18: 7.763695093179346E-13
Computing probability of reaching BSCC 19
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=12, no=4182, maybe=974
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 457 iterations, 2961360 multiplications and 0.085 seconds.
Probabilistic reachability took 0.085 seconds.
Probability of reaching BSCC 19: 4.626775696952822E-9
Computing probability of reaching BSCC 20
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=24, no=4484, maybe=660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 313 iterations, 1380330 multiplications and 0.037 seconds.
Probabilistic reachability took 0.038 seconds.
Probability of reaching BSCC 20: 1.1388419594605848E-8
Computing probability of reaching BSCC 21
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=24, no=4484, maybe=660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 431 iterations, 1900710 multiplications and 0.051 seconds.
Probabilistic reachability took 0.051 seconds.
Probability of reaching BSCC 21: 1.8788584529597899E-4
Computing probability of reaching BSCC 22
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=14, no=4768, maybe=386
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 816802 multiplications and 0.018 seconds.
Probabilistic reachability took 0.018 seconds.
Probability of reaching BSCC 22: 2.2361173150800203E-9
Computing probability of reaching BSCC 23
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=12, no=4182, maybe=974
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 456 iterations, 2954880 multiplications and 0.085 seconds.
Probabilistic reachability took 0.086 seconds.
Probability of reaching BSCC 23: 1.332513874452195E-5
Computing probability of reaching BSCC 24
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=24, no=4656, maybe=488
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 312 iterations, 1037712 multiplications and 0.025 seconds.
Probabilistic reachability took 0.026 seconds.
Probability of reaching BSCC 24: 3.279801585002252E-5
Computing probability of reaching BSCC 25
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4608, maybe=488
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 401 iterations, 1333726 multiplications and 0.032 seconds.
Probabilistic reachability took 0.033 seconds.
Probability of reaching BSCC 25: 0.1188616657400471
Computing probability of reaching BSCC 26
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=42, no=4704, maybe=422
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 246 iterations, 744396 multiplications and 0.016 seconds.
Probabilistic reachability took 0.016 seconds.
Probability of reaching BSCC 26: 2.6237023309225325E-6
Computing probability of reaching BSCC 27
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=36, no=3906, maybe=1226
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 415 iterations, 3241980 multiplications and 0.099 seconds.
Probabilistic reachability took 0.099 seconds.
Probability of reaching BSCC 27: 0.008694708086251132
Computing probability of reaching BSCC 28
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=72, no=4092, maybe=1004
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 262 iterations, 1663700 multiplications and 0.049 seconds.
Probabilistic reachability took 0.05 seconds.
Probability of reaching BSCC 28: 0.04890426953914078
Computing probability of reaching BSCC 29
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=24, no=4656, maybe=488
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 431 iterations, 1433506 multiplications and 0.033 seconds.
Probabilistic reachability took 0.034 seconds.
Probability of reaching BSCC 29: 1.8788441804861429E-4
Computing probability of reaching BSCC 30
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=14, no=4768, maybe=386
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 287 iterations, 816802 multiplications and 0.018 seconds.
Probabilistic reachability took 0.019 seconds.
Probability of reaching BSCC 30: 2.2361613167474327E-9
Computing probability of reaching BSCC 31
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=12, no=4182, maybe=974
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 456 iterations, 2954880 multiplications and 0.084 seconds.
Probabilistic reachability took 0.085 seconds.
Probability of reaching BSCC 31: 1.332528842444611E-5
Computing probability of reaching BSCC 32
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=24, no=4484, maybe=660
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 312 iterations, 1375920 multiplications and 0.038 seconds.
Probabilistic reachability took 0.038 seconds.
Probability of reaching BSCC 32: 3.279919709358413E-5
Computing probability of reaching BSCC 33
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=24, no=4656, maybe=488
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 430 iterations, 1430180 multiplications and 0.034 seconds.
Probabilistic reachability took 0.035 seconds.
Probability of reaching BSCC 33: 0.5411084629523574
Computing probability of reaching BSCC 34
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=14, no=4808, maybe=346
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 286 iterations, 760760 multiplications and 0.014 seconds.
Probabilistic reachability took 0.014 seconds.
Probability of reaching BSCC 34: 6.4407436671510845E-6
Computing probability of reaching BSCC 35
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=12, no=4182, maybe=974
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 455 iterations, 2948400 multiplications and 0.083 seconds.
Probabilistic reachability took 0.084 seconds.
Probability of reaching BSCC 35: 0.038376901907019666
Computing probability of reaching BSCC 36
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.001 seconds.
target=1, yes=24, no=4656, maybe=488
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 311 iterations, 1034386 multiplications and 0.024 seconds.
Probabilistic reachability took 0.025 seconds.
Probability of reaching BSCC 36: 0.094459865862261
Computing steady-state probabilities for BSCC 1
Starting value iteration...
Power method: 1 iterations in 0.003 seconds.
Computing steady-state probabilities for BSCC 2
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 3
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 4
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 5
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 6
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 7
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 8
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 9
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 10
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 11
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 12
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 13
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 14
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 15
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 16
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 17
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 18
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 19
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 20
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 21
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 22
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 23
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 24
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 25
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 26
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 27
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 28
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 29
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 30
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 31
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 32
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 33
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 34
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 35
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Computing steady-state probabilities for BSCC 36
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Printing steady-state probabilities in plain text format below:
36:(1,0,0,0,0,5,false,false,false)=0.00915847148369742
37:(1,0,0,0,0,5,false,false,true)=1.9585281858731759E-7
38:(1,0,0,0,0,5,false,true,false)=4.717171023702061E-4
39:(1,0,0,0,0,5,false,true,true)=0.0026296964812020807
116:(1,0,0,1,0,5,false,false,false)=1.3935995583753663E-5
117:(1,0,0,1,0,5,false,false,true)=1.3103989757765094E-10
118:(1,0,0,1,0,5,false,true,false)=7.130621070044187E-7
119:(1,0,0,1,0,5,false,true,true)=1.6216636206689555E-6
196:(1,0,0,2,0,5,false,false,false)=0.04013574005405877
197:(1,0,0,2,0,5,false,false,true)=3.7742683003667425E-7
198:(1,0,0,2,0,5,false,true,false)=0.002053622263629259
199:(1,0,0,2,0,5,false,true,true)=0.004670285582760853
680:(1,1,0,0,0,5,false,false,false)=4.12717338102108E-5
681:(1,1,0,0,0,5,false,false,true)=9.109184404963984E-10
682:(1,1,0,0,0,5,false,true,false)=3.018958092771475E-6
683:(1,1,0,0,0,5,false,true,true)=1.6980429394459737E-5
760:(1,1,0,1,0,5,false,false,false)=6.523797930014772E-8
761:(1,1,0,1,0,5,false,false,true)=7.763695093179346E-13
762:(1,1,0,1,0,5,false,true,false)=4.626775696952822E-9
763:(1,1,0,1,0,5,false,true,true)=1.1388419594605848E-8
840:(1,1,0,2,0,5,false,false,false)=1.8788584529597899E-4
841:(1,1,0,2,0,5,false,false,true)=2.2361173150800203E-9
842:(1,1,0,2,0,5,false,true,false)=1.332513874452195E-5
843:(1,1,0,2,0,5,false,true,true)=3.279801585002252E-5
1324:(1,2,0,0,0,5,false,false,false)=0.1188616657400471
1325:(1,2,0,0,0,5,false,false,true)=2.6237023309225325E-6
1326:(1,2,0,0,0,5,false,true,false)=0.008694708086251132
1327:(1,2,0,0,0,5,false,true,true)=0.04890426953914078
1404:(1,2,0,1,0,5,false,false,false)=1.8788441804861429E-4
1405:(1,2,0,1,0,5,false,false,true)=2.2361613167474327E-9
1406:(1,2,0,1,0,5,false,true,false)=1.332528842444611E-5
1407:(1,2,0,1,0,5,false,true,true)=3.279919709358413E-5
1484:(1,2,0,2,0,5,false,false,false)=0.5411084629523574
1485:(1,2,0,2,0,5,false,false,true)=6.4407436671510845E-6
1486:(1,2,0,2,0,5,false,true,false)=0.038376901907019666
1487:(1,2,0,2,0,5,false,true,true)=0.094459865862261
Time for steady-state probability computation: 2.044 seconds.