PRISM
=====
Version: 4.8.1
Date: Fri Sep 13 10:51:37 GMT+01:00 2024
Hostname: n23m0113.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=20,K=3' -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=20,K=3
Computing reachable states... 231552 states
Reachable states exploration and model construction done in 0.393 secs.
Sorting reachable states list...
Time for model construction: 0.496 seconds.
Type: DTMC
States: 231552 (1 initial)
Transitions: 358152
Computing probability of reaching BSCC 1
Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain... done (0.048 seconds)
Starting Prob0...
Prob0 took 0.03 seconds.
Starting Prob1...
Prob1 took 0.046 seconds.
target=1, yes=2, no=9400, maybe=222150
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 192977268 multiplications and 0.955 seconds.
Probabilistic reachability took 1.1 seconds.
Probability of reaching BSCC 1: 0.013959516943723015
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.014 seconds.
Starting Prob1...
Prob1 took 0.026 seconds.
target=1, yes=2, no=11538, maybe=220012
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 191114748 multiplications and 0.93 seconds.
Probabilistic reachability took 0.972 seconds.
Probability of reaching BSCC 2: 0.02907017201307962
Computing probability of reaching BSCC 3
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.026 seconds.
Starting Prob1...
Prob1 took 0.041 seconds.
target=1, yes=2, no=7844, maybe=223706
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 194331522 multiplications and 0.941 seconds.
Probabilistic reachability took 1.009 seconds.
Probability of reaching BSCC 3: 0.00943586877900272
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.022 seconds.
Starting Prob1...
Prob1 took 0.034 seconds.
target=1, yes=2, no=6898, maybe=224652
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 195153948 multiplications and 0.945 seconds.
Probabilistic reachability took 1.001 seconds.
Probability of reaching BSCC 4: 0.005211034579206788
Computing probability of reaching BSCC 5
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.024 seconds.
target=1, yes=2, no=6580, maybe=224970
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 195429960 multiplications and 0.944 seconds.
Probabilistic reachability took 0.981 seconds.
Probability of reaching BSCC 5: 0.0033932779307718906
Computing probability of reaching BSCC 6
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.014 seconds.
Starting Prob1...
Prob1 took 0.026 seconds.
target=1, yes=2, no=6898, maybe=224652
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 195153948 multiplications and 0.943 seconds.
Probabilistic reachability took 0.983 seconds.
Probability of reaching BSCC 6: 0.0020553979710588007
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.014 seconds.
Starting Prob1...
Prob1 took 0.026 seconds.
target=1, yes=2, no=14220, maybe=217330
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 188776500 multiplications and 0.922 seconds.
Probabilistic reachability took 0.962 seconds.
Probability of reaching BSCC 7: 0.039468141505192934
Computing probability of reaching BSCC 8
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.014 seconds.
Starting Prob1...
Prob1 took 0.025 seconds.
target=1, yes=2, no=17398, maybe=214152
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 186004038 multiplications and 0.912 seconds.
Probabilistic reachability took 0.952 seconds.
Probability of reaching BSCC 8: 0.09154099521458492
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.014 seconds.
Starting Prob1...
Prob1 took 0.025 seconds.
target=1, yes=2, no=7844, maybe=223706
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 194331522 multiplications and 0.94 seconds.
Probabilistic reachability took 0.98 seconds.
Probability of reaching BSCC 9: 0.0013130167851484352
Computing probability of reaching BSCC 10
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.014 seconds.
Starting Prob1...
Prob1 took 0.026 seconds.
target=1, yes=2, no=9400, maybe=222150
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 192977268 multiplications and 0.918 seconds.
Probabilistic reachability took 0.958 seconds.
Probability of reaching BSCC 10: 8.196957772019531E-4
Computing probability of reaching BSCC 11
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.026 seconds.
target=1, yes=2, no=21014, maybe=210536
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 182847852 multiplications and 0.848 seconds.
Probabilistic reachability took 0.887 seconds.
Probability of reaching BSCC 11: 0.1001482969021875
Computing probability of reaching BSCC 12
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.024 seconds.
target=1, yes=2, no=11538, maybe=220012
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 191114748 multiplications and 0.874 seconds.
Probabilistic reachability took 0.912 seconds.
Probability of reaching BSCC 12: 5.129329151810175E-4
Computing probability of reaching BSCC 13
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.025 seconds.
target=1, yes=2, no=14220, maybe=217330
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 188776500 multiplications and 0.866 seconds.
Probabilistic reachability took 0.904 seconds.
Probability of reaching BSCC 13: 3.1460761768904906E-4
Computing probability of reaching BSCC 14
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.013 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=17398, maybe=214152
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 186004038 multiplications and 0.857 seconds.
Probabilistic reachability took 0.893 seconds.
Probability of reaching BSCC 14: 1.8807142158101562E-4
Computing probability of reaching BSCC 15
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.024 seconds.
target=1, yes=2, no=25000, maybe=206550
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 179367408 multiplications and 0.836 seconds.
Probabilistic reachability took 0.872 seconds.
Probability of reaching BSCC 15: 0.23382400852728458
Computing probability of reaching BSCC 16
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=21014, maybe=210536
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 182847852 multiplications and 0.848 seconds.
Probabilistic reachability took 0.883 seconds.
Probability of reaching BSCC 16: 1.0764112700361212E-4
Computing probability of reaching BSCC 17
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.023 seconds.
target=1, yes=2, no=25000, maybe=206550
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 179367408 multiplications and 0.837 seconds.
Probabilistic reachability took 0.872 seconds.
Probability of reaching BSCC 17: 5.741059534863352E-5
Computing probability of reaching BSCC 18
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.022 seconds.
target=1, yes=2, no=29278, maybe=202272
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 175631148 multiplications and 0.825 seconds.
Probabilistic reachability took 0.859 seconds.
Probability of reaching BSCC 18: 2.6883235109574475E-5
Computing probability of reaching BSCC 19
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.01 seconds.
Starting Prob1...
Prob1 took 0.022 seconds.
target=1, yes=2, no=33760, maybe=197790
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 171716490 multiplications and 0.811 seconds.
Probabilistic reachability took 0.844 seconds.
Probability of reaching BSCC 19: 9.066329775620873E-6
Computing probability of reaching BSCC 20
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.012 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=29278, maybe=202272
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 175631148 multiplications and 0.825 seconds.
Probabilistic reachability took 0.858 seconds.
Probability of reaching BSCC 20: 0.14909576838553668
Computing probability of reaching BSCC 21
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.011 seconds.
Starting Prob1...
Prob1 took 0.021 seconds.
target=1, yes=2, no=33760, maybe=197790
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 561 iterations, 171716490 multiplications and 0.812 seconds.
Probabilistic reachability took 0.844 seconds.
Probability of reaching BSCC 21: 0.3194481954443292
Computing steady-state probabilities for BSCC 1
Starting value iteration...
Power method: 1 iterations in 0.004 seconds.
Computing steady-state probabilities for BSCC 2
Starting value iteration...
Power method: 1 iterations in 0.001 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.001 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.001 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.001 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.001 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.001 seconds.
Computing steady-state probabilities for BSCC 16
Starting value iteration...
Power method: 1 iterations in 0.002 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.001 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.001 seconds.
Computing steady-state probabilities for BSCC 21
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.
Printing steady-state probabilities in plain text format below:
231531:(7,20,4,0,0,0,0,0)=0.3194481954443292
231532:(7,20,4,1,0,0,0,0)=0.14909576838553668
231533:(7,20,4,2,0,0,0,0)=0.23382400852728458
231534:(7,20,4,3,0,0,0,0)=0.1001482969021875
231535:(7,20,4,4,0,0,0,0)=0.09154099521458492
231536:(7,20,4,5,0,0,0,0)=0.039468141505192934
231537:(7,20,4,6,0,0,0,0)=0.02907017201307962
231538:(7,20,4,7,0,0,0,0)=0.013959516943723015
231539:(7,20,4,8,0,0,0,0)=0.00943586877900272
231540:(7,20,4,9,0,0,0,0)=0.005211034579206788
231541:(7,20,4,10,0,0,0,0)=0.0033932779307718906
231542:(7,20,4,11,0,0,0,0)=0.0020553979710588007
231543:(7,20,4,12,0,0,0,0)=0.0013130167851484352
231544:(7,20,4,13,0,0,0,0)=8.196957772019531E-4
231545:(7,20,4,14,0,0,0,0)=5.129329151810175E-4
231546:(7,20,4,15,0,0,0,0)=3.1460761768904906E-4
231547:(7,20,4,16,0,0,0,0)=1.8807142158101562E-4
231548:(7,20,4,17,0,0,0,0)=1.0764112700361212E-4
231549:(7,20,4,18,0,0,0,0)=5.741059534863352E-5
231550:(7,20,4,19,0,0,0,0)=2.6883235109574475E-5
231551:(7,20,4,20,0,0,0,0)=9.066329775620873E-6
Time for steady-state probability computation: 19.659 seconds.