Storm.ddbisim

Benchmark
Model:consensus v.1 (MDP)
Parameter(s)N = 6, K = 2
Property:disagree (prob-reach)
Invocation (ddbisim)
/home/tq429871/storm/build/bin/storm --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.6.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.props disagree --constants K=2 --engine dd-to-sparse --bisimulation --sylvan:maxmem 4096 --sylvan:threads 4 --timemem
Symbolic bisimulation with sparse quotient and sylvan using 4GB memory
Execution
Walltime:3.6348042488098145s
Return code:0
Relative Error:7.819296976023959e-05
Log
Storm 1.6.2

Date: Sat Sep  5 20:52:08 2020
Command line arguments: --prism /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.6.prism --prop /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks/qcomp/benchmarks/mdp/consensus/consensus.props disagree --constants K=2 --engine dd-to-sparse --bisimulation '--sylvan:maxmem' 4096 '--sylvan:threads' 4 --timemem
Current working directory: /rwthfs/rz/cluster/home/tq429871/git/storm-qcomp-benchmarks

Time for model input parsing: 0.003s.

Time for model construction: 0.450s.

-------------------------------------------------------------- 
Model type: 	MDP (symbolic)
States: 	1258240 (218 nodes)
Transitions: 	6236736 (7075 nodes)
Choices: 	5008128
Reward Models:  none
Variables: 	rows: 13 meta variables (24 DD variables), columns: 13 meta variables (24 DD variables), nondeterminism: 6 meta variables (6 DD variables)
Labels: 	6
   * deadlock -> 0 state(s) (1 nodes)
   * init -> 1 state(s) (25 nodes)
   * agree
   * all_coins_equal_0
   * all_coins_equal_1
   * finished
-------------------------------------------------------------- 

Time for model preprocessing: 2.983s.

-------------------------------------------------------------- 
Model type: 	MDP (sparse)
States: 	5012
Transitions: 	27185
Choices: 	21741
Reward Models:  none
State Labels: 	6 labels
   * deadlock -> 0 item(s)
   * init -> 1 item(s)
   * ((((((pc1 = 3) & (pc2 = 3)) & (pc3 = 3)) & (pc4 = 3)) & (pc5 = 3)) & (pc6 = 3)) -> 1 item(s)
   * (((((coin1 = coin2) & (coin2 = coin3)) & (coin3 = coin4)) & (coin4 = coin5)) & (coin5 = coin6)) -> 1121 item(s)
   * agree -> 1121 item(s)
   * finished -> 1 item(s)
Choice Labels: 	none
-------------------------------------------------------------- 

Model checking property "disagree": Pmax=? [F ("finished" & !("agree"))] ...
Result (for initial states): 0.3636163151
Time for model checking: 0.133s.

Performance statistics:
  * peak memory usage: 3055MB
  * CPU time: 12.141s
  * wallclock time: 3.583s