PRISM

Benchmark
Model:embedded v.1 (CTMC)
Parameter(s)MAX_COUNT = 8, T = 12
Property:up_time (exp-reward)
Invocation (specific)
./fix-syntax ./prism --javamaxmem 11g embedded.prism embedded.props --property up_time -const MAX_COUNT=8,T=12 -hybrid
Select best engine
Execution
Walltime:1.4626986980438232s
Return code:0
Relative Error:5.319068526836927e-05
Log
PRISM
=====

Version: 4.4.dev
Date: Mon Dec 10 21:19:47 CET 2018
Hostname: qcomp2019
Memory limits: cudd=1g, java(heap)=1g
Command line: prism --javamaxmem 11g embedded.prism embedded.props --property up_time -const 'MAX_COUNT=8,T=12' -hybrid

Parsing model file "embedded.prism"...

Parsing properties file "embedded.props"...

14 properties:
(1) "actuators": P=? [ !"down" U "fail_actuators" ]
(2) "actuators_T": P=? [ !"down" U<=(T*3600) "fail_sensors" ]
(3) "danger_T": R{"danger"}=? [ C<=(T*3600) ]
(4) "danger_time": R{"danger"}=? [ F "down" ]
(5) "down_T": R{"down"}=? [ C<=(T*3600) ]
(6) "failure_T": P=? [ F<=(T*3600) "down" ]
(7) "io": P=? [ !"down" U "fail_io" ]
(8) "io_T": P=? [ !"down" U<=(T*3600) "fail_io" ]
(9) "main": P=? [ !"down" U "fail_main" ]
(10) "main_T": P=? [ !"down" U<=(T*3600) "fail_main" ]
(11) "sensors": P=? [ !"down" U "fail_sensors" ]
(12) "sensors_T": P=? [ !"down" U<=(T*3600) "fail_sensors" ]
(13) "up_T": R{"up"}=? [ C<=(T*3600) ]
(14) "up_time": R{"up"}=? [ F "down" ]

Type:        CTMC
Modules:     sensors proci actuators proco procm bus 
Variables:   s i a o m count comp reqi reqo 

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

Model checking: "up_time": R{"up"}=? [ F "down" ]
Model constants: MAX_COUNT=8

Building model...
Model constants: MAX_COUNT=8

Computing reachable states...

Reachability (BFS): 21 iterations in 0.03 seconds (average 0.001429, setup 0.00)

Time for model construction: 0.043 seconds.

Type:        CTMC
States:      8548 (1 initial)
Transitions: 36041

Rate matrix: 1819 nodes (9 terminal), 36041 minterms, vars: 16r/16c

Diagonals vector: 841 nodes (69 terminal), 8548 minterms
Embedded Markov chain: 14290 nodes (309 terminal), 36041 minterms

Prob0: 2 iterations in 0.00 seconds (average 0.000500, setup 0.00)

Prob1: 1 iterations in 0.00 seconds (average 0.000000, setup 0.00)

goal = 5884, inf = 0, maybe = 2664

Computing remaining rewards...
Engine: Hybrid

Building hybrid MTBDD matrix... [levels=16, nodes=11198] [524.9 KB]
Adding explicit sparse matrices... [levels=16, num=1, compact] [62.8 KB]
Creating vector for diagonals... [dist=5, compact] [16.7 KB]
Creating vector for RHS... [dist=20, compact] [16.9 KB]
Allocating iteration vectors... [2 x 66.8 KB]
TOTAL: [754.9 KB]

Starting iterations...

Jacobi: 624 iterations in 0.12 seconds (average 0.000096, setup 0.06)

Value in the initial state: 477.526972245617

Time for model checking: 0.122 seconds.

Result: 477.526972245617 (value in the initial state)


Overall running time: 0.751 seconds.