fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978700234
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10171.420 3600000.00 3628414.00 595.60 ??F???????????F? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978700234.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 48K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679346540370

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:09:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:09:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:09:01] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-20 21:09:01] [INFO ] Transformed 203 places.
[2023-03-20 21:09:02] [INFO ] Transformed 203 transitions.
[2023-03-20 21:09:02] [INFO ] Found NUPN structural information;
[2023-03-20 21:09:02] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 122 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 191
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 191
Applied a total of 24 rules in 19 ms. Remains 191 /203 variables (removed 12) and now considering 191/203 (removed 12) transitions.
// Phase 1: matrix 191 rows 191 cols
[2023-03-20 21:09:02] [INFO ] Computed 17 place invariants in 12 ms
[2023-03-20 21:09:02] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-20 21:09:02] [INFO ] Invariant cache hit.
[2023-03-20 21:09:02] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-20 21:09:02] [INFO ] Invariant cache hit.
[2023-03-20 21:09:02] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/203 places, 191/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 191/203 places, 191/203 transitions.
Support contains 122 out of 191 places after structural reductions.
[2023-03-20 21:09:02] [INFO ] Flatten gal took : 40 ms
[2023-03-20 21:09:02] [INFO ] Flatten gal took : 10 ms
[2023-03-20 21:09:02] [INFO ] Input system was already deterministic with 191 transitions.
Support contains 121 out of 191 places (down from 122) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 105) seen :99
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-20 21:09:03] [INFO ] Invariant cache hit.
[2023-03-20 21:09:03] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-03-20 21:09:03] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:09:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-20 21:09:03] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:09:03] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 4 ms to minimize.
[2023-03-20 21:09:03] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2023-03-20 21:09:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2023-03-20 21:09:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2023-03-20 21:09:03] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 13 ms to minimize.
[2023-03-20 21:09:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-20 21:09:03] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 21:09:03] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 172 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-20 21:09:03] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:09:03] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:09:03] [INFO ] Input system was already deterministic with 191 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 168 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 168 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 167
Applied a total of 48 rules in 21 ms. Remains 167 /191 variables (removed 24) and now considering 167/191 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 167/191 places, 167/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 162 transition count 162
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Applied a total of 62 rules in 26 ms. Remains 160 /191 variables (removed 31) and now considering 160/191 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 160/191 places, 160/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 163 transition count 163
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 163 transition count 163
Applied a total of 56 rules in 25 ms. Remains 163 /191 variables (removed 28) and now considering 163/191 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 163/191 places, 163/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 167 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 167 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 165 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 165 transition count 165
Applied a total of 52 rules in 10 ms. Remains 165 /191 variables (removed 26) and now considering 165/191 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 165/191 places, 165/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 160 transition count 160
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 158 transition count 158
Applied a total of 66 rules in 9 ms. Remains 158 /191 variables (removed 33) and now considering 158/191 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 158/191 places, 158/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 161 transition count 161
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 159
Applied a total of 64 rules in 8 ms. Remains 159 /191 variables (removed 32) and now considering 159/191 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 159/191 places, 159/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 8 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 161 transition count 161
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Applied a total of 62 rules in 7 ms. Remains 160 /191 variables (removed 31) and now considering 160/191 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 160/191 places, 160/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 161 transition count 161
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 159
Applied a total of 64 rules in 9 ms. Remains 159 /191 variables (removed 32) and now considering 159/191 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 159/191 places, 159/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 160 transition count 160
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 158 transition count 158
Applied a total of 66 rules in 8 ms. Remains 158 /191 variables (removed 33) and now considering 158/191 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 158/191 places, 158/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 159 transition count 159
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 158 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 157 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 157 transition count 157
Applied a total of 68 rules in 16 ms. Remains 157 /191 variables (removed 34) and now considering 157/191 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 157/191 places, 157/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 162 transition count 162
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Applied a total of 62 rules in 9 ms. Remains 160 /191 variables (removed 31) and now considering 160/191 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 160/191 places, 160/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 167 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 167 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 165 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 165 transition count 165
Applied a total of 52 rules in 9 ms. Remains 165 /191 variables (removed 26) and now considering 165/191 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 165/191 places, 165/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 15 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 162 transition count 162
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Applied a total of 62 rules in 8 ms. Remains 160 /191 variables (removed 31) and now considering 160/191 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 160/191 places, 160/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 190 transition count 136
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 136 transition count 136
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 108 place count 136 transition count 118
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 144 place count 118 transition count 118
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 164 place count 98 transition count 98
Iterating global reduction 2 with 20 rules applied. Total rules applied 184 place count 98 transition count 98
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 184 place count 98 transition count 85
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 210 place count 85 transition count 85
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 274 place count 53 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 53 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 52 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 50 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 49 transition count 49
Applied a total of 280 rules in 43 ms. Remains 49 /191 variables (removed 142) and now considering 49/191 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 49/191 places, 49/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 10 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 190 transition count 139
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 139 transition count 139
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 102 place count 139 transition count 119
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 142 place count 119 transition count 119
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 164 place count 97 transition count 97
Iterating global reduction 2 with 22 rules applied. Total rules applied 186 place count 97 transition count 97
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 186 place count 97 transition count 84
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 212 place count 84 transition count 84
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 272 place count 54 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 273 place count 54 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 53 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 51 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 50 transition count 50
Applied a total of 278 rules in 42 ms. Remains 50 /191 variables (removed 141) and now considering 50/191 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 50/191 places, 50/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 191/191 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 161 transition count 161
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 159
Applied a total of 64 rules in 24 ms. Remains 159 /191 variables (removed 32) and now considering 159/191 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 159/191 places, 159/191 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:09:04] [INFO ] Input system was already deterministic with 159 transitions.
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:09:04] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:09:04] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 27 ms.
[2023-03-20 21:09:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 191 places, 191 transitions and 454 arcs took 1 ms.
Total runtime 3102 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 191 NrTr: 191 NrArc: 454)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 3.070sec


