Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863540800362.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ParamProductionCell-PT-0, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540800362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K 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 ParamProductionCell-PT-0-CTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679039202574

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=ParamProductionCell-PT-0
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 07:46:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 07:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:46:46] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-17 07:46:46] [INFO ] Transformed 198 places.
[2023-03-17 07:46:46] [INFO ] Transformed 176 transitions.
[2023-03-17 07:46:46] [INFO ] Found NUPN structural information;
[2023-03-17 07:46:46] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 114 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 194 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 194 transition count 172
Applied a total of 8 rules in 52 ms. Remains 194 /198 variables (removed 4) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 194 cols
[2023-03-17 07:46:46] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-17 07:46:47] [INFO ] Implicit Places using invariants in 555 ms returned [15, 16, 35, 36, 46, 73, 79, 120, 167]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 619 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 172/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 185 /185 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 683 ms. Remains : 185/198 places, 172/176 transitions.
Support contains 114 out of 185 places after structural reductions.
[2023-03-17 07:46:47] [INFO ] Flatten gal took : 86 ms
[2023-03-17 07:46:47] [INFO ] Flatten gal took : 35 ms
[2023-03-17 07:46:48] [INFO ] Input system was already deterministic with 172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1003 ms. (steps per millisecond=9 ) properties (out of 69) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 172 rows 185 cols
[2023-03-17 07:46:49] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-17 07:46:50] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2023-03-17 07:46:50] [INFO ] [Real]Absence check using 27 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-17 07:46:50] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-17 07:46:50] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2023-03-17 07:46:50] [INFO ] [Nat]Absence check using 27 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-17 07:46:50] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-0-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 18 ms
[2023-03-17 07:46:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ParamProductionCell-PT-0-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 17 ms
[2023-03-17 07:46:50] [INFO ] Input system was already deterministic with 172 transitions.
Support contains 85 out of 185 places (down from 91) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 169
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 6 place count 182 transition count 154
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 167 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 165 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 165 transition count 152
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 78 place count 145 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 78 place count 145 transition count 133
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 144 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 142 transition count 132
Applied a total of 83 rules in 115 ms. Remains 142 /185 variables (removed 43) and now considering 132/172 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 142/185 places, 132/172 transitions.
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 18 ms
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 22 ms
[2023-03-17 07:46:50] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 169
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 6 place count 182 transition count 154
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 167 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 165 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 165 transition count 152
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 144 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 143 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 141 transition count 131
Applied a total of 85 rules in 67 ms. Remains 141 /185 variables (removed 44) and now considering 131/172 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 141/185 places, 131/172 transitions.
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 18 ms
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 20 ms
[2023-03-17 07:46:50] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 169
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 6 place count 182 transition count 154
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 167 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 165 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 165 transition count 152
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 144 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 143 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 141 transition count 131
Applied a total of 85 rules in 72 ms. Remains 141 /185 variables (removed 44) and now considering 131/172 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 141/185 places, 131/172 transitions.
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 17 ms
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 21 ms
[2023-03-17 07:46:50] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 169
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 6 place count 182 transition count 154
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 167 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 165 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 165 transition count 152
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 144 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 143 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 141 transition count 131
Applied a total of 85 rules in 36 ms. Remains 141 /185 variables (removed 44) and now considering 131/172 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 141/185 places, 131/172 transitions.
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:50] [INFO ] Input system was already deterministic with 131 transitions.
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
FORMULA ParamProductionCell-PT-0-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 170
Applied a total of 4 rules in 7 ms. Remains 183 /185 variables (removed 2) and now considering 170/172 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 183/185 places, 170/172 transitions.
[2023-03-17 07:46:50] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 170
Applied a total of 4 rules in 6 ms. Remains 183 /185 variables (removed 2) and now considering 170/172 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 183/185 places, 170/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 184 transition count 171
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 2 place count 184 transition count 156
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 32 place count 169 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 168 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 168 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 66 place count 151 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 151 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 150 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 148 transition count 138
Applied a total of 71 rules in 32 ms. Remains 148 /185 variables (removed 37) and now considering 138/172 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 148/185 places, 138/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 20 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 170
Applied a total of 4 rules in 7 ms. Remains 183 /185 variables (removed 2) and now considering 170/172 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 183/185 places, 170/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 170
Applied a total of 4 rules in 7 ms. Remains 183 /185 variables (removed 2) and now considering 170/172 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 183/185 places, 170/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 170
Applied a total of 4 rules in 6 ms. Remains 183 /185 variables (removed 2) and now considering 170/172 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 183/185 places, 170/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 18 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 171
Applied a total of 2 rules in 6 ms. Remains 184 /185 variables (removed 1) and now considering 171/172 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/185 places, 171/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 169
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 6 place count 182 transition count 154
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 167 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 165 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 165 transition count 152
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 144 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 143 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 141 transition count 131
Applied a total of 85 rules in 30 ms. Remains 141 /185 variables (removed 44) and now considering 131/172 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 141/185 places, 131/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 170
Applied a total of 4 rules in 7 ms. Remains 183 /185 variables (removed 2) and now considering 170/172 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 183/185 places, 170/172 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Input system was already deterministic with 170 transitions.
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:46:51] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-17 07:46:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 172 transitions and 688 arcs took 1 ms.
Total runtime 5257 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: 185 NrTr: 172 NrArc: 688)

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

net check time: 0m 0.000sec

init dd package: 0m 3.387sec


RS generation: 0m 3.413sec


-> reachability set: #nodes 37665 (3.8e+04) #states 2,759,432 (6)



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

checking: AF [[[p29<=1 & 1<=p29] & [p31<=1 & 1<=p31]]]
normalized: ~ [EG [~ [[[p29<=1 & 1<=p29] & [p31<=1 & 1<=p31]]]]]

