Storm.ddbisim

Benchmark
Model:cluster v.1 (CTMC)
Parameter(s)N = 128, T = 2000, t = 20
Property:qos1 (prob-reach-time-bounded)
Invocation (ddbisim)
/home/tq429871/storm/build/bin/storm --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/cluster/cluster.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/cluster/cluster.props qos1 --constants N=128,T=2000,t=20 --prismcompat --engine dd-to-sparse --bisimulation --sylvan:maxmem 4096 --sylvan:threads 4 --timemem --precision 0.001
Symbolic bisimulation with sparse quotient and sylvan using 4GB memory Use `--prismcompat` to ensure compatibility with prism benchmark.
Execution
Walltime:100.66198706626892s
Return code:0
Relative Error:3.4035723943465035e-07
Log
Storm 1.6.2

Date: Sat Sep  5 21:01:11 2020
Command line arguments: --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/cluster/cluster.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/ctmc/cluster/cluster.props qos1 --constants 'N=128,T=2000,t=20' --prismcompat --engine dd-to-sparse --bisimulation '--sylvan:maxmem' 4096 '--sylvan:threads' 4 --timemem --precision 0.001
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.462s.

-------------------------------------------------------------- 
Model type: 	CTMC (symbolic)
States: 	597012 (41 nodes)
Transitions: 	2908192 (17481 nodes)
Reward Models:  none
Variables: 	rows: 11 meta variables (25 DD variables), columns: 11 meta variables (25 DD variables)
Labels: 	4
   * deadlock -> 0 state(s) (1 nodes)
   * init -> 1 state(s) (26 nodes)
   * minimum
   * premium
-------------------------------------------------------------- 

Time for model preprocessing: 39.729s.

-------------------------------------------------------------- 
Model type: 	CTMC (sparse)
States: 	597012
Transitions: 	2908192
Reward Models:  none
State Labels: 	4 labels
   * minimum -> 141117 item(s)
   * init -> 1 item(s)
   * ((((left_n >= floor((3/4 * 128))) & toleft_n) | ((right_n >= floor((3/4 * 128))) & toright_n)) | (((((left_n + right_n) >= floor((3/4 * 128))) & toleft_n) & line_n) & toright_n)) -> 141117 item(s)
   * deadlock -> 0 item(s)
Choice Labels: 	none
-------------------------------------------------------------- 

Model checking property "qos1": P=? [true U<=2000 !("minimum")] ...
Result (for initial states): 0.001072402999
Time for model checking: 60.402s.

Performance statistics:
  * peak memory usage: 4061MB
  * CPU time: 218.728s
  * wallclock time: 100.615s