RS generation: 0m24.815sec


-> reachability set: #nodes 1763410 (1.8e+06) #states 3,838,881,456,935,226 (15)



starting MCC model checker
--------------------------

checking: [AX [AF [EG [[p167<=1 & 1<=p167]]]] | EX [AF [AX [[p12<=1 & 1<=p12]]]]]
normalized: [EX [~ [EG [EX [~ [[p12<=1 & 1<=p12]]]]]] | ~ [EX [EG [~ [EG [[p167<=1 & 1<=p167]]]]]]]

abstracting: (1<=p167)
states: 362,230,706,176,596 (14)
abstracting: (p167<=1)
states: 3,838,881,456,935,226 (15)
..........
before gc: list nodes free: 1854702

after gc: idd nodes used:4370169, unused:59629831; list nodes free:264377126
.......MC time: 3m44.066sec

checking: AG [AF [~ [E [[p84<=1 & 1<=p84] U [p181<=1 & 1<=p181]]]]]
normalized: ~ [E [true U EG [E [[p84<=1 & 1<=p84] U [p181<=1 & 1<=p181]]]]]

abstracting: (1<=p181)
states: 263,814,894,047,264 (14)
abstracting: (p181<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p84)
states: 497,170,226,935,584 (14)
abstracting: (p84<=1)
states: 3,838,881,456,935,226 (15)

before gc: list nodes free: 2031403

after gc: idd nodes used:3258434, unused:60741566; list nodes free:273194444
...............................................
before gc: list nodes free: 1911926

after gc: idd nodes used:4151047, unused:59848953; list nodes free:275286316
.......................
before gc: list nodes free: 2248963

after gc: idd nodes used:3477695, unused:60522305; list nodes free:278433476
MC time: 3m30.107sec

checking: AF [AG [[[p111<=1 & 1<=p111] & [[p117<=1 & 1<=p117] & [p132<=1 & 1<=p132]]]]]
normalized: ~ [EG [E [true U ~ [[[[p117<=1 & 1<=p117] & [p132<=1 & 1<=p132]] & [p111<=1 & 1<=p111]]]]]]

abstracting: (1<=p111)
states: 425,195,655,931,236 (14)
abstracting: (p111<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p132)
states: 521,666,379,662,310 (14)
abstracting: (p132<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p117)
states: 425,213,929,964,816 (14)
abstracting: (p117<=1)
states: 3,838,881,456,935,226 (15)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-004B-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.357sec

checking: AF [[EG [[[~ [[p163<=1 & 1<=p163]] & [p56<=1 & 1<=p56]] & [[p106<=1 & 1<=p106] & [[p158<=1 & 1<=p158] & [p189<=1 & 1<=p189]]]]] & [EG [~ [[p186<=1 & 1<=p186]]] | EX [~ [[p53<=1 & 1<=p53]]]]]]
normalized: ~ [EG [~ [[[EX [~ [[p53<=1 & 1<=p53]]] | EG [~ [[p186<=1 & 1<=p186]]]] & EG [[[[[p189<=1 & 1<=p189] & [p158<=1 & 1<=p158]] & [p106<=1 & 1<=p106]] & [[p56<=1 & 1<=p56] & ~ [[p163<=1 & 1<=p163]]]]]]]]]

abstracting: (1<=p163)
states: 505,732,279,140,704 (14)
abstracting: (p163<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p56)
states: 192,477,132,037,344 (14)
abstracting: (p56<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p106)
states: 406,527,387,796,928 (14)
abstracting: (p106<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p158)
states: 402,864,964,726,262 (14)
abstracting: (p158<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p189)
states: 467,478,431,556,387 (14)
abstracting: (p189<=1)
states: 3,838,881,456,935,226 (15)
.......................................................................................................................................................
EG iterations: 151
abstracting: (1<=p186)
states: 459,111,443,961,459 (14)
abstracting: (p186<=1)
states: 3,838,881,456,935,226 (15)
........
before gc: list nodes free: 10842754

after gc: idd nodes used:5753149, unused:58246851; list nodes free:268224576
.MC time: 3m26.623sec

checking: AX [AF [[[[p121<=1 & 1<=p121] & [p139<=1 & 1<=p139]] & [[p49<=1 & 1<=p49] & [[~ [E [[p116<=1 & 1<=p116] U [p153<=1 & 1<=p153]]] | [p13<=1 & 1<=p13]] & [[p19<=0 & 0<=p19] | [p3<=0 & 0<=p3]]]]]]]
normalized: ~ [EX [EG [~ [[[[[~ [E [[p116<=1 & 1<=p116] U [p153<=1 & 1<=p153]]] | [p13<=1 & 1<=p13]] & [[p3<=0 & 0<=p3] | [p19<=0 & 0<=p19]]] & [p49<=1 & 1<=p49]] & [[p139<=1 & 1<=p139] & [p121<=1 & 1<=p121]]]]]]]

