prism.explicit-rel.default

Benchmark
Model: (nand)
Parameter(s)N = 40, K = 2
Invocation (explicit-rel.default)
	$ARTIFACT_DIR/bin/prism $ARTIFACT_DIR/benchmarks/dtmc/nand/nand.prism -const N=40,K=2 -steadystate  -explicit -relative  -epsilon 0.001
Explicit engine and relative error criterion
Execution
Walltime (MC-Time):440.4078149795532s (436.534s)
Return code:0
Note(s):Tool does not support file export.
Log
PRISM
=====

Version: 4.8.1
Date: Fri Sep 13 10:51:37 GMT+01:00 2024
Hostname: n23m0131.hpc.itc.rwth-aachen.de
Memory limits: cudd=1g, java(heap)=1g
Command line: prism /rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/dtmc/nand/nand.prism -const 'N=40,K=2' -steadystate -explicit -relative -epsilon 0.001

Parsing model file "/rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/dtmc/nand/nand.prism"...

Type:        DTMC
Modules:     multiplex
Variables:   u c s z zx zy x y

---------------------------------------------------------------------

Computing steady-state probabilities...

Building model...
Model constants: N=40,K=2

Computing reachable states... 2003082 states
Reachable states exploration and model construction done in 2.828 secs.
Sorting reachable states list...

Time for model construction: 3.393 seconds.

Type:        DTMC
States:      2003082 (1 initial)
Transitions: 3150462

Computing probability of reaching BSCC 1

Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain...  done (0.088 seconds)
Starting Prob0...
Prob0 took 0.332 seconds.
Starting Prob1...
Prob1 took 0.65 seconds.
target=1, yes=2, no=89534, maybe=1913546
Starting value iteration (with Jacobi)...
Iteration 269: 5.02 sec so far
Iteration 656: 10.02 sec so far
Value iteration (with Jacobi) took 801 iterations, 2412741762 multiplications and 11.494 seconds.
Probabilistic reachability took 12.583 seconds.

Probability of reaching BSCC 1: 3.7150885313677845E-5

Computing probability of reaching BSCC 2

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.236 seconds.
Starting Prob1...
Prob1 took 0.477 seconds.
target=1, yes=2, no=86143, maybe=1916937
Starting value iteration (with Jacobi)...
Iteration 267: 5.01 sec so far
Iteration 648: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2417015898 multiplications and 11.554 seconds.
Probabilistic reachability took 12.271 seconds.

Probability of reaching BSCC 2: 6.697368705978776E-5

Computing probability of reaching BSCC 3

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.23 seconds.
Starting Prob1...
Prob1 took 0.469 seconds.
target=1, yes=2, no=85010, maybe=1918070
Starting value iteration (with Jacobi)...
Iteration 264: 5.00 sec so far
Iteration 646: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2418443280 multiplications and 11.573 seconds.
Probabilistic reachability took 12.276 seconds.

Probability of reaching BSCC 3: 1.1920327019436172E-4

Computing probability of reaching BSCC 4

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.228 seconds.
Starting Prob1...
Prob1 took 0.452 seconds.
target=1, yes=2, no=86143, maybe=1916937
Starting value iteration (with Jacobi)...
Iteration 267: 5.01 sec so far
Iteration 651: 10.02 sec so far
Value iteration (with Jacobi) took 801 iterations, 2417015898 multiplications and 11.523 seconds.
Probabilistic reachability took 12.206 seconds.

Probability of reaching BSCC 4: 2.0851490977841523E-4

Computing probability of reaching BSCC 5

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.228 seconds.
Starting Prob1...
Prob1 took 0.453 seconds.
target=1, yes=2, no=89534, maybe=1913546
Starting value iteration (with Jacobi)...
Iteration 265: 5.00 sec so far
Iteration 646: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2412741762 multiplications and 11.57 seconds.
Probabilistic reachability took 12.256 seconds.

Probability of reaching BSCC 5: 3.6201266797019206E-4

