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=20,K=4' -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=4
Computing reachable states... 308162 states
Reachable states exploration and model construction done in 0.513 secs.
Sorting reachable states list...
Time for model construction: 0.634 seconds.
Type: DTMC
States: 308162 (1 initial)
Transitions: 476472
Computing probability of reaching BSCC 1
Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain... done (0.065 seconds)
Starting Prob0...
Prob0 took 0.043 seconds.
Starting Prob1...
Prob1 took 0.065 seconds.
target=1, yes=2, no=7844, maybe=300316
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 335064562 multiplications and 1.694 seconds.
Probabilistic reachability took 1.879 seconds.
Probability of reaching BSCC 1: 0.0012230282440736098
Computing probability of reaching BSCC 2
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.034 seconds.
Starting Prob1...
Prob1 took 0.058 seconds.
target=1, yes=2, no=9400, maybe=298760
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 333324068 multiplications and 1.666 seconds.
Probabilistic reachability took 1.759 seconds.
Probability of reaching BSCC 2: 8.517925788901577E-4
Computing probability of reaching BSCC 3
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.028 seconds.
Starting Prob1...
Prob1 took 0.047 seconds.
target=1, yes=2, no=6898, maybe=301262
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 336121548 multiplications and 1.675 seconds.
Probabilistic reachability took 1.75 seconds.
Probability of reaching BSCC 3: 0.0017600659186861722
Computing probability of reaching BSCC 4
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.019 seconds.
Starting Prob1...
Prob1 took 0.036 seconds.
target=1, yes=2, no=6580, maybe=301580
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 336476280 multiplications and 1.675 seconds.
Probabilistic reachability took 1.73 seconds.
Probability of reaching BSCC 4: 0.0027234685384657934
Computing probability of reaching BSCC 5
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.037 seconds.
target=1, yes=2, no=11538, maybe=296622
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 330930348 multiplications and 1.658 seconds.
Probabilistic reachability took 1.713 seconds.
Probability of reaching BSCC 5: 6.05758780255552E-4
Computing probability of reaching BSCC 6
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.019 seconds.
Starting Prob1...
Prob1 took 0.036 seconds.
target=1, yes=2, no=14220, maybe=293940
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 327925220 multiplications and 1.644 seconds.
Probabilistic reachability took 1.701 seconds.
Probability of reaching BSCC 6: 4.3202161816751375E-4
Computing probability of reaching BSCC 7
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.037 seconds.
target=1, yes=2, no=17398, maybe=290762
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 324362038 multiplications and 1.635 seconds.
Probabilistic reachability took 1.691 seconds.
Probability of reaching BSCC 7: 3.0779485018656613E-4
Computing probability of reaching BSCC 8
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.035 seconds.
target=1, yes=2, no=6898, maybe=301262
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 336121548 multiplications and 1.563 seconds.
Probabilistic reachability took 1.616 seconds.
Probability of reaching BSCC 8: 0.004050529493116302
Computing probability of reaching BSCC 9
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.019 seconds.
Starting Prob1...
Prob1 took 0.037 seconds.
target=1, yes=2, no=7844, maybe=300316
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 335064562 multiplications and 1.453 seconds.
Probabilistic reachability took 1.509 seconds.
Probability of reaching BSCC 9: 0.007285386416168311
Computing probability of reaching BSCC 10
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.037 seconds.
target=1, yes=2, no=21014, maybe=287146
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 320305692 multiplications and 1.414 seconds.
Probabilistic reachability took 1.469 seconds.
Probability of reaching BSCC 10: 2.1687040143114297E-4
Computing probability of reaching BSCC 11
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.034 seconds.
target=1, yes=2, no=25000, maybe=283160
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 315832608 multiplications and 1.399 seconds.
Probabilistic reachability took 1.45 seconds.
Probability of reaching BSCC 11: 1.4908973181205606E-4
Computing probability of reaching BSCC 12
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.035 seconds.
target=1, yes=2, no=29278, maybe=278882
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 311030748 multiplications and 1.385 seconds.
Probabilistic reachability took 1.436 seconds.
Probability of reaching BSCC 12: 9.641599526136967E-5
Computing probability of reaching BSCC 13
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.035 seconds.
target=1, yes=2, no=9400, maybe=298760
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 333324068 multiplications and 1.448 seconds.
Probabilistic reachability took 1.501 seconds.
Probability of reaching BSCC 13: 0.01105729458671653
Computing probability of reaching BSCC 14
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.033 seconds.
target=1, yes=2, no=33760, maybe=274400
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 305999610 multiplications and 1.378 seconds.
Probabilistic reachability took 1.427 seconds.
Probability of reaching BSCC 14: 4.866368170119375E-5
Computing probability of reaching BSCC 15
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.019 seconds.
Starting Prob1...
Prob1 took 0.036 seconds.
target=1, yes=2, no=11538, maybe=296622
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 330930348 multiplications and 1.444 seconds.
Probabilistic reachability took 1.499 seconds.
Probability of reaching BSCC 15: 0.024011890938633984
Computing probability of reaching BSCC 16
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.039 seconds.
target=1, yes=2, no=14220, maybe=293940
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 327925220 multiplications and 1.439 seconds.
Probabilistic reachability took 1.496 seconds.
Probability of reaching BSCC 16: 0.034685769649156636
Computing probability of reaching BSCC 17
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.019 seconds.
Starting Prob1...
Prob1 took 0.036 seconds.
target=1, yes=2, no=17398, maybe=290762
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 324362038 multiplications and 1.428 seconds.
Probabilistic reachability took 1.483 seconds.
Probability of reaching BSCC 17: 0.08415793892880186
Computing probability of reaching BSCC 18
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.018 seconds.
Starting Prob1...
Prob1 took 0.035 seconds.
target=1, yes=2, no=21014, maybe=287146
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 320305692 multiplications and 1.431 seconds.
Probabilistic reachability took 1.484 seconds.
Probability of reaching BSCC 18: 0.09795774160518395
Computing probability of reaching BSCC 19
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.017 seconds.
Starting Prob1...
Prob1 took 0.035 seconds.
target=1, yes=2, no=25000, maybe=283160
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 315832608 multiplications and 1.406 seconds.
Probabilistic reachability took 1.459 seconds.
Probability of reaching BSCC 19: 0.2342204182455152
Computing probability of reaching BSCC 20
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.032 seconds.
target=1, yes=2, no=29278, maybe=278882
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 311030748 multiplications and 1.392 seconds.
Probabilistic reachability took 1.441 seconds.
Probability of reaching BSCC 20: 0.15645982407462644
Computing probability of reaching BSCC 21
Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.016 seconds.
Starting Prob1...
Prob1 took 0.035 seconds.
target=1, yes=2, no=33760, maybe=274400
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 721 iterations, 305999610 multiplications and 1.386 seconds.
Probabilistic reachability took 1.438 seconds.
Probability of reaching BSCC 21: 0.3376982357231465
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.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.001 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.001 seconds.
Computing steady-state probabilities for BSCC 9
Starting value iteration...
Power method: 1 iterations in 0.002 seconds.
Computing steady-state probabilities for BSCC 10
Starting value iteration...
Power method: 1 iterations in 0.001 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.001 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.001 seconds.
Computing steady-state probabilities for BSCC 17
Starting value iteration...
Power method: 1 iterations in 0.001 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.001 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.001 seconds.
Printing steady-state probabilities in plain text format below:
308141:(9,20,4,0,0,0,0,0)=0.3376982357231465
308142:(9,20,4,1,0,0,0,0)=0.15645982407462644
308143:(9,20,4,2,0,0,0,0)=0.2342204182455152
308144:(9,20,4,3,0,0,0,0)=0.09795774160518395
308145:(9,20,4,4,0,0,0,0)=0.08415793892880186
308146:(9,20,4,5,0,0,0,0)=0.034685769649156636
308147:(9,20,4,6,0,0,0,0)=0.024011890938633984
308148:(9,20,4,7,0,0,0,0)=0.01105729458671653
308149:(9,20,4,8,0,0,0,0)=0.007285386416168311
308150:(9,20,4,9,0,0,0,0)=0.004050529493116302
308151:(9,20,4,10,0,0,0,0)=0.0027234685384657934
308152:(9,20,4,11,0,0,0,0)=0.0017600659186861722
308153:(9,20,4,12,0,0,0,0)=0.0012230282440736098
308154:(9,20,4,13,0,0,0,0)=8.517925788901577E-4
308155:(9,20,4,14,0,0,0,0)=6.05758780255552E-4
308156:(9,20,4,15,0,0,0,0)=4.3202161816751375E-4
308157:(9,20,4,16,0,0,0,0)=3.0779485018656613E-4
308158:(9,20,4,17,0,0,0,0)=2.1687040143114297E-4
308159:(9,20,4,18,0,0,0,0)=1.4908973181205606E-4
308160:(9,20,4,19,0,0,0,0)=9.641599526136967E-5
308161:(9,20,4,20,0,0,0,0)=4.866368170119375E-5
Time for steady-state probability computation: 33.114 seconds.