abstracting: (1<=p121)
states: 451,790,223,538,388 (14)
abstracting: (p121<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p139)
states: 461,556,297,195,408 (14)
abstracting: (p139<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p49)
states: 454,245,885,850,368 (14)
abstracting: (p49<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (0<=p19)
states: 3,838,881,456,935,226 (15)
abstracting: (p19<=0)
states: 3,455,756,431,055,674 (15)
abstracting: (0<=p3)
states: 3,838,881,456,935,226 (15)
abstracting: (p3<=0)
states: 3,838,728,605,941,658 (15)
abstracting: (1<=p13)
states: 396,491,100,808,000 (14)
abstracting: (p13<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p153)
states: 384,191,044,720,388 (14)
abstracting: (p153<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p116)
states: 359,333,207,729,216 (14)
abstracting: (p116<=1)
states: 3,838,881,456,935,226 (15)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldRVt-PT-004B-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.613sec

checking: AF [[AF [EX [[p188<=1 & 1<=p188]]] & A [[[[p6<=1 & 1<=p6] & [[p20<=1 & 1<=p20] & [p51<=1 & 1<=p51]]] & [[p20<=1 & 1<=p20] & [[p25<=1 & 1<=p25] & [p40<=1 & 1<=p40]]]] U [[p107<=1 & 1<=p107] & [p75<=1 & 1<=p75]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[[p75<=1 & 1<=p75] & [p107<=1 & 1<=p107]]]]] & ~ [E [~ [[[p75<=1 & 1<=p75] & [p107<=1 & 1<=p107]]] U [~ [[[[[p40<=1 & 1<=p40] & [p25<=1 & 1<=p25]] & [p20<=1 & 1<=p20]] & [[[p51<=1 & 1<=p51] & [p20<=1 & 1<=p20]] & [p6<=1 & 1<=p6]]]] & ~ [[[p75<=1 & 1<=p75] & [p107<=1 & 1<=p107]]]]]]] & ~ [EG [~ [EX [[p188<=1 & 1<=p188]]]]]]]]]

abstracting: (1<=p188)
states: 445,248,781,752,243 (14)
abstracting: (p188<=1)
states: 3,838,881,456,935,226 (15)
..........
before gc: list nodes free: 12299112

after gc: idd nodes used:7973738, unused:56026262; list nodes free:259529364
.MC time: 3m24.268sec

checking: [EG [[E [EF [[[p67<=1 & 1<=p67] & [[p121<=1 & 1<=p121] & [p139<=1 & 1<=p139]]]] U ~ [[~ [[p62<=1 & 1<=p62]] & AG [[p69<=1 & 1<=p69]]]]] & EG [[p110<=0 & 0<=p110]]]] & E [[AX [~ [[[p114<=1 & 1<=p114] | [p96<=1 & 1<=p96]]]] | [p120<=1 & 1<=p120]] U ~ [[p129<=1 & 1<=p129]]]]
normalized: [E [[[p120<=1 & 1<=p120] | ~ [EX [[[p96<=1 & 1<=p96] | [p114<=1 & 1<=p114]]]]] U ~ [[p129<=1 & 1<=p129]]] & EG [[EG [[p110<=0 & 0<=p110]] & E [E [true U [[[p139<=1 & 1<=p139] & [p121<=1 & 1<=p121]] & [p67<=1 & 1<=p67]]] U ~ [[~ [E [true U ~ [[p69<=1 & 1<=p69]]]] & ~ [[p62<=1 & 1<=p62]]]]]]]]

abstracting: (1<=p62)
states: 400,491,243,933,880 (14)
abstracting: (p62<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p69)
states: 393,683,351,263,616 (14)
abstracting: (p69<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p67)
states: 285,529,872,916,544 (14)
abstracting: (p67<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p121)
states: 451,790,223,538,388 (14)
abstracting: (p121<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p139)
states: 461,556,297,195,408 (14)
abstracting: (p139<=1)
states: 3,838,881,456,935,226 (15)

before gc: list nodes free: 11855516

after gc: idd nodes used:4634907, unused:59365093; list nodes free:273831456
MC time: 3m10.018sec

checking: [EX [[EF [[p175<=1 & 1<=p175]] | [~ [A [[p16<=1 & 1<=p16] U [[p60<=1 & 1<=p60] & [[p111<=1 & 1<=p111] & [p144<=1 & 1<=p144]]]]] & [p102<=1 & 1<=p102]]]] | ~ [E [~ [AF [AX [[[p166<=1 & 1<=p166] & [p184<=1 & 1<=p184]]]]] U [AF [[[p13<=1 & 1<=p13] | EX [[p57<=1 & 1<=p57]]]] | ~ [EF [~ [[p170<=1 & 1<=p170]]]]]]]]
normalized: [~ [E [EG [EX [~ [[[p184<=1 & 1<=p184] & [p166<=1 & 1<=p166]]]]] U [~ [E [true U ~ [[p170<=1 & 1<=p170]]]] | ~ [EG [~ [[EX [[p57<=1 & 1<=p57]] | [p13<=1 & 1<=p13]]]]]]]] | EX [[[[p102<=1 & 1<=p102] & ~ [[~ [EG [~ [[[[p144<=1 & 1<=p144] & [p111<=1 & 1<=p111]] & [p60<=1 & 1<=p60]]]]] & ~ [E [~ [[[[p144<=1 & 1<=p144] & [p111<=1 & 1<=p111]] & [p60<=1 & 1<=p60]]] U [~ [[p16<=1 & 1<=p16]] & ~ [[[[p144<=1 & 1<=p144] & [p111<=1 & 1<=p111]] & [p60<=1 & 1<=p60]]]]]]]]] | E [true U [p175<=1 & 1<=p175]]]]]