abstracting: (1<=p31)
states: 119,656 (5)
abstracting: (p31<=1)
states: 2,759,432 (6)
abstracting: (1<=p29)
states: 358,968 (5)
abstracting: (p29<=1)
states: 2,759,432 (6)
.....................................................................................................................................................................................................................................................................................
EG iterations: 277
-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.092sec

checking: EF [EG [A [~ [[1<=p164 & p164<=1]] U EF [[[p89<=1 & 1<=p89] & [p118<=1 & 1<=p118]]]]]]
normalized: E [true U EG [[~ [EG [~ [E [true U [[p118<=1 & 1<=p118] & [p89<=1 & 1<=p89]]]]]] & ~ [E [~ [E [true U [[p118<=1 & 1<=p118] & [p89<=1 & 1<=p89]]]] U [~ [E [true U [[p118<=1 & 1<=p118] & [p89<=1 & 1<=p89]]]] & [1<=p164 & p164<=1]]]]]]]

abstracting: (p164<=1)
states: 2,759,432 (6)
abstracting: (1<=p164)
states: 13,968 (4)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p118)
states: 26,928 (4)
abstracting: (p118<=1)
states: 2,759,432 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p118)
states: 26,928 (4)
abstracting: (p118<=1)
states: 2,759,432 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p118)
states: 26,928 (4)
abstracting: (p118<=1)
states: 2,759,432 (6)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.356sec

checking: [EX [EX [0<=0]] & EX [AG [AF [[[p30<=0 & 0<=p30] & [[p97<=0 & 0<=p97] | [p170<=0 & 0<=p170]]]]]]]
normalized: [EX [~ [E [true U EG [~ [[[[p170<=0 & 0<=p170] | [p97<=0 & 0<=p97]] & [p30<=0 & 0<=p30]]]]]]] & EX [EX [0<=0]]]

abstracting: (0<=0)
states: 2,759,432 (6)
..abstracting: (0<=p30)
states: 2,759,432 (6)
abstracting: (p30<=0)
states: 2,639,776 (6)
abstracting: (0<=p97)
states: 2,759,432 (6)
abstracting: (p97<=0)
states: 2,177,064 (6)
abstracting: (0<=p170)
states: 2,759,432 (6)
abstracting: (p170<=0)
states: 2,731,496 (6)
...............................................................................................................................................
EG iterations: 143
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.257sec

checking: AF [[AX [[[[p90<=1 & 1<=p90] & [p150<=1 & 1<=p150]] | EX [AF [[p30<=1 & 1<=p30]]]]] & EG [AG [[[p92<=0 & 0<=p92] | [p146<=0 & 0<=p146]]]]]]
normalized: ~ [EG [~ [[EG [~ [E [true U ~ [[[p146<=0 & 0<=p146] | [p92<=0 & 0<=p92]]]]]] & ~ [EX [~ [[EX [~ [EG [~ [[p30<=1 & 1<=p30]]]]] | [[p150<=1 & 1<=p150] & [p90<=1 & 1<=p90]]]]]]]]]]

abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p150)
states: 10,336 (4)
abstracting: (p150<=1)
states: 2,759,432 (6)
abstracting: (1<=p30)
states: 119,656 (5)
abstracting: (p30<=1)
states: 2,759,432 (6)
.....................................................................................................................................................................................................................................................................................
EG iterations: 277
..abstracting: (0<=p92)
states: 2,759,432 (6)
abstracting: (p92<=0)
states: 295,288 (5)
abstracting: (0<=p146)
states: 2,759,432 (6)
abstracting: (p146<=0)
states: 2,754,264 (6)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.479sec

checking: AG [[AF [E [AF [[[p90<=1 & 1<=p90] & [p148<=1 & 1<=p148]]] U ~ [[[p89<=1 & 1<=p89] & [p165<=1 & 1<=p165]]]]] & [[p106<=0 & 0<=p106] | [[p107<=0 & 0<=p107] | [p132<=0 & 0<=p132]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [~ [EG [~ [[[p148<=1 & 1<=p148] & [p90<=1 & 1<=p90]]]]] U ~ [[[p165<=1 & 1<=p165] & [p89<=1 & 1<=p89]]]]]]] & [[[p132<=0 & 0<=p132] | [p107<=0 & 0<=p107]] | [p106<=0 & 0<=p106]]]]]]

abstracting: (0<=p106)
states: 2,759,432 (6)
abstracting: (p106<=0)
states: 213,760 (5)
abstracting: (0<=p107)
states: 2,759,432 (6)
abstracting: (p107<=0)
states: 2,631,176 (6)
abstracting: (0<=p132)
states: 2,759,432 (6)
abstracting: (p132<=0)
states: 2,732,504 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p165)
states: 27,936 (4)
abstracting: (p165<=1)
states: 2,759,432 (6)
abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p148)
states: 13,216 (4)
abstracting: (p148<=1)
states: 2,759,432 (6)
.....................................
EG iterations: 37
..........................................................
EG iterations: 58
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.500sec

checking: EF [[AG [[[p22<=0 & 0<=p22] | [[p23<=0 & 0<=p23] | [p27<=0 & 0<=p27]]]] & AF [[[[p110<=1 & 1<=p110] & [p115<=1 & 1<=p115]] | AG [[[p152<=1 & 1<=p152] & [[p153<=1 & 1<=p153] & [p160<=1 & 1<=p160]]]]]]]]
normalized: E [true U [~ [EG [~ [[~ [E [true U ~ [[[p152<=1 & 1<=p152] & [[p160<=1 & 1<=p160] & [p153<=1 & 1<=p153]]]]]] | [[p115<=1 & 1<=p115] & [p110<=1 & 1<=p110]]]]]] & ~ [E [true U ~ [[[[p27<=0 & 0<=p27] | [p23<=0 & 0<=p23]] | [p22<=0 & 0<=p22]]]]]]]