Computing probability of reaching BSCC 6

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.224 seconds.
Starting Prob1...
Prob1 took 0.448 seconds.
target=1, yes=2, no=95165, maybe=1907915
Starting value iteration (with Jacobi)...
Iteration 267: 5.01 sec so far
Iteration 651: 10.02 sec so far
Value iteration (with Jacobi) took 801 iterations, 2405641698 multiplications and 11.52 seconds.
Probabilistic reachability took 12.196 seconds.

Probability of reaching BSCC 6: 6.152903186495913E-4

Computing probability of reaching BSCC 7

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.224 seconds.
Starting Prob1...
Prob1 took 0.445 seconds.
target=1, yes=2, no=103008, maybe=1900072
Starting value iteration (with Jacobi)...
Iteration 267: 5.00 sec so far
Iteration 661: 10.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2395749348 multiplications and 11.257 seconds.
Probabilistic reachability took 11.929 seconds.

Probability of reaching BSCC 7: 0.001046990481959937

Computing probability of reaching BSCC 8

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.221 seconds.
Starting Prob1...
Prob1 took 0.445 seconds.
target=1, yes=2, no=95165, maybe=1907915
Starting value iteration (with Jacobi)...
Iteration 299: 5.00 sec so far
Iteration 762: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2405641698 multiplications and 10.378 seconds.
Probabilistic reachability took 11.048 seconds.

Probability of reaching BSCC 8: 2.0256775819065705E-5

Computing probability of reaching BSCC 9

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.219 seconds.
Starting Prob1...
Prob1 took 0.443 seconds.
target=1, yes=2, no=113025, maybe=1890055
Starting value iteration (with Jacobi)...
Iteration 303: 5.01 sec so far
Iteration 771: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2383111170 multiplications and 10.296 seconds.
Probabilistic reachability took 10.963 seconds.

Probability of reaching BSCC 9: 0.0017266405356541903

Computing probability of reaching BSCC 10

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.218 seconds.
Starting Prob1...
Prob1 took 0.443 seconds.
target=1, yes=2, no=103008, maybe=1900072
Starting value iteration (with Jacobi)...
Iteration 301: 5.00 sec so far
Iteration 767: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2395749348 multiplications and 10.332 seconds.
Probabilistic reachability took 10.997 seconds.

Probability of reaching BSCC 10: 1.0862201866163376E-5

Computing probability of reaching BSCC 11

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.218 seconds.
Starting Prob1...
Prob1 took 0.443 seconds.
target=1, yes=2, no=113025, maybe=1890055
Starting value iteration (with Jacobi)...
Iteration 305: 5.01 sec so far
Iteration 776: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2383111170 multiplications and 10.257 seconds.
Probabilistic reachability took 10.92 seconds.

Probability of reaching BSCC 11: 5.713155917363439E-6

Computing probability of reaching BSCC 12

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.225 seconds.
Starting Prob1...
Prob1 took 0.445 seconds.
target=1, yes=2, no=125168, maybe=1877912
Starting value iteration (with Jacobi)...
Iteration 307: 5.00 sec so far
Iteration 784: 10.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2367786438 multiplications and 10.176 seconds.
Probabilistic reachability took 10.85 seconds.

Probability of reaching BSCC 12: 0.002892936663239891

Computing probability of reaching BSCC 13

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.218 seconds.
Starting Prob1...
Prob1 took 0.439 seconds.
target=1, yes=2, no=125168, maybe=1877912
Starting value iteration (with Jacobi)...
Iteration 306: 5.00 sec so far
Iteration 781: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2367786438 multiplications and 10.207 seconds.
Probabilistic reachability took 10.867 seconds.

Probability of reaching BSCC 13: 2.943402142652264E-6

Computing probability of reaching BSCC 14

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.214 seconds.
Starting Prob1...
Prob1 took 0.44 seconds.
target=1, yes=2, no=139379, maybe=1863701
Starting value iteration (with Jacobi)...
Iteration 310: 5.01 sec so far
Iteration 793: 10.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2349847242 multiplications and 10.107 seconds.
Probabilistic reachability took 10.763 seconds.