abstracting: (1<=p175)
states: 450,788,546,373,295 (14)
abstracting: (p175<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p60)
states: 400,491,243,933,880 (14)
abstracting: (p60<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p111)
states: 425,195,655,931,236 (14)
abstracting: (p111<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p144)
states: 474,640,914,455,052 (14)
abstracting: (p144<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p16)
states: 396,491,100,808,000 (14)
abstracting: (p16<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p60)
states: 400,491,243,933,880 (14)
abstracting: (p60<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p111)
states: 425,195,655,931,236 (14)
abstracting: (p111<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p144)
states: 474,640,914,455,052 (14)
abstracting: (p144<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p60)
states: 400,491,243,933,880 (14)
abstracting: (p60<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p111)
states: 425,195,655,931,236 (14)
abstracting: (p111<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p144)
states: 474,640,914,455,052 (14)
abstracting: (p144<=1)
states: 3,838,881,456,935,226 (15)
................
before gc: list nodes free: 10904633

after gc: idd nodes used:6522061, unused:57477939; list nodes free:265101756
MC time: 2m57.385sec

checking: AG [EF [[[p170<=1 & 1<=p170] & [[AX [[[p20<=1 & 1<=p20] & [[p25<=1 & 1<=p25] & [p40<=1 & 1<=p40]]]] | EX [[p26<=1 & 1<=p26]]] & [[p137<=1 & 1<=p137] | [[p29<=1 & 1<=p29] & [[p46<=1 & 1<=p46] & [[p111<=0 & 0<=p111] | [[p117<=0 & 0<=p117] | [p132<=0 & 0<=p132]]]]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[[[[p117<=0 & 0<=p117] | [p132<=0 & 0<=p132]] | [p111<=0 & 0<=p111]] & [p46<=1 & 1<=p46]] & [p29<=1 & 1<=p29]] | [p137<=1 & 1<=p137]] & [EX [[p26<=1 & 1<=p26]] | ~ [EX [~ [[[[p40<=1 & 1<=p40] & [p25<=1 & 1<=p25]] & [p20<=1 & 1<=p20]]]]]]] & [p170<=1 & 1<=p170]]]]]]

abstracting: (1<=p170)
states: 450,788,546,373,295 (14)
abstracting: (p170<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p20)
states: 411,190,668,569,408 (14)
abstracting: (p20<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p25)
states: 494,898,199,158,912 (14)
abstracting: (p25<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p40)
states: 473,227,029,086,608 (14)
abstracting: (p40<=1)
states: 3,838,881,456,935,226 (15)
.abstracting: (1<=p26)
states: 494,898,199,158,912 (14)
abstracting: (p26<=1)
states: 3,838,881,456,935,226 (15)
.abstracting: (1<=p137)
states: 461,556,297,195,408 (14)
abstracting: (p137<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p29)
states: 541,595,766,411,152 (14)
abstracting: (p29<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p46)
states: 454,245,885,850,368 (14)
abstracting: (p46<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (0<=p111)
states: 3,838,881,456,935,226 (15)
abstracting: (p111<=0)
states: 3,413,685,801,003,990 (15)
abstracting: (0<=p132)
states: 3,838,881,456,935,226 (15)
abstracting: (p132<=0)
states: 3,317,215,077,272,916 (15)
abstracting: (0<=p117)
states: 3,838,881,456,935,226 (15)
abstracting: (p117<=0)
states: 3,413,667,526,970,410 (15)

before gc: list nodes free: 9939678

after gc: idd nodes used:5658575, unused:58341425; list nodes free:269211604
MC time: 2m44.070sec

checking: AG [EF [[[AF [[[p106<=1 & 1<=p106] & [[p158<=1 & 1<=p158] & [p189<=1 & 1<=p189]]]] | [AF [[p165<=1 & 1<=p165]] | EX [[[[p118<=1 & 1<=p118] & [p164<=1 & 1<=p164]] | EG [[[p158<=1 & 1<=p158] & [[p162<=1 & 1<=p162] & [p177<=1 & 1<=p177]]]]]]]] | [[p102<=1 & 1<=p102] | [[p58<=1 & 1<=p58] | [p164<=1 & 1<=p164]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[~ [EG [~ [[p165<=1 & 1<=p165]]]] | EX [[EG [[[[p177<=1 & 1<=p177] & [p162<=1 & 1<=p162]] & [p158<=1 & 1<=p158]]] | [[p164<=1 & 1<=p164] & [p118<=1 & 1<=p118]]]]] | ~ [EG [~ [[[p106<=1 & 1<=p106] & [[p189<=1 & 1<=p189] & [p158<=1 & 1<=p158]]]]]]] | [[[p164<=1 & 1<=p164] | [p58<=1 & 1<=p58]] | [p102<=1 & 1<=p102]]]]]]]