abstracting: (0<=p22)
states: 2,759,432 (6)
abstracting: (p22<=0)
states: 2,408,840 (6)
abstracting: (0<=p23)
states: 2,759,432 (6)
abstracting: (p23<=0)
states: 1,601,580 (6)
abstracting: (0<=p27)
states: 2,759,432 (6)
abstracting: (p27<=0)
states: 2,525,704 (6)
abstracting: (1<=p110)
states: 128,256 (5)
abstracting: (p110<=1)
states: 2,759,432 (6)
abstracting: (1<=p115)
states: 29,288 (4)
abstracting: (p115<=1)
states: 2,759,432 (6)
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p160)
states: 21,280 (4)
abstracting: (p160<=1)
states: 2,759,432 (6)
abstracting: (1<=p152)
states: 2,636,392 (6)
abstracting: (p152<=1)
states: 2,759,432 (6)
............................................................................................................................................................................................................................................................................................................................
EG iterations: 316
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.527sec

checking: EF [AG [[[[EX [[[p97<=1 & 1<=p97] & [p170<=1 & 1<=p170]]] & [p29<=1 & 1<=p29]] & [[p31<=1 & 1<=p31] & [p33<=1 & 1<=p33]]] | [[[p6<=0 & 0<=p6] | [p135<=0 & 0<=p135]] & [[p16<=0 & 0<=p16] | [p28<=0 & 0<=p28]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[p28<=0 & 0<=p28] | [p16<=0 & 0<=p16]] & [[p135<=0 & 0<=p135] | [p6<=0 & 0<=p6]]] | [[[p33<=1 & 1<=p33] & [p31<=1 & 1<=p31]] & [[p29<=1 & 1<=p29] & EX [[[p170<=1 & 1<=p170] & [p97<=1 & 1<=p97]]]]]]]]]]

abstracting: (1<=p97)
states: 582,368 (5)
abstracting: (p97<=1)
states: 2,759,432 (6)
abstracting: (1<=p170)
states: 27,936 (4)
abstracting: (p170<=1)
states: 2,759,432 (6)
.abstracting: (1<=p29)
states: 358,968 (5)
abstracting: (p29<=1)
states: 2,759,432 (6)
abstracting: (1<=p31)
states: 119,656 (5)
abstracting: (p31<=1)
states: 2,759,432 (6)
abstracting: (1<=p33)
states: 105,248 (5)
abstracting: (p33<=1)
states: 2,759,432 (6)
abstracting: (0<=p6)
states: 2,759,432 (6)
abstracting: (p6<=0)
states: 2,654,184 (6)
abstracting: (0<=p135)
states: 2,759,432 (6)
abstracting: (p135<=0)
states: 1,922,516 (6)
abstracting: (0<=p16)
states: 2,759,432 (6)
abstracting: (p16<=0)
states: 1,060,152 (6)
abstracting: (0<=p28)
states: 2,759,432 (6)
abstracting: (p28<=0)
states: 2,639,776 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.711sec

checking: A [~ [[AF [[AG [[[p72<=1 & 1<=p72] & [p76<=1 & 1<=p76]]] & [[p14<=1 & 1<=p14] & [p81<=1 & 1<=p81]]]] | EG [~ [A [[[p92<=1 & 1<=p92] & [p95<=1 & 1<=p95]] U [[p152<=1 & 1<=p152] & [[p153<=1 & 1<=p153] & [p160<=1 & 1<=p160]]]]]]]] U [[p94<=1 & 1<=p94] & [p123<=1 & 1<=p123]]]
normalized: [~ [EG [~ [[[p123<=1 & 1<=p123] & [p94<=1 & 1<=p94]]]]] & ~ [E [~ [[[p123<=1 & 1<=p123] & [p94<=1 & 1<=p94]]] U [[EG [~ [[~ [EG [~ [[[[p160<=1 & 1<=p160] & [p153<=1 & 1<=p153]] & [p152<=1 & 1<=p152]]]]] & ~ [E [~ [[[[p160<=1 & 1<=p160] & [p153<=1 & 1<=p153]] & [p152<=1 & 1<=p152]]] U [~ [[[p95<=1 & 1<=p95] & [p92<=1 & 1<=p92]]] & ~ [[[[p160<=1 & 1<=p160] & [p153<=1 & 1<=p153]] & [p152<=1 & 1<=p152]]]]]]]]] | ~ [EG [~ [[[[p81<=1 & 1<=p81] & [p14<=1 & 1<=p14]] & ~ [E [true U ~ [[[p76<=1 & 1<=p76] & [p72<=1 & 1<=p72]]]]]]]]]] & ~ [[[p123<=1 & 1<=p123] & [p94<=1 & 1<=p94]]]]]]]

abstracting: (1<=p94)
states: 158,816 (5)
abstracting: (p94<=1)
states: 2,759,432 (6)
abstracting: (1<=p123)
states: 6,596 (3)
abstracting: (p123<=1)
states: 2,759,432 (6)
abstracting: (1<=p72)
states: 157,872 (5)
abstracting: (p72<=1)
states: 2,759,432 (6)
abstracting: (1<=p76)
states: 26,312 (4)
abstracting: (p76<=1)
states: 2,759,432 (6)
abstracting: (1<=p14)
states: 813,960 (5)
abstracting: (p14<=1)
states: 2,759,432 (6)
abstracting: (1<=p81)
states: 45,288 (4)
abstracting: (p81<=1)
states: 2,759,432 (6)