Probability of reaching BSCC 14: 1.4816511254906034E-6

Computing probability of reaching BSCC 15

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.215 seconds.
Starting Prob1...
Prob1 took 0.442 seconds.
target=1, yes=2, no=139379, maybe=1863701
Starting value iteration (with Jacobi)...
Iteration 310: 5.01 sec so far
Iteration 794: 10.02 sec so far
Value iteration (with Jacobi) took 801 iterations, 2349847242 multiplications and 10.103 seconds.
Probabilistic reachability took 10.763 seconds.

Probability of reaching BSCC 15: 0.004607056092698934

Computing probability of reaching BSCC 16

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.212 seconds.
Starting Prob1...
Prob1 took 0.434 seconds.
target=1, yes=2, no=155590, maybe=1847490
Starting value iteration (with Jacobi)...
Iteration 312: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2329378488 multiplications and 10.045 seconds.
Probabilistic reachability took 10.693 seconds.

Probability of reaching BSCC 16: 0.007628411310834574

Computing probability of reaching BSCC 17

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.214 seconds.
Starting Prob1...
Prob1 took 0.439 seconds.
target=1, yes=2, no=155590, maybe=1847490
Starting value iteration (with Jacobi)...
Iteration 312: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2329378488 multiplications and 10.044 seconds.
Probabilistic reachability took 10.699 seconds.

Probability of reaching BSCC 17: 7.268642192192673E-7

Computing probability of reaching BSCC 18

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.212 seconds.
Starting Prob1...
Prob1 took 0.438 seconds.
target=1, yes=2, no=173723, maybe=1829357
Starting value iteration (with Jacobi)...
Iteration 314: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2306477898 multiplications and 9.988 seconds.
Probabilistic reachability took 10.641 seconds.

Probability of reaching BSCC 18: 0.011622138589092999

Computing probability of reaching BSCC 19

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.211 seconds.
Starting Prob1...
Prob1 took 0.434 seconds.
target=1, yes=2, no=193690, maybe=1809390
Starting value iteration (with Jacobi)...
Iteration 315: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2281256010 multiplications and 9.915 seconds.
Probabilistic reachability took 10.563 seconds.

Probability of reaching BSCC 19: 0.01902877966647355

Computing probability of reaching BSCC 20

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.212 seconds.
Starting Prob1...
Prob1 took 0.428 seconds.
target=1, yes=2, no=173723, maybe=1829357
Starting value iteration (with Jacobi)...
Iteration 314: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2306477898 multiplications and 9.974 seconds.
Probabilistic reachability took 10.616 seconds.

Probability of reaching BSCC 20: 3.463697043591112E-7

Computing probability of reaching BSCC 21

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.208 seconds.
Starting Prob1...
Prob1 took 0.434 seconds.
target=1, yes=2, no=193690, maybe=1809390
Starting value iteration (with Jacobi)...
Iteration 317: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2281256010 multiplications and 9.89 seconds.
Probabilistic reachability took 10.536 seconds.

Probability of reaching BSCC 21: 1.596986117092519E-7

Computing probability of reaching BSCC 22

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.217 seconds.
Starting Prob1...
Prob1 took 0.433 seconds.
target=1, yes=2, no=215393, maybe=1787687
Starting value iteration (with Jacobi)...
Iteration 320: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2253836178 multiplications and 9.8 seconds.
Probabilistic reachability took 10.452 seconds.

Probability of reaching BSCC 22: 7.089383023872702E-8

Computing probability of reaching BSCC 23

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.208 seconds.
Starting Prob1...
Prob1 took 0.439 seconds.
target=1, yes=2, no=215393, maybe=1787687
Starting value iteration (with Jacobi)...
Iteration 320: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2253836178 multiplications and 9.801 seconds.
Probabilistic reachability took 10.451 seconds.

Probability of reaching BSCC 23: 0.02727941094077148