abstracting: (1<=p102)
states: 24,354,089,164,929 (13)
abstracting: (p102<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p58)
states: 400,491,243,933,880 (14)
abstracting: (p58<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p164)
states: 505,732,279,140,704 (14)
abstracting: (p164<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p158)
states: 402,864,964,726,262 (14)
abstracting: (p158<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p189)
states: 467,478,431,556,387 (14)
abstracting: (p189<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p106)
states: 406,527,387,796,928 (14)
abstracting: (p106<=1)
states: 3,838,881,456,935,226 (15)
..................
before gc: list nodes free: 9560248

after gc: idd nodes used:8325016, unused:55674984; list nodes free:256965989
MC time: 2m32.024sec

checking: [E [EG [[p165<=1 & 1<=p165]] U EX [[EX [[[p128<=1 & 1<=p128] & [p176<=1 & 1<=p176]]] & ~ [[p169<=1 & 1<=p169]]]]] | [AX [AX [[A [[p157<=1 & 1<=p157] U [p135<=1 & 1<=p135]] | [[p27<=0 & 0<=p27] | [p183<=0 & 0<=p183]]]]] & [AF [[A [[p47<=1 & 1<=p47] U [p129<=1 & 1<=p129]] & EX [[p167<=1 & 1<=p167]]]] & AF [EG [[[p74<=1 & 1<=p74] & [p92<=1 & 1<=p92]]]]]]]
normalized: [[[~ [EG [~ [EG [[[p92<=1 & 1<=p92] & [p74<=1 & 1<=p74]]]]]] & ~ [EG [~ [[EX [[p167<=1 & 1<=p167]] & [~ [EG [~ [[p129<=1 & 1<=p129]]]] & ~ [E [~ [[p129<=1 & 1<=p129]] U [~ [[p47<=1 & 1<=p47]] & ~ [[p129<=1 & 1<=p129]]]]]]]]]]] & ~ [EX [EX [~ [[[[p183<=0 & 0<=p183] | [p27<=0 & 0<=p27]] | [~ [EG [~ [[p135<=1 & 1<=p135]]]] & ~ [E [~ [[p135<=1 & 1<=p135]] U [~ [[p157<=1 & 1<=p157]] & ~ [[p135<=1 & 1<=p135]]]]]]]]]]]] | E [EG [[p165<=1 & 1<=p165]] U EX [[~ [[p169<=1 & 1<=p169]] & EX [[[p176<=1 & 1<=p176] & [p128<=1 & 1<=p128]]]]]]]

abstracting: (1<=p128)
states: 513,494,514,495,216 (14)
abstracting: (p128<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p176)
states: 449,272,953,131,439 (14)
abstracting: (p176<=1)
states: 3,838,881,456,935,226 (15)
.abstracting: (1<=p169)
states: 224,997,934,381,984 (14)
abstracting: (p169<=1)
states: 3,838,881,456,935,226 (15)
.abstracting: (1<=p165)
states: 505,732,279,140,704 (14)
abstracting: (p165<=1)
states: 3,838,881,456,935,226 (15)
..................MC time: 2m21.095sec

checking: EF [[[~ [A [[p67<=1 & 1<=p67] U [p50<=1 & 1<=p50]]] & [~ [A [E [[p149<=1 & 1<=p149] U [p21<=1 & 1<=p21]] U [[p82<=1 & 1<=p82] & [p22<=1 & 1<=p22]]]] & AX [[[p4<=0 & 0<=p4] | [[p35<=0 & 0<=p35] | [p71<=0 & 0<=p71]]]]]] & [E [[p39<=1 & 1<=p39] U [p112<=1 & 1<=p112]] & [EF [EG [[p122<=0 & 0<=p122]]] & [[p78<=1 & 1<=p78] | [[p57<=0 & 0<=p57] | [p137<=0 & 0<=p137]]]]]]]
normalized: E [true U [[[[[[p137<=0 & 0<=p137] | [p57<=0 & 0<=p57]] | [p78<=1 & 1<=p78]] & E [true U EG [[p122<=0 & 0<=p122]]]] & E [[p39<=1 & 1<=p39] U [p112<=1 & 1<=p112]]] & [[~ [EX [~ [[[[p71<=0 & 0<=p71] | [p35<=0 & 0<=p35]] | [p4<=0 & 0<=p4]]]]] & ~ [[~ [EG [~ [[[p22<=1 & 1<=p22] & [p82<=1 & 1<=p82]]]]] & ~ [E [~ [[[p22<=1 & 1<=p22] & [p82<=1 & 1<=p82]]] U [~ [E [[p149<=1 & 1<=p149] U [p21<=1 & 1<=p21]]] & ~ [[[p22<=1 & 1<=p22] & [p82<=1 & 1<=p82]]]]]]]]] & ~ [[~ [EG [~ [[p50<=1 & 1<=p50]]]] & ~ [E [~ [[p50<=1 & 1<=p50]] U [~ [[p67<=1 & 1<=p67]] & ~ [[p50<=1 & 1<=p50]]]]]]]]]]

abstracting: (1<=p50)
states: 392,107,156,579,360 (14)
abstracting: (p50<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p67)
states: 285,529,872,916,544 (14)
abstracting: (p67<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p50)
states: 392,107,156,579,360 (14)
abstracting: (p50<=1)
states: 3,838,881,456,935,226 (15)

before gc: list nodes free: 6753890

after gc: idd nodes used:6887099, unused:57112901; list nodes free:263966216
abstracting: (1<=p50)
states: 392,107,156,579,360 (14)
abstracting: (p50<=1)
states: 3,838,881,456,935,226 (15)
MC time: 2m11.450sec