EG iterations: 0
abstracting: (1<=p152)
states: 2,636,392 (6)
abstracting: (p152<=1)
states: 2,759,432 (6)
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p160)
states: 21,280 (4)
abstracting: (p160<=1)
states: 2,759,432 (6)
abstracting: (1<=p92)
states: 2,464,144 (6)
abstracting: (p92<=1)
states: 2,759,432 (6)
abstracting: (1<=p95)
states: 8,888 (3)
abstracting: (p95<=1)
states: 2,759,432 (6)
abstracting: (1<=p152)
states: 2,636,392 (6)
abstracting: (p152<=1)
states: 2,759,432 (6)
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p160)
states: 21,280 (4)
abstracting: (p160<=1)
states: 2,759,432 (6)
abstracting: (1<=p152)
states: 2,636,392 (6)
abstracting: (p152<=1)
states: 2,759,432 (6)
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p160)
states: 21,280 (4)
abstracting: (p160<=1)
states: 2,759,432 (6)
..................................................
before gc: list nodes free: 239851

after gc: idd nodes used:223304, unused:63776696; list nodes free:284252149
..............................................................................................................................................................................................................
EG iterations: 256
................................................................................................................................................................................................................................................................
EG iterations: 256
abstracting: (1<=p94)
states: 158,816 (5)
abstracting: (p94<=1)
states: 2,759,432 (6)
abstracting: (1<=p123)
states: 6,596 (3)
abstracting: (p123<=1)
states: 2,759,432 (6)
abstracting: (1<=p94)
states: 158,816 (5)
abstracting: (p94<=1)
states: 2,759,432 (6)
abstracting: (1<=p123)
states: 6,596 (3)
abstracting: (p123<=1)
states: 2,759,432 (6)
.........................................................................................
EG iterations: 89
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.722sec

checking: EF [[AG [[[[[[p33<=0 & 0<=p33] | [[p153<=0 & 0<=p153] | [p159<=0 & 0<=p159]]] | [[p29<=0 & 0<=p29] | [[p31<=0 & 0<=p31] | [p15<=0 & 0<=p15]]]] & [[[p152<=0 & 0<=p152] | [p153<=0 & 0<=p153]] | [[p160<=0 & 0<=p160] | [[p23<=0 & 0<=p23] | [p32<=0 & 0<=p32]]]]] & [[p89<=1 & 1<=p89] & [[p94<=1 & 1<=p94] & [p127<=1 & 1<=p127]]]]] & EX [[[p58<=0 & 0<=p58] | [p67<=0 & 0<=p67]]]]]
normalized: E [true U [EX [[[p67<=0 & 0<=p67] | [p58<=0 & 0<=p58]]] & ~ [E [true U ~ [[[[[p127<=1 & 1<=p127] & [p94<=1 & 1<=p94]] & [p89<=1 & 1<=p89]] & [[[[[p32<=0 & 0<=p32] | [p23<=0 & 0<=p23]] | [p160<=0 & 0<=p160]] | [[p153<=0 & 0<=p153] | [p152<=0 & 0<=p152]]] & [[[[p15<=0 & 0<=p15] | [p31<=0 & 0<=p31]] | [p29<=0 & 0<=p29]] | [[[p159<=0 & 0<=p159] | [p153<=0 & 0<=p153]] | [p33<=0 & 0<=p33]]]]]]]]]]

abstracting: (0<=p33)
states: 2,759,432 (6)
abstracting: (p33<=0)
states: 2,654,184 (6)
abstracting: (0<=p153)
states: 2,759,432 (6)
abstracting: (p153<=0)
states: 2,685,608 (6)
abstracting: (0<=p159)
states: 2,759,432 (6)
abstracting: (p159<=0)
states: 2,748,792 (6)
abstracting: (0<=p29)
states: 2,759,432 (6)
abstracting: (p29<=0)
states: 2,400,464 (6)
abstracting: (0<=p31)
states: 2,759,432 (6)
abstracting: (p31<=0)
states: 2,639,776 (6)
abstracting: (0<=p15)
states: 2,759,432 (6)
abstracting: (p15<=0)
states: 2,642,568 (6)
abstracting: (0<=p152)
states: 2,759,432 (6)
abstracting: (p152<=0)
states: 123,040 (5)
abstracting: (0<=p153)
states: 2,759,432 (6)
abstracting: (p153<=0)
states: 2,685,608 (6)
abstracting: (0<=p160)
states: 2,759,432 (6)
abstracting: (p160<=0)
states: 2,738,152 (6)
abstracting: (0<=p23)
states: 2,759,432 (6)
abstracting: (p23<=0)
states: 1,601,580 (6)
abstracting: (0<=p32)
states: 2,759,432 (6)
abstracting: (p32<=0)
states: 2,520,120 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p94)
states: 158,816 (5)
abstracting: (p94<=1)
states: 2,759,432 (6)
abstracting: (1<=p127)
states: 26,928 (4)
abstracting: (p127<=1)
states: 2,759,432 (6)
abstracting: (0<=p58)
states: 2,759,432 (6)
abstracting: (p58<=0)
states: 519,456 (5)
abstracting: (0<=p67)
states: 2,759,432 (6)
abstracting: (p67<=0)
states: 2,499,704 (6)
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.761sec

