Storm.ddbisim

Benchmark
Model:embedded v.1 (CTMC)
Parameter(s)MAX_COUNT = 8, T = 12
Property:actuators (prob-reach)
Invocation (ddbisim)
/home/tq429871/storm/build/bin/storm --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/embedded/embedded.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/embedded/embedded.props actuators --constants MAX_COUNT=8,T=12 --prismcompat --engine dd-to-sparse --bisimulation --sylvan:maxmem 4096 --sylvan:threads 4 --timemem
Symbolic bisimulation with sparse quotient and sylvan using 4GB memory Use `--prismcompat` to ensure compatibility with prism benchmark.
Execution
Walltime:0.7600550651550293s
Return code:0
Relative Error:2.557487840339145e-08
Log
Storm 1.6.2

Date: Sat Sep  5 20:49:59 2020
Command line arguments: --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/embedded/embedded.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/embedded/embedded.props actuators --constants 'MAX_COUNT=8,T=12' --prismcompat --engine dd-to-sparse --bisimulation '--sylvan:maxmem' 4096 '--sylvan:threads' 4 --timemem
Current working directory: /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks

 WARN (Program.cpp:178): The input model is a CTMC, but uses probabilistic commands like they are used in PRISM. Consider rewriting the commands to use Markovian commands instead.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
Time for model input parsing: 0.003s.

 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
 WARN (Program.cpp:1277): The model uses synchronizing Markovian commands. This may lead to unexpected verification results, because of unclear semantics.
Time for model construction: 0.398s.

-------------------------------------------------------------- 
Model type: 	CTMC (symbolic)
States: 	8034 (61 nodes)
Transitions: 	33564 (1888 nodes)
Reward Models:  none
Variables: 	rows: 9 meta variables (16 DD variables), columns: 9 meta variables (16 DD variables)
Labels: 	9
   * deadlock -> 0 state(s) (1 nodes)
   * init -> 1 state(s) (17 nodes)
   * danger
   * down
   * fail_actuators
   * fail_io
   * fail_main
   * fail_sensors
   * up
-------------------------------------------------------------- 

Time for model preprocessing: 0.289s.

-------------------------------------------------------------- 
Model type: 	CTMC (sparse)
States: 	579
Transitions: 	3848
Reward Models:  none
State Labels: 	6 labels
   * (((((i = 2) & (s < 2)) | (count = (8 + 1))) | ((o = 2) & (a < 1))) | (m = 0)) -> 150 item(s)
   * deadlock -> 0 item(s)
   * init -> 1 item(s)
   * down -> 150 item(s)
   * ((o = 2) & (a < 1)) -> 1 item(s)
   * fail_actuators -> 1 item(s)
Choice Labels: 	none
-------------------------------------------------------------- 

Model checking property "actuators": P=? [!("down") U "fail_actuators"] ...
Result (for initial states): 0.1053036531
Time for model checking: 0.001s.

Performance statistics:
  * peak memory usage: 2885MB
  * CPU time: 1.622s
  * wallclock time: 0.704s