checking: AF [[AX [[[AF [E [[p62<=1 & 1<=p62] U [[p106<=1 & 1<=p106] & [[p158<=1 & 1<=p158] & [p189<=1 & 1<=p189]]]]] & [p56<=0 & 0<=p56]] & [[p22<=0 & 0<=p22] & [[[p155<=0 & 0<=p155] | [p111<=0 & 0<=p111]] | [[p117<=0 & 0<=p117] | [p132<=0 & 0<=p132]]]]]] | EX [[[AF [[p77<=1 & 1<=p77]] & [[p118<=1 & 1<=p118] & [[p156<=0 & 0<=p156] | [[[p85<=1 & 1<=p85] & [[p97<=1 & 1<=p97] & [p127<=1 & 1<=p127]]] | [p18<=1 & 1<=p18]]]]] | A [AG [[p91<=1 & 1<=p91]] U EG [[p136<=1 & 1<=p136]]]]]]]
normalized: ~ [EG [~ [[EX [[[~ [EG [~ [EG [[p136<=1 & 1<=p136]]]]] & ~ [E [~ [EG [[p136<=1 & 1<=p136]]] U [E [true U ~ [[p91<=1 & 1<=p91]]] & ~ [EG [[p136<=1 & 1<=p136]]]]]]] | [[[[[p18<=1 & 1<=p18] | [[[p127<=1 & 1<=p127] & [p97<=1 & 1<=p97]] & [p85<=1 & 1<=p85]]] | [p156<=0 & 0<=p156]] & [p118<=1 & 1<=p118]] & ~ [EG [~ [[p77<=1 & 1<=p77]]]]]]] | ~ [EX [~ [[[[[[p132<=0 & 0<=p132] | [p117<=0 & 0<=p117]] | [[p111<=0 & 0<=p111] | [p155<=0 & 0<=p155]]] & [p22<=0 & 0<=p22]] & [[p56<=0 & 0<=p56] & ~ [EG [~ [E [[p62<=1 & 1<=p62] U [[[p189<=1 & 1<=p189] & [p158<=1 & 1<=p158]] & [p106<=1 & 1<=p106]]]]]]]]]]]]]]]

abstracting: (1<=p106)
states: 406,527,387,796,928 (14)
abstracting: (p106<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p158)
states: 402,864,964,726,262 (14)
abstracting: (p158<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p189)
states: 467,478,431,556,387 (14)
abstracting: (p189<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p62)
states: 400,491,243,933,880 (14)
abstracting: (p62<=1)
states: 3,838,881,456,935,226 (15)
..................
before gc: list nodes free: 10155710

after gc: idd nodes used:8651331, unused:55348669; list nodes free:255546427
MC time: 2m 2.026sec

checking: E [AX [[~ [AG [[[p121<=1 & 1<=p121] & [[p139<=1 & 1<=p139] & [p186<=1 & 1<=p186]]]]] | [EX [~ [[p11<=1 & 1<=p11]]] | EG [E [[p87<=1 & 1<=p87] U [p76<=1 & 1<=p76]]]]]] U [[EG [[A [[p190<=1 & 1<=p190] U [p133<=1 & 1<=p133]] & E [[p73<=1 & 1<=p73] U [p11<=1 & 1<=p11]]]] & EG [AG [~ [[p123<=1 & 1<=p123]]]]] & [EX [~ [[[[[p40<=1 & 1<=p40] & [p51<=1 & 1<=p51]] & [[p80<=1 & 1<=p80] & [p38<=1 & 1<=p38]]] | [[[p156<=1 & 1<=p156] & [p111<=1 & 1<=p111]] & [[p117<=1 & 1<=p117] & [p132<=1 & 1<=p132]]]]]] & [AG [[p131<=1 & 1<=p131]] | EG [EX [[p72<=1 & 1<=p72]]]]]]]
normalized: E [~ [EX [~ [[[EG [E [[p87<=1 & 1<=p87] U [p76<=1 & 1<=p76]]] | EX [~ [[p11<=1 & 1<=p11]]]] | E [true U ~ [[[[p186<=1 & 1<=p186] & [p139<=1 & 1<=p139]] & [p121<=1 & 1<=p121]]]]]]]] U [[[EG [EX [[p72<=1 & 1<=p72]]] | ~ [E [true U ~ [[p131<=1 & 1<=p131]]]]] & EX [~ [[[[[p132<=1 & 1<=p132] & [p117<=1 & 1<=p117]] & [[p111<=1 & 1<=p111] & [p156<=1 & 1<=p156]]] | [[[p38<=1 & 1<=p38] & [p80<=1 & 1<=p80]] & [[p51<=1 & 1<=p51] & [p40<=1 & 1<=p40]]]]]]] & [EG [~ [E [true U [p123<=1 & 1<=p123]]]] & EG [[E [[p73<=1 & 1<=p73] U [p11<=1 & 1<=p11]] & [~ [EG [~ [[p133<=1 & 1<=p133]]]] & ~ [E [~ [[p133<=1 & 1<=p133]] U [~ [[p190<=1 & 1<=p190]] & ~ [[p133<=1 & 1<=p133]]]]]]]]]]]