checking: E [[AG [[[p105<=1 & 1<=p105] & [[p110<=1 & 1<=p110] & [p116<=1 & 1<=p116]]]] | AX [[[[[p90<=1 & 1<=p90] & [[p91<=1 & 1<=p91] & [p170<=1 & 1<=p170]]] | [[p153<=1 & 1<=p153] & [p177<=1 & 1<=p177]]] | [[[[[p8<=1 & 1<=p8] & [p54<=1 & 1<=p54]] & [[p91<=1 & 1<=p91] & [p99<=1 & 1<=p99]]] & [[[p87<=1 & 1<=p87] & [p98<=1 & 1<=p98]] & [[p90<=1 & 1<=p90] & [p148<=1 & 1<=p148]]]] | [[p18<=1 & 1<=p18] & [p27<=1 & 1<=p27]]]]]] U AX [AF [[[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]]]]]
normalized: E [[~ [EX [~ [[[[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]] | [[[[p148<=1 & 1<=p148] & [p90<=1 & 1<=p90]] & [[p98<=1 & 1<=p98] & [p87<=1 & 1<=p87]]] & [[[p99<=1 & 1<=p99] & [p91<=1 & 1<=p91]] & [[p54<=1 & 1<=p54] & [p8<=1 & 1<=p8]]]]] | [[[p177<=1 & 1<=p177] & [p153<=1 & 1<=p153]] | [[[p170<=1 & 1<=p170] & [p91<=1 & 1<=p91]] & [p90<=1 & 1<=p90]]]]]]] | ~ [E [true U ~ [[[[p116<=1 & 1<=p116] & [p110<=1 & 1<=p110]] & [p105<=1 & 1<=p105]]]]]] U ~ [EX [EG [~ [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 350,592 (5)
abstracting: (p22<=1)
states: 2,759,432 (6)
abstracting: (1<=p26)
states: 116,864 (5)
abstracting: (p26<=1)
states: 2,759,432 (6)
.....................................................................................................................................................................................................................................................................................
EG iterations: 277
.abstracting: (1<=p105)
states: 146,440 (5)
abstracting: (p105<=1)
states: 2,759,432 (6)
abstracting: (1<=p110)
states: 128,256 (5)
abstracting: (p110<=1)
states: 2,759,432 (6)
abstracting: (1<=p116)
states: 58,576 (4)
abstracting: (p116<=1)
states: 2,759,432 (6)
abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p91)
states: 136,472 (5)
abstracting: (p91<=1)
states: 2,759,432 (6)
abstracting: (1<=p170)
states: 27,936 (4)
abstracting: (p170<=1)
states: 2,759,432 (6)
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p177)
states: 13,968 (4)
abstracting: (p177<=1)
states: 2,759,432 (6)
abstracting: (1<=p8)
states: 259,728 (5)
abstracting: (p8<=1)
states: 2,759,432 (6)
abstracting: (1<=p54)
states: 1,071,200 (6)
abstracting: (p54<=1)
states: 2,759,432 (6)
abstracting: (1<=p91)
states: 136,472 (5)
abstracting: (p91<=1)
states: 2,759,432 (6)
abstracting: (1<=p99)
states: 14,744 (4)
abstracting: (p99<=1)
states: 2,759,432 (6)
abstracting: (1<=p87)
states: 35,496 (4)
abstracting: (p87<=1)
states: 2,759,432 (6)
abstracting: (1<=p98)
states: 459,272 (5)
abstracting: (p98<=1)
states: 2,759,432 (6)
abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p148)
states: 13,216 (4)
abstracting: (p148<=1)
states: 2,759,432 (6)
abstracting: (1<=p18)
states: 467,456 (5)
abstracting: (p18<=1)
states: 2,759,432 (6)
abstracting: (1<=p27)
states: 233,728 (5)
abstracting: (p27<=1)
states: 2,759,432 (6)
.-> the formula is TRUE

FORMULA ParamProductionCell-PT-0-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.393sec

checking: EF [[[EX [AX [[[p110<=1 & 1<=p110] & [p115<=1 & 1<=p115]]]] & A [EF [[[p15<=1 & 1<=p15] | [[p98<=1 & 1<=p98] & [p124<=1 & 1<=p124]]]] U EG [[[[p14<=1 & 1<=p14] & [p85<=1 & 1<=p85]] | [[p174<=1 & 1<=p174] & [p178<=1 & 1<=p178]]]]]] & [EF [[[EG [[[p158<=1 & 1<=p158] & [p175<=1 & 1<=p175]]] | [[AG [[[p35<=1 & 1<=p35] & [p44<=1 & 1<=p44]]] & [p153<=1 & 1<=p153]] & [[p177<=1 & 1<=p177] & [p69<=1 & 1<=p69]]]] | [[p35<=0 & 0<=p35] | [[p37<=0 & 0<=p37] | [p53<=0 & 0<=p53]]]]] & [[p2<=1 & 1<=p2] & [p184<=1 & 1<=p184]]]]]
normalized: E [true U [[[[p184<=1 & 1<=p184] & [p2<=1 & 1<=p2]] & E [true U [[[[p53<=0 & 0<=p53] | [p37<=0 & 0<=p37]] | [p35<=0 & 0<=p35]] | [[[[p69<=1 & 1<=p69] & [p177<=1 & 1<=p177]] & [[p153<=1 & 1<=p153] & ~ [E [true U ~ [[[p44<=1 & 1<=p44] & [p35<=1 & 1<=p35]]]]]]] | EG [[[p175<=1 & 1<=p175] & [p158<=1 & 1<=p158]]]]]]] & [[~ [EG [~ [EG [[[[p178<=1 & 1<=p178] & [p174<=1 & 1<=p174]] | [[p85<=1 & 1<=p85] & [p14<=1 & 1<=p14]]]]]]] & ~ [E [~ [EG [[[[p178<=1 & 1<=p178] & [p174<=1 & 1<=p174]] | [[p85<=1 & 1<=p85] & [p14<=1 & 1<=p14]]]]] U [~ [E [true U [[[p124<=1 & 1<=p124] & [p98<=1 & 1<=p98]] | [p15<=1 & 1<=p15]]]] & ~ [EG [[[[p178<=1 & 1<=p178] & [p174<=1 & 1<=p174]] | [[p85<=1 & 1<=p85] & [p14<=1 & 1<=p14]]]]]]]]] & EX [~ [EX [~ [[[p115<=1 & 1<=p115] & [p110<=1 & 1<=p110]]]]]]]]]

abstracting: (1<=p110)
states: 128,256 (5)
abstracting: (p110<=1)
states: 2,759,432 (6)
abstracting: (1<=p115)
states: 29,288 (4)
abstracting: (p115<=1)
states: 2,759,432 (6)
..abstracting: (1<=p14)
states: 813,960 (5)
abstracting: (p14<=1)
states: 2,759,432 (6)
abstracting: (1<=p85)
states: 81,384 (4)
abstracting: (p85<=1)
states: 2,759,432 (6)
abstracting: (1<=p174)
states: 69,840 (4)
abstracting: (p174<=1)
states: 2,759,432 (6)
abstracting: (1<=p178)
states: 27,936 (4)
abstracting: (p178<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59
abstracting: (1<=p15)
states: 116,864 (5)
abstracting: (p15<=1)
states: 2,759,432 (6)
abstracting: (1<=p98)
states: 459,272 (5)
abstracting: (p98<=1)
states: 2,759,432 (6)
abstracting: (1<=p124)
states: 13,192 (4)
abstracting: (p124<=1)
states: 2,759,432 (6)
abstracting: (1<=p14)
states: 813,960 (5)
abstracting: (p14<=1)
states: 2,759,432 (6)
abstracting: (1<=p85)
states: 81,384 (4)
abstracting: (p85<=1)
states: 2,759,432 (6)
abstracting: (1<=p174)
states: 69,840 (4)
abstracting: (p174<=1)
states: 2,759,432 (6)
abstracting: (1<=p178)
states: 27,936 (4)
abstracting: (p178<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59
abstracting: (1<=p14)
states: 813,960 (5)
abstracting: (p14<=1)
states: 2,759,432 (6)
abstracting: (1<=p85)
states: 81,384 (4)
abstracting: (p85<=1)
states: 2,759,432 (6)
abstracting: (1<=p174)
states: 69,840 (4)
abstracting: (p174<=1)
states: 2,759,432 (6)
abstracting: (1<=p178)
states: 27,936 (4)
abstracting: (p178<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59

EG iterations: 0
abstracting: (1<=p158)
states: 1,538,464 (6)
abstracting: (p158<=1)
states: 2,759,432 (6)
abstracting: (1<=p175)
states: 13,968 (4)
abstracting: (p175<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59
abstracting: (1<=p35)
states: 1,394,536 (6)
abstracting: (p35<=1)
states: 2,759,432 (6)
abstracting: (1<=p44)
states: 210,496 (5)
abstracting: (p44<=1)
states: 2,759,432 (6)
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p177)
states: 13,968 (4)
abstracting: (p177<=1)
states: 2,759,432 (6)
abstracting: (1<=p69)
states: 630,656 (5)
abstracting: (p69<=1)
states: 2,759,432 (6)
abstracting: (0<=p35)
states: 2,759,432 (6)
abstracting: (p35<=0)
states: 1,364,896 (6)
abstracting: (0<=p37)
states: 2,759,432 (6)
abstracting: (p37<=0)
states: 2,127,944 (6)
abstracting: (0<=p53)
states: 2,759,432 (6)
abstracting: (p53<=0)
states: 2,548,936 (6)
abstracting: (1<=p2)
states: 630,656 (5)
abstracting: (p2<=1)
states: 2,759,432 (6)
abstracting: (1<=p184)
states: 1,379,716 (6)
abstracting: (p184<=1)
states: 2,759,432 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.663sec

checking: [AG [[[[EF [[[p59<=0 & 0<=p59] | [p64<=0 & 0<=p64]]] & EX [[[p37<=0 & 0<=p37] | [p52<=0 & 0<=p52]]]] & [[p108<=1 & 1<=p108] & [p111<=1 & 1<=p111]]] | [[p83<=0 & 0<=p83] | E [[[p34<=1 & 1<=p34] & [p38<=1 & 1<=p38]] U [[p10<=1 & 1<=p10] & [p68<=1 & 1<=p68]]]]]] | [AG [[AF [[[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]]] & [[p92<=1 & 1<=p92] & [p146<=1 & 1<=p146]]]] & A [[[p92<=1 & 1<=p92] & [p167<=1 & 1<=p167]] U [[[EF [~ [[[p89<=1 & 1<=p89] & [p165<=1 & 1<=p165]]]] | E [[[p112<=1 & 1<=p112] & [p129<=1 & 1<=p129]] U [p119<=1 & 1<=p119]]] | [[[p108<=1 & 1<=p108] & [p130<=1 & 1<=p130]] | [[p87<=1 & 1<=p87] & [p90<=1 & 1<=p90]]]] & ~ [[EG [[[p22<=1 & 1<=p22] & [[p23<=1 & 1<=p23] & [p27<=1 & 1<=p27]]]] & [EG [[[p153<=1 & 1<=p153] & [p177<=1 & 1<=p177]]] & [EX [[p15<=1 & 1<=p15]] | ~ [[[p90<=1 & 1<=p90] & [[p91<=1 & 1<=p91] & [p170<=1 & 1<=p170]]]]]]]]]]]]
normalized: [[[~ [EG [~ [[~ [[[[~ [[[[p170<=1 & 1<=p170] & [p91<=1 & 1<=p91]] & [p90<=1 & 1<=p90]]] | EX [[p15<=1 & 1<=p15]]] & EG [[[p177<=1 & 1<=p177] & [p153<=1 & 1<=p153]]]] & EG [[[[p27<=1 & 1<=p27] & [p23<=1 & 1<=p23]] & [p22<=1 & 1<=p22]]]]] & [[[[p90<=1 & 1<=p90] & [p87<=1 & 1<=p87]] | [[p130<=1 & 1<=p130] & [p108<=1 & 1<=p108]]] | [E [[[p129<=1 & 1<=p129] & [p112<=1 & 1<=p112]] U [p119<=1 & 1<=p119]] | E [true U ~ [[[p165<=1 & 1<=p165] & [p89<=1 & 1<=p89]]]]]]]]]] & ~ [E [~ [[~ [[[[~ [[[[p170<=1 & 1<=p170] & [p91<=1 & 1<=p91]] & [p90<=1 & 1<=p90]]] | EX [[p15<=1 & 1<=p15]]] & EG [[[p177<=1 & 1<=p177] & [p153<=1 & 1<=p153]]]] & EG [[[[p27<=1 & 1<=p27] & [p23<=1 & 1<=p23]] & [p22<=1 & 1<=p22]]]]] & [[[[p90<=1 & 1<=p90] & [p87<=1 & 1<=p87]] | [[p130<=1 & 1<=p130] & [p108<=1 & 1<=p108]]] | [E [[[p129<=1 & 1<=p129] & [p112<=1 & 1<=p112]] U [p119<=1 & 1<=p119]] | E [true U ~ [[[p165<=1 & 1<=p165] & [p89<=1 & 1<=p89]]]]]]]] U [~ [[[p167<=1 & 1<=p167] & [p92<=1 & 1<=p92]]] & ~ [[~ [[[[~ [[[[p170<=1 & 1<=p170] & [p91<=1 & 1<=p91]] & [p90<=1 & 1<=p90]]] | EX [[p15<=1 & 1<=p15]]] & EG [[[p177<=1 & 1<=p177] & [p153<=1 & 1<=p153]]]] & EG [[[[p27<=1 & 1<=p27] & [p23<=1 & 1<=p23]] & [p22<=1 & 1<=p22]]]]] & [[[[p90<=1 & 1<=p90] & [p87<=1 & 1<=p87]] | [[p130<=1 & 1<=p130] & [p108<=1 & 1<=p108]]] | [E [[[p129<=1 & 1<=p129] & [p112<=1 & 1<=p112]] U [p119<=1 & 1<=p119]] | E [true U ~ [[[p165<=1 & 1<=p165] & [p89<=1 & 1<=p89]]]]]]]]]]]] & ~ [E [true U ~ [[[[p146<=1 & 1<=p146] & [p92<=1 & 1<=p92]] & ~ [EG [~ [[[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]]]]]]] | ~ [E [true U ~ [[[E [[[p38<=1 & 1<=p38] & [p34<=1 & 1<=p34]] U [[p68<=1 & 1<=p68] & [p10<=1 & 1<=p10]]] | [p83<=0 & 0<=p83]] | [[[p111<=1 & 1<=p111] & [p108<=1 & 1<=p108]] & [EX [[[p52<=0 & 0<=p52] | [p37<=0 & 0<=p37]]] & E [true U [[p64<=0 & 0<=p64] | [p59<=0 & 0<=p59]]]]]]]]]]

abstracting: (0<=p59)
states: 2,759,432 (6)
abstracting: (p59<=0)
states: 1,980,248 (6)
abstracting: (0<=p64)
states: 2,759,432 (6)
abstracting: (p64<=0)
states: 2,629,568 (6)
abstracting: (0<=p37)
states: 2,759,432 (6)
abstracting: (p37<=0)
states: 2,127,944 (6)
abstracting: (0<=p52)
states: 2,759,432 (6)
abstracting: (p52<=0)
states: 2,654,184 (6)
.abstracting: (1<=p108)
states: 2,502,920 (6)
abstracting: (p108<=1)
states: 2,759,432 (6)
abstracting: (1<=p111)
states: 29,288 (4)
abstracting: (p111<=1)
states: 2,759,432 (6)
abstracting: (0<=p83)
states: 2,759,432 (6)
abstracting: (p83<=0)
states: 2,510,484 (6)
abstracting: (1<=p10)
states: 105,248 (5)
abstracting: (p10<=1)
states: 2,759,432 (6)
abstracting: (1<=p68)
states: 630,656 (5)
abstracting: (p68<=1)
states: 2,759,432 (6)
abstracting: (1<=p34)
states: 105,248 (5)
abstracting: (p34<=1)
states: 2,759,432 (6)
abstracting: (1<=p38)
states: 2,127,944 (6)
abstracting: (p38<=1)
states: 2,759,432 (6)
abstracting: (1<=p17)
states: 350,592 (5)
abstracting: (p17<=1)
states: 2,759,432 (6)
abstracting: (1<=p24)
states: 116,864 (5)
abstracting: (p24<=1)
states: 2,759,432 (6)
.....................................................................................................................................................................................................................................................................................
EG iterations: 277
abstracting: (1<=p92)
states: 2,464,144 (6)
abstracting: (p92<=1)
states: 2,759,432 (6)
abstracting: (1<=p146)
states: 5,168 (3)
abstracting: (p146<=1)
states: 2,759,432 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p165)
states: 27,936 (4)
abstracting: (p165<=1)
states: 2,759,432 (6)
abstracting: (1<=p119)
states: 13,464 (4)
abstracting: (p119<=1)
states: 2,759,432 (6)
abstracting: (1<=p112)
states: 1,494,200 (6)
abstracting: (p112<=1)
states: 2,759,432 (6)
abstracting: (1<=p129)
states: 13,464 (4)
abstracting: (p129<=1)
states: 2,759,432 (6)
abstracting: (1<=p108)
states: 2,502,920 (6)
abstracting: (p108<=1)
states: 2,759,432 (6)
abstracting: (1<=p130)
states: 13,464 (4)
abstracting: (p130<=1)
states: 2,759,432 (6)
abstracting: (1<=p87)
states: 35,496 (4)
abstracting: (p87<=1)
states: 2,759,432 (6)
abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p22)
states: 350,592 (5)
abstracting: (p22<=1)
states: 2,759,432 (6)
abstracting: (1<=p23)
states: 1,157,852 (6)
abstracting: (p23<=1)
states: 2,759,432 (6)
abstracting: (1<=p27)
states: 233,728 (5)
abstracting: (p27<=1)
states: 2,759,432 (6)
...............................................................................................................................................
EG iterations: 143
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p177)
states: 13,968 (4)
abstracting: (p177<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59
abstracting: (1<=p15)
states: 116,864 (5)
abstracting: (p15<=1)
states: 2,759,432 (6)
.abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p91)
states: 136,472 (5)
abstracting: (p91<=1)
states: 2,759,432 (6)
abstracting: (1<=p170)
states: 27,936 (4)
abstracting: (p170<=1)
states: 2,759,432 (6)
abstracting: (1<=p92)
states: 2,464,144 (6)
abstracting: (p92<=1)
states: 2,759,432 (6)
abstracting: (1<=p167)
states: 7,372 (3)
abstracting: (p167<=1)
states: 2,759,432 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p165)
states: 27,936 (4)
abstracting: (p165<=1)
states: 2,759,432 (6)
abstracting: (1<=p119)
states: 13,464 (4)
abstracting: (p119<=1)
states: 2,759,432 (6)
abstracting: (1<=p112)
states: 1,494,200 (6)
abstracting: (p112<=1)
states: 2,759,432 (6)
abstracting: (1<=p129)
states: 13,464 (4)
abstracting: (p129<=1)
states: 2,759,432 (6)
abstracting: (1<=p108)
states: 2,502,920 (6)
abstracting: (p108<=1)
states: 2,759,432 (6)
abstracting: (1<=p130)
states: 13,464 (4)
abstracting: (p130<=1)
states: 2,759,432 (6)
abstracting: (1<=p87)
states: 35,496 (4)
abstracting: (p87<=1)
states: 2,759,432 (6)
abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p22)
states: 350,592 (5)
abstracting: (p22<=1)
states: 2,759,432 (6)
abstracting: (1<=p23)
states: 1,157,852 (6)
abstracting: (p23<=1)
states: 2,759,432 (6)
abstracting: (1<=p27)
states: 233,728 (5)
abstracting: (p27<=1)
states: 2,759,432 (6)
...............................................................................................................................................
EG iterations: 143
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p177)
states: 13,968 (4)
abstracting: (p177<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59
abstracting: (1<=p15)
states: 116,864 (5)
abstracting: (p15<=1)
states: 2,759,432 (6)
.abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p91)
states: 136,472 (5)
abstracting: (p91<=1)
states: 2,759,432 (6)
abstracting: (1<=p170)
states: 27,936 (4)
abstracting: (p170<=1)
states: 2,759,432 (6)
abstracting: (1<=p89)
states: 950,916 (5)
abstracting: (p89<=1)
states: 2,759,432 (6)
abstracting: (1<=p165)
states: 27,936 (4)
abstracting: (p165<=1)
states: 2,759,432 (6)
abstracting: (1<=p119)
states: 13,464 (4)
abstracting: (p119<=1)
states: 2,759,432 (6)
abstracting: (1<=p112)
states: 1,494,200 (6)
abstracting: (p112<=1)
states: 2,759,432 (6)
abstracting: (1<=p129)
states: 13,464 (4)
abstracting: (p129<=1)
states: 2,759,432 (6)
abstracting: (1<=p108)
states: 2,502,920 (6)
abstracting: (p108<=1)
states: 2,759,432 (6)
abstracting: (1<=p130)
states: 13,464 (4)
abstracting: (p130<=1)
states: 2,759,432 (6)
abstracting: (1<=p87)
states: 35,496 (4)
abstracting: (p87<=1)
states: 2,759,432 (6)
abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p22)
states: 350,592 (5)
abstracting: (p22<=1)
states: 2,759,432 (6)
abstracting: (1<=p23)
states: 1,157,852 (6)
abstracting: (p23<=1)
states: 2,759,432 (6)
abstracting: (1<=p27)
states: 233,728 (5)
abstracting: (p27<=1)
states: 2,759,432 (6)
...............................................................................................................................................
EG iterations: 143
abstracting: (1<=p153)
states: 73,824 (4)
abstracting: (p153<=1)
states: 2,759,432 (6)
abstracting: (1<=p177)
states: 13,968 (4)
abstracting: (p177<=1)
states: 2,759,432 (6)
...........................................................
EG iterations: 59
abstracting: (1<=p15)
states: 116,864 (5)
abstracting: (p15<=1)
states: 2,759,432 (6)
.abstracting: (1<=p90)
states: 766,876 (5)
abstracting: (p90<=1)
states: 2,759,432 (6)
abstracting: (1<=p91)
states: 136,472 (5)
abstracting: (p91<=1)
states: 2,759,432 (6)
abstracting: (1<=p170)
states: 27,936 (4)
abstracting: (p170<=1)
states: 2,759,432 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.481sec