Computing probability of reaching BSCC 24

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.2 seconds.
Starting Prob1...
Prob1 took 0.423 seconds.
target=1, yes=2, no=238724, maybe=1764356
Starting value iteration (with Jacobi)...
Iteration 322: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2224354572 multiplications and 9.746 seconds.
Probabilistic reachability took 10.372 seconds.

Probability of reaching BSCC 24: 3.0115199973551925E-8

Computing probability of reaching BSCC 25

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.199 seconds.
Starting Prob1...
Prob1 took 0.428 seconds.
target=1, yes=2, no=263565, maybe=1739515
Starting value iteration (with Jacobi)...
Iteration 327: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2192960178 multiplications and 9.609 seconds.
Probabilistic reachability took 10.239 seconds.

Probability of reaching BSCC 25: 1.214452387651369E-8

Computing probability of reaching BSCC 26

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.197 seconds.
Starting Prob1...
Prob1 took 0.423 seconds.
target=1, yes=2, no=289788, maybe=1713292
Starting value iteration (with Jacobi)...
Iteration 331: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2159814798 multiplications and 9.501 seconds.
Probabilistic reachability took 10.123 seconds.

Probability of reaching BSCC 26: 4.600642837917171E-9

Computing probability of reaching BSCC 27

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.204 seconds.
Starting Prob1...
Prob1 took 0.429 seconds.
target=1, yes=2, no=238724, maybe=1764356
Starting value iteration (with Jacobi)...
Iteration 323: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2224354572 multiplications and 9.707 seconds.
Probabilistic reachability took 10.343 seconds.

Probability of reaching BSCC 27: 0.04388472333290273

Computing probability of reaching BSCC 28

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.206 seconds.
Starting Prob1...
Prob1 took 0.423 seconds.
target=1, yes=2, no=263565, maybe=1739515
Starting value iteration (with Jacobi)...
Iteration 327: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2192960178 multiplications and 9.608 seconds.
Probabilistic reachability took 10.239 seconds.

Probability of reaching BSCC 28: 0.05746994420194202

Computing probability of reaching BSCC 29

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.197 seconds.
Starting Prob1...
Prob1 took 0.424 seconds.
target=1, yes=2, no=289788, maybe=1713292
Starting value iteration (with Jacobi)...
Iteration 331: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2159814798 multiplications and 9.503 seconds.
Probabilistic reachability took 10.127 seconds.

Probability of reaching BSCC 29: 0.0892745421262142

Computing probability of reaching BSCC 30

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.194 seconds.
Starting Prob1...
Prob1 took 0.42 seconds.
target=1, yes=2, no=317255, maybe=1685825
Starting value iteration (with Jacobi)...
Iteration 334: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2125093050 multiplications and 9.435 seconds.
Probabilistic reachability took 10.052 seconds.

Probability of reaching BSCC 30: 0.1011353719313308

Computing probability of reaching BSCC 31

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.19 seconds.
Starting Prob1...
Prob1 took 0.416 seconds.
target=1, yes=2, no=345818, maybe=1657262
Starting value iteration (with Jacobi)...
Iteration 339: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2088982368 multiplications and 9.27 seconds.
Probabilistic reachability took 9.88 seconds.

Probability of reaching BSCC 31: 0.14714581835227483

Computing probability of reaching BSCC 32

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.198 seconds.
Starting Prob1...
Prob1 took 0.417 seconds.
target=1, yes=2, no=317255, maybe=1685825
Starting value iteration (with Jacobi)...
Iteration 335: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2125093050 multiplications and 9.391 seconds.
Probabilistic reachability took 10.009 seconds.

Probability of reaching BSCC 32: 1.61369742500334E-9

Computing probability of reaching BSCC 33

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.189 seconds.
Starting Prob1...
Prob1 took 0.42 seconds.
target=1, yes=2, no=345818, maybe=1657262
Starting value iteration (with Jacobi)...
Iteration 339: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2088982368 multiplications and 9.27 seconds.
Probabilistic reachability took 9.881 seconds.

Probability of reaching BSCC 33: 5.133023101104892E-10