abstracting: (1<=p133)
states: 9,367,875,585 (9)
abstracting: (p133<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p190)
states: 632,952,180 (8)
abstracting: (p190<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p133)
states: 9,367,875,585 (9)
abstracting: (p133<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p133)
states: 9,367,875,585 (9)
abstracting: (p133<=1)
states: 3,838,881,456,935,226 (15)
MC time: 1m54.303sec

checking: AG [[EF [EX [[[p141<=1 & 1<=p141] | A [[p129<=1 & 1<=p129] U [[p40<=1 & 1<=p40] & [[p51<=1 & 1<=p51] & [p80<=1 & 1<=p80]]]]]]] | [[EX [AX [[p0<=1 & 1<=p0]]] & EG [[[p129<=0 & 0<=p129] & [[p72<=1 & 1<=p72] | [p176<=1 & 1<=p176]]]]] & [[E [~ [[p167<=1 & 1<=p167]] U [p86<=1 & 1<=p86]] | AG [[[p84<=1 & 1<=p84] | [p179<=1 & 1<=p179]]]] & [AG [[p165<=1 & 1<=p165]] | [[AF [[p110<=1 & 1<=p110]] & [AG [[p33<=1 & 1<=p33]] | A [[p187<=1 & 1<=p187] U [[p6<=1 & 1<=p6] & [[p20<=1 & 1<=p20] & [p51<=1 & 1<=p51]]]]]] | [A [[p96<=1 & 1<=p96] U [p67<=1 & 1<=p67]] & [[p14<=1 & 1<=p14] & [p75<=1 & 1<=p75]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p75<=1 & 1<=p75] & [p14<=1 & 1<=p14]] & [~ [EG [~ [[p67<=1 & 1<=p67]]]] & ~ [E [~ [[p67<=1 & 1<=p67]] U [~ [[p96<=1 & 1<=p96]] & ~ [[p67<=1 & 1<=p67]]]]]]] | [[[~ [EG [~ [[[[p51<=1 & 1<=p51] & [p20<=1 & 1<=p20]] & [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[[[p51<=1 & 1<=p51] & [p20<=1 & 1<=p20]] & [p6<=1 & 1<=p6]]] U [~ [[p187<=1 & 1<=p187]] & ~ [[[[p51<=1 & 1<=p51] & [p20<=1 & 1<=p20]] & [p6<=1 & 1<=p6]]]]]]] | ~ [E [true U ~ [[p33<=1 & 1<=p33]]]]] & ~ [EG [~ [[p110<=1 & 1<=p110]]]]]] | ~ [E [true U ~ [[p165<=1 & 1<=p165]]]]] & [~ [E [true U ~ [[[p179<=1 & 1<=p179] | [p84<=1 & 1<=p84]]]]] | E [~ [[p167<=1 & 1<=p167]] U [p86<=1 & 1<=p86]]]] & [EG [[[[p176<=1 & 1<=p176] | [p72<=1 & 1<=p72]] & [p129<=0 & 0<=p129]]] & EX [~ [EX [~ [[p0<=1 & 1<=p0]]]]]]] | E [true U EX [[[~ [EG [~ [[[[p80<=1 & 1<=p80] & [p51<=1 & 1<=p51]] & [p40<=1 & 1<=p40]]]]] & ~ [E [~ [[[[p80<=1 & 1<=p80] & [p51<=1 & 1<=p51]] & [p40<=1 & 1<=p40]]] U [~ [[p129<=1 & 1<=p129]] & ~ [[[[p80<=1 & 1<=p80] & [p51<=1 & 1<=p51]] & [p40<=1 & 1<=p40]]]]]]] | [p141<=1 & 1<=p141]]]]]]]]

abstracting: (1<=p141)
states: 461,556,297,195,408 (14)
abstracting: (p141<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p40)
states: 473,227,029,086,608 (14)
abstracting: (p40<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p51)
states: 475,712,629,080,192 (14)
abstracting: (p51<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p80)
states: 509,964,207,882,528 (14)
abstracting: (p80<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p129)
states: 513,494,514,495,216 (14)
abstracting: (p129<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p40)
states: 473,227,029,086,608 (14)
abstracting: (p40<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p51)
states: 475,712,629,080,192 (14)
abstracting: (p51<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p80)
states: 509,964,207,882,528 (14)
abstracting: (p80<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p40)
states: 473,227,029,086,608 (14)
abstracting: (p40<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p51)
states: 475,712,629,080,192 (14)
abstracting: (p51<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p80)
states: 509,964,207,882,528 (14)
abstracting: (p80<=1)
states: 3,838,881,456,935,226 (15)
MC time: 1m45.245sec