totally nodes used: 121166272 (1.2e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 72574796 435528371 508103167
used/not used/entry size/cache size: 65429180 1679684 16 1024MB
basic ops cache: hits/miss/sum: 2979009 17330944 20309953
used/not used/entry size/cache size: 10563953 6213263 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 41097 440465 481562
used/not used/entry size/cache size: 288204 8100404 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 29365135
1 23338838
2 10296349
3 3180427
4 755173
5 145850
6 23365
7 3263
8 400
9 55
>= 10 9

Total processing time: 3m43.655sec


BK_STOP 1679039436355

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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:25921 (150), effective:1367 (7)

initing FirstDep: 0m 0.000sec


iterations count:7065 (41), effective:331 (1)

iterations count:7065 (41), effective:331 (1)

iterations count:7065 (41), effective:331 (1)

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

iterations count:5774 (33), effective:261 (1)

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

iterations count:5485 (31), effective:269 (1)

iterations count:5491 (31), effective:269 (1)

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

iterations count:6429 (37), effective:313 (1)

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

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

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

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

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

iterations count:6092 (35), effective:311 (1)

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

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

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

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

iterations count:4999 (29), effective:224 (1)

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

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

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

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

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

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

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

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="ParamProductionCell-PT-0"
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 ParamProductionCell-PT-0, 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 r266-smll-167863540800362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 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 ;