Computing probability of reaching BSCC 34

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.183 seconds.
Starting Prob1...
Prob1 took 0.415 seconds.
target=1, yes=2, no=375319, maybe=1627761
Starting value iteration (with Jacobi)...
Iteration 344: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 2051683002 multiplications and 9.152 seconds.
Probabilistic reachability took 9.752 seconds.

Probability of reaching BSCC 34: 1.4344433299258377E-10

Computing probability of reaching BSCC 35

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.189 seconds.
Starting Prob1...
Prob1 took 0.399 seconds.
target=1, yes=2, no=405590, maybe=1597490
Starting value iteration (with Jacobi)...
Iteration 347: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2013408018 multiplications and 9.055 seconds.
Probabilistic reachability took 9.647 seconds.

Probability of reaching BSCC 35: 3.3393826669635294E-11

Computing probability of reaching BSCC 36

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.179 seconds.
Starting Prob1...
Prob1 took 0.404 seconds.
target=1, yes=2, no=436453, maybe=1566627
Starting value iteration (with Jacobi)...
Iteration 354: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 1974383298 multiplications and 8.951 seconds.
Probabilistic reachability took 9.537 seconds.

Probability of reaching BSCC 36: 5.841807520260941E-12

Computing probability of reaching BSCC 37

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.187 seconds.
Starting Prob1...
Prob1 took 0.445 seconds.
target=1, yes=2, no=467720, maybe=1535360
Starting value iteration (with Jacobi)...
Iteration 357: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 1934847540 multiplications and 8.824 seconds.
Probabilistic reachability took 9.458 seconds.

Probability of reaching BSCC 37: 5.873503246947501E-13

Computing probability of reaching BSCC 38

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.195 seconds.
Starting Prob1...
Prob1 took 0.413 seconds.
target=1, yes=2, no=375319, maybe=1627761
Starting value iteration (with Jacobi)...
Iteration 342: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2051683002 multiplications and 9.189 seconds.
Probabilistic reachability took 9.8 seconds.

Probability of reaching BSCC 38: 0.1295145484426849

Computing probability of reaching BSCC 39

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.18 seconds.
Starting Prob1...
Prob1 took 0.407 seconds.
target=1, yes=2, no=405590, maybe=1597490
Starting value iteration (with Jacobi)...
Iteration 348: 5.01 sec so far
Value iteration (with Jacobi) took 801 iterations, 2013408018 multiplications and 9.045 seconds.
Probabilistic reachability took 9.634 seconds.

Probability of reaching BSCC 39: 0.16899474793928407

Computing probability of reaching BSCC 40

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.176 seconds.
Starting Prob1...
Prob1 took 0.4 seconds.
target=1, yes=2, no=436453, maybe=1566627
Starting value iteration (with Jacobi)...
Iteration 354: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 1974383298 multiplications and 8.908 seconds.
Probabilistic reachability took 9.485 seconds.

Probability of reaching BSCC 40: 0.08803300869672924

Computing probability of reaching BSCC 41

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.172 seconds.
Starting Prob1...
Prob1 took 0.427 seconds.
target=1, yes=2, no=467720, maybe=1535360
Starting value iteration (with Jacobi)...
Iteration 359: 5.00 sec so far
Value iteration (with Jacobi) took 801 iterations, 1934847540 multiplications and 8.782 seconds.
Probabilistic reachability took 9.384 seconds.

Probability of reaching BSCC 41: 0.09726317477307218

Computing steady-state probabilities for BSCC 1
Starting value iteration...
Power method: 1 iterations in 0.008 seconds.

Computing steady-state probabilities for BSCC 2
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 3
Starting value iteration...
Power method: 1 iterations in 0.006 seconds.

Computing steady-state probabilities for BSCC 4
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 5
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 6
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 7
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 8
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 9
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 10
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 11
Starting value iteration...
Power method: 1 iterations in 0.006 seconds.