checking: [AX [[[1<=p96 & p96<=1] | AX [EG [[p18<=1 & 1<=p18]]]]] | [[A [AF [[p19<=1 & 1<=p19]] U [p64<=1 & 1<=p64]] & [AF [[[[p169<=0 & 0<=p169] & [p113<=0 & 0<=p113]] | [p19<=1 & 1<=p19]]] | EX [[p71<=1 & 1<=p71]]]] | [~ [A [[[EF [[p155<=1 & 1<=p155]] & [[p186<=1 & 1<=p186] & [p43<=1 & 1<=p43]]] | [AF [[p38<=1 & 1<=p38]] | A [EX [[p37<=1 & 1<=p37]] U A [[p90<=1 & 1<=p90] U [p50<=1 & 1<=p50]]]]] U ~ [[[p65<=1 & 1<=p65] & [[p70<=1 & 1<=p70] & [p85<=1 & 1<=p85]]]]]] & [[~ [E [~ [EX [[[p158<=1 & 1<=p158] & [[p162<=1 & 1<=p162] & [p177<=1 & 1<=p177]]]]] U [[p49<=1 & 1<=p49] | E [[p81<=1 & 1<=p81] U [p168<=1 & 1<=p168]]]]] & EG [[[p166<=0 & 0<=p166] | [p184<=0 & 0<=p184]]]] | [~ [A [[E [[p171<=1 & 1<=p171] U [p45<=1 & 1<=p45]] | EF [[p94<=1 & 1<=p94]]] U AF [[p86<=1 & 1<=p86]]]] & EF [AX [[p86<=0 & 0<=p86]]]]]]]]
normalized: [[[[[E [true U ~ [EX [~ [[p86<=0 & 0<=p86]]]]] & ~ [[~ [EG [EG [~ [[p86<=1 & 1<=p86]]]]] & ~ [E [EG [~ [[p86<=1 & 1<=p86]]] U [~ [[E [true U [p94<=1 & 1<=p94]] | E [[p171<=1 & 1<=p171] U [p45<=1 & 1<=p45]]]] & EG [~ [[p86<=1 & 1<=p86]]]]]]]]] | [EG [[[p184<=0 & 0<=p184] | [p166<=0 & 0<=p166]]] & ~ [E [~ [EX [[[[p177<=1 & 1<=p177] & [p162<=1 & 1<=p162]] & [p158<=1 & 1<=p158]]]] U [E [[p81<=1 & 1<=p81] U [p168<=1 & 1<=p168]] | [p49<=1 & 1<=p49]]]]]] & ~ [[~ [EG [[[[p85<=1 & 1<=p85] & [p70<=1 & 1<=p70]] & [p65<=1 & 1<=p65]]]] & ~ [E [[[[p85<=1 & 1<=p85] & [p70<=1 & 1<=p70]] & [p65<=1 & 1<=p65]] U [~ [[[[~ [EG [~ [[~ [EG [~ [[p50<=1 & 1<=p50]]]] & ~ [E [~ [[p50<=1 & 1<=p50]] U [~ [[p90<=1 & 1<=p90]] & ~ [[p50<=1 & 1<=p50]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p50<=1 & 1<=p50]]]] & ~ [E [~ [[p50<=1 & 1<=p50]] U [~ [[p90<=1 & 1<=p90]] & ~ [[p50<=1 & 1<=p50]]]]]]] U [~ [EX [[p37<=1 & 1<=p37]]] & ~ [[~ [EG [~ [[p50<=1 & 1<=p50]]]] & ~ [E [~ [[p50<=1 & 1<=p50]] U [~ [[p90<=1 & 1<=p90]] & ~ [[p50<=1 & 1<=p50]]]]]]]]]]] | ~ [EG [~ [[p38<=1 & 1<=p38]]]]] | [[[p43<=1 & 1<=p43] & [p186<=1 & 1<=p186]] & E [true U [p155<=1 & 1<=p155]]]]] & [[[p85<=1 & 1<=p85] & [p70<=1 & 1<=p70]] & [p65<=1 & 1<=p65]]]]]]]] | [[EX [[p71<=1 & 1<=p71]] | ~ [EG [~ [[[p19<=1 & 1<=p19] | [[p113<=0 & 0<=p113] & [p169<=0 & 0<=p169]]]]]]] & [~ [EG [~ [[p64<=1 & 1<=p64]]]] & ~ [E [~ [[p64<=1 & 1<=p64]] U [EG [~ [[p19<=1 & 1<=p19]]] & ~ [[p64<=1 & 1<=p64]]]]]]]] | ~ [EX [~ [[~ [EX [~ [EG [[p18<=1 & 1<=p18]]]]] | [1<=p96 & p96<=1]]]]]]

abstracting: (p96<=1)
states: 3,838,881,456,935,226 (15)
abstracting: (1<=p96)
states: 421,582,383,705,312 (14)
abstracting: (1<=p18)
states: 396,491,100,808,000 (14)
abstracting: (p18<=1)
states: 3,838,881,456,935,226 (15)
......
before gc: list nodes free: 11629712

after gc: idd nodes used:7858432, unused:56141568; list nodes free:259913139
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 5976516 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16103236 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:95537 (500), effective:15357 (80)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 223 sec


iterations count:3066 (16), effective:254 (1)

net_ddint.h:600: Timeout: after 209 sec


iterations count:199 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 205 sec


iterations count:5899 (30), effective:612 (3)

net_ddint.h:600: Timeout: after 203 sec


iterations count:211 (1), effective:1 (0)

iterations count:8477 (44), effective:798 (4)

sat_reach.icc:155: Timeout: after 189 sec


iterations count:11702 (61), effective:1153 (6)

iterations count:193 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 175 sec


sat_reach.icc:155: Timeout: after 163 sec


net_ddint.h:600: Timeout: after 151 sec


net_ddint.h:600: Timeout: after 140 sec


iterations count:194 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 130 sec


iterations count:5734 (30), effective:583 (3)

net_ddint.h:600: Timeout: after 120 sec


iterations count:319 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 112 sec


iterations count:193 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 104 sec


ctl_mc.icc:221: Timeout: after 96 sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-004B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVt-PT-004B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978700234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-004B.tgz
mv ShieldRVt-PT-004B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;