Computing steady-state probabilities for BSCC 12
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 13
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 14
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 15
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 16
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 17
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 18
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 19
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 20
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 21
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 22
Starting value iteration...
Power method: 1 iterations in 0.006 seconds.

Computing steady-state probabilities for BSCC 23
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 24
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 25
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 26
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 27
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 28
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 29
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 30
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 31
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 32
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 33
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 34
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 35
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 36
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 37
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 38
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 39
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 40
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Computing steady-state probabilities for BSCC 41
Starting value iteration...
Power method: 1 iterations in 0.005 seconds.

Printing steady-state probabilities in plain text format below:
2003041:(5,40,4,0,0,0,0,0)=0.09726317477307218
2003042:(5,40,4,1,0,0,0,0)=0.08803300869672924
2003043:(5,40,4,2,0,0,0,0)=0.16899474793928407
2003044:(5,40,4,3,0,0,0,0)=0.1295145484426849
2003045:(5,40,4,4,0,0,0,0)=0.14714581835227483
2003046:(5,40,4,5,0,0,0,0)=0.1011353719313308
2003047:(5,40,4,6,0,0,0,0)=0.0892745421262142
2003048:(5,40,4,7,0,0,0,0)=0.05746994420194202
2003049:(5,40,4,8,0,0,0,0)=0.04388472333290273
2003050:(5,40,4,9,0,0,0,0)=0.02727941094077148
2003051:(5,40,4,10,0,0,0,0)=0.01902877966647355
2003052:(5,40,4,11,0,0,0,0)=0.011622138589092999
2003053:(5,40,4,12,0,0,0,0)=0.007628411310834574
2003054:(5,40,4,13,0,0,0,0)=0.004607056092698934
2003055:(5,40,4,14,0,0,0,0)=0.002892936663239891
2003056:(5,40,4,15,0,0,0,0)=0.0017266405356541903
2003057:(5,40,4,16,0,0,0,0)=0.001046990481959937
2003058:(5,40,4,17,0,0,0,0)=6.152903186495913E-4
2003059:(5,40,4,18,0,0,0,0)=3.6201266797019206E-4
2003060:(5,40,4,19,0,0,0,0)=2.0851490977841523E-4
2003061:(5,40,4,20,0,0,0,0)=1.1920327019436172E-4
2003062:(5,40,4,21,0,0,0,0)=6.697368705978776E-5
2003063:(5,40,4,22,0,0,0,0)=3.7150885313677845E-5
2003064:(5,40,4,23,0,0,0,0)=2.0256775819065705E-5
2003065:(5,40,4,24,0,0,0,0)=1.0862201866163376E-5
2003066:(5,40,4,25,0,0,0,0)=5.713155917363439E-6
2003067:(5,40,4,26,0,0,0,0)=2.943402142652264E-6
2003068:(5,40,4,27,0,0,0,0)=1.4816511254906034E-6
2003069:(5,40,4,28,0,0,0,0)=7.268642192192673E-7
2003070:(5,40,4,29,0,0,0,0)=3.463697043591112E-7
2003071:(5,40,4,30,0,0,0,0)=1.596986117092519E-7
2003072:(5,40,4,31,0,0,0,0)=7.089383023872702E-8
2003073:(5,40,4,32,0,0,0,0)=3.0115199973551925E-8
2003074:(5,40,4,33,0,0,0,0)=1.214452387651369E-8
2003075:(5,40,4,34,0,0,0,0)=4.600642837917171E-9
2003076:(5,40,4,35,0,0,0,0)=1.61369742500334E-9
2003077:(5,40,4,36,0,0,0,0)=5.133023101104892E-10
2003078:(5,40,4,37,0,0,0,0)=1.4344433299258377E-10
2003079:(5,40,4,38,0,0,0,0)=3.3393826669635294E-11
2003080:(5,40,4,39,0,0,0,0)=5.841807520260941E-12
2003081:(5,40,4,40,0,0,0,0)=5.873503246947501E-13

Time for steady-state probability computation: 436.534 seconds.	
STDERR
Picked up JAVA_TOOL_OPTIONS: -Xmx16g