MCC'2023- Execution of r458-smll-167912650000226

About the Execution of Marcie+red for SmartHome-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
6279.212	43490.00	54697.00	2463.20	TFFTFTTTTTTFFFTT	normal

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.r458-smll-167912650000226.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 SmartHome-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650000226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 68K 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 SmartHome-PT-10-CTLFireability-00
FORMULA_NAME SmartHome-PT-10-CTLFireability-01
FORMULA_NAME SmartHome-PT-10-CTLFireability-02
FORMULA_NAME SmartHome-PT-10-CTLFireability-03
FORMULA_NAME SmartHome-PT-10-CTLFireability-04
FORMULA_NAME SmartHome-PT-10-CTLFireability-05
FORMULA_NAME SmartHome-PT-10-CTLFireability-06
FORMULA_NAME SmartHome-PT-10-CTLFireability-07
FORMULA_NAME SmartHome-PT-10-CTLFireability-08
FORMULA_NAME SmartHome-PT-10-CTLFireability-09
FORMULA_NAME SmartHome-PT-10-CTLFireability-10
FORMULA_NAME SmartHome-PT-10-CTLFireability-11
FORMULA_NAME SmartHome-PT-10-CTLFireability-12
FORMULA_NAME SmartHome-PT-10-CTLFireability-13
FORMULA_NAME SmartHome-PT-10-CTLFireability-14
FORMULA_NAME SmartHome-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679312038000

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=SmartHome-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 11:34:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:34:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:34:01] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-20 11:34:01] [INFO ] Transformed 273 places.
[2023-03-20 11:34:01] [INFO ] Transformed 308 transitions.
[2023-03-20 11:34:01] [INFO ] Found NUPN structural information;
[2023-03-20 11:34:01] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 192 transition count 222
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 192 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 83 place count 192 transition count 221
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 186 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 186 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 183 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 183 transition count 212
Applied a total of 101 rules in 123 ms. Remains 183 /233 variables (removed 50) and now considering 212/263 (removed 51) transitions.
// Phase 1: matrix 212 rows 183 cols
[2023-03-20 11:34:02] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-20 11:34:02] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-20 11:34:02] [INFO ] Invariant cache hit.
[2023-03-20 11:34:02] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-20 11:34:02] [INFO ] Invariant cache hit.
[2023-03-20 11:34:03] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/233 places, 212/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 183/233 places, 212/263 transitions.
Support contains 70 out of 183 places after structural reductions.
[2023-03-20 11:34:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 11:34:03] [INFO ] Flatten gal took : 86 ms
FORMULA SmartHome-PT-10-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 11:34:03] [INFO ] Flatten gal took : 34 ms
[2023-03-20 11:34:03] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 60 out of 183 places (down from 70) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 825 ms. (steps per millisecond=12 ) properties (out of 53) seen :45
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-20 11:34:05] [INFO ] Invariant cache hit.
[2023-03-20 11:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-20 11:34:05] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:34:05] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-20 11:34:05] [INFO ] After 225ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 11:34:05] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-20 11:34:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-20 11:34:05] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:34:06] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-20 11:34:06] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-20 11:34:06] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 29 ms.
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 212/212 transitions.
Graph (trivial) has 170 edges and 183 vertex of which 87 / 183 are part of one of the 6 SCC in 5 ms
Free SCC test removed 81 places
Drop transitions removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 102 transition count 78
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 77 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 75 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 57 place count 75 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 71 transition count 70
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 74 place count 62 transition count 61
Iterating global reduction 3 with 9 rules applied. Total rules applied 83 place count 62 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 62 transition count 59
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 129 place count 40 transition count 36
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 117 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 7 rules applied. Total rules applied 136 place count 38 transition count 30
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 142 place count 38 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 148 place count 32 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 31 transition count 23
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 11 rules applied. Total rules applied 160 place count 26 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 166 place count 20 transition count 17
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 166 place count 20 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 178 place count 14 transition count 11
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 179 place count 13 transition count 10
Iterating global reduction 8 with 1 rules applied. Total rules applied 180 place count 13 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 182 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 182 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 184 place count 11 transition count 8
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 9 with 2 rules applied. Total rules applied 186 place count 10 transition count 7
Applied a total of 186 rules in 51 ms. Remains 10 /183 variables (removed 173) and now considering 7/212 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 10/183 places, 7/212 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=6 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 14 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 212 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Graph (trivial) has 160 edges and 183 vertex of which 67 / 183 are part of one of the 6 SCC in 0 ms
Free SCC test removed 61 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 121 transition count 102
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 40 rules applied. Total rules applied 74 place count 88 transition count 95
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 84 transition count 93
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 83 place count 82 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 83 place count 82 transition count 87
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 93 place count 77 transition count 87
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 101 place count 69 transition count 79
Iterating global reduction 4 with 8 rules applied. Total rules applied 109 place count 69 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 69 transition count 78
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 148 place count 50 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 151 place count 50 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 155 place count 48 transition count 54
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 161 place count 48 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 47 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 45 transition count 46
Applied a total of 164 rules in 40 ms. Remains 45 /183 variables (removed 138) and now considering 46/212 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 45/183 places, 46/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 161 transition count 190
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 161 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 161 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 154 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 154 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 149 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 149 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 148 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 148 transition count 175
Applied a total of 72 rules in 17 ms. Remains 148 /183 variables (removed 35) and now considering 175/212 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 148/183 places, 175/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 19 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 162 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 162 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 162 transition count 189
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 156 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 156 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 151 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 151 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 150 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 150 transition count 177
Applied a total of 68 rules in 16 ms. Remains 150 /183 variables (removed 33) and now considering 177/212 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 150/183 places, 177/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 162 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 162 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 162 transition count 190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 155 transition count 183
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 155 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 150 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 150 transition count 178
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 146 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 146 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 145 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 145 transition count 173
Applied a total of 77 rules in 19 ms. Remains 145 /183 variables (removed 38) and now considering 173/212 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 145/183 places, 173/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 162 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 162 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 162 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 155 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 155 transition count 182
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 149 transition count 176
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 149 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 145 transition count 172
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 144 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 144 transition count 171
Applied a total of 80 rules in 19 ms. Remains 144 /183 variables (removed 39) and now considering 171/212 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 144/183 places, 171/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 163 transition count 192
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 163 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 163 transition count 190
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 157 transition count 184
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 157 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 152 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 152 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 149 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 149 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 148 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 148 transition count 175
Applied a total of 72 rules in 18 ms. Remains 148 /183 variables (removed 35) and now considering 175/212 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 148/183 places, 175/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 17 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 168 transition count 197
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 168 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 168 transition count 195
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 162 transition count 189
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 162 transition count 189
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 158 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 158 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 156 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 156 transition count 183
Applied a total of 56 rules in 16 ms. Remains 156 /183 variables (removed 27) and now considering 183/212 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 156/183 places, 183/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 161 transition count 190
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 161 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 161 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 154 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 154 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 149 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 149 transition count 176
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 146 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 145 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 145 transition count 172
Applied a total of 78 rules in 21 ms. Remains 145 /183 variables (removed 38) and now considering 172/212 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 145/183 places, 172/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Graph (trivial) has 164 edges and 183 vertex of which 59 / 183 are part of one of the 6 SCC in 0 ms
Free SCC test removed 53 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 129 transition count 104
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 86 place count 90 transition count 97
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 86 transition count 94
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 100 place count 83 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 81 transition count 90
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 102 place count 81 transition count 85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 112 place count 76 transition count 85
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 122 place count 66 transition count 75
Iterating global reduction 5 with 10 rules applied. Total rules applied 132 place count 66 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 66 transition count 74
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 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 171 place count 47 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 174 place count 47 transition count 52
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 177 place count 46 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 178 place count 45 transition count 50
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 9 with 2 rules applied. Total rules applied 180 place count 44 transition count 49
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 186 place count 44 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 187 place count 43 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 189 place count 41 transition count 41
Applied a total of 189 rules in 33 ms. Remains 41 /183 variables (removed 142) and now considering 41/212 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 41/183 places, 41/212 transitions.
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:34:06] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:34:06] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 165 transition count 194
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 165 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 165 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 161 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 161 transition count 188
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 158 transition count 185
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 157 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 157 transition count 184
Applied a total of 54 rules in 15 ms. Remains 157 /183 variables (removed 26) and now considering 184/212 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 157/183 places, 184/212 transitions.
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:34:07] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 162 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 162 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 162 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 155 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 155 transition count 182
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 149 transition count 176
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 149 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 145 transition count 172
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 144 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 144 transition count 171
Applied a total of 80 rules in 17 ms. Remains 144 /183 variables (removed 39) and now considering 171/212 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 144/183 places, 171/212 transitions.
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:34:07] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 161 transition count 190
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 161 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 161 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 154 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 154 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 148 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 148 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 144 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 144 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 143 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 143 transition count 170
Applied a total of 82 rules in 21 ms. Remains 143 /183 variables (removed 40) and now considering 170/212 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 143/183 places, 170/212 transitions.
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 7 ms
[2023-03-20 11:34:07] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 212/212 transitions.
Graph (trivial) has 160 edges and 183 vertex of which 66 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 62 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 120 transition count 101
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 88 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 86 transition count 97
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 71 place count 86 transition count 89
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 87 place count 78 transition count 89
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 98 place count 67 transition count 78
Iterating global reduction 3 with 11 rules applied. Total rules applied 109 place count 67 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 67 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 66 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 66 transition count 74
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 153 place count 46 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 158 place count 46 transition count 49
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 160 place count 45 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 166 place count 42 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 42 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 173 place count 42 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 175 place count 40 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 177 place count 38 transition count 36
Applied a total of 177 rules in 30 ms. Remains 38 /183 variables (removed 145) and now considering 36/212 (removed 176) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 38/183 places, 36/212 transitions.
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:34:07] [INFO ] Input system was already deterministic with 36 transitions.
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:07] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:34:07] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 11:34:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 183 places, 212 transitions and 504 arcs took 1 ms.
Total runtime 5882 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: 183 NrTr: 212 NrArc: 504)

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

net check time: 0m 0.000sec

init dd package: 0m 3.616sec

RS generation: 0m 0.995sec

-> reachability set: #nodes 20146 (2.0e+04) #states 38,578,513,921 (10)

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

checking: EX [EF [[p128<=1 & 1<=p128]]]
normalized: EX [E [true U [p128<=1 & 1<=p128]]]

abstracting: (1<=p128)
states: 278,210,030 (8)
abstracting: (p128<=1)
states: 38,578,513,921 (10)
.-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.596sec

checking: EF [EX [AG [[p20<=0 & 0<=p20]]]]
normalized: E [true U EX [~ [E [true U ~ [[p20<=0 & 0<=p20]]]]]]

abstracting: (0<=p20)
states: 38,578,513,921 (10)
abstracting: (p20<=0)
states: 36,944,407,067 (10)
.-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.925sec

checking: AX [EF [AG [AF [EX [[p92<=1 & 1<=p92]]]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U EG [~ [EX [[p92<=1 & 1<=p92]]]]]]]]]]

abstracting: (1<=p92)
states: 2,089,176,294 (9)
abstracting: (p92<=1)
states: 38,578,513,921 (10)
...............
EG iterations: 14
.-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.498sec

checking: AF [AG [[EF [[p93<=0 & 0<=p93]] | [p55<=1 & 1<=p55]]]]
normalized: ~ [EG [E [true U ~ [[[p55<=1 & 1<=p55] | E [true U [p93<=0 & 0<=p93]]]]]]]

abstracting: (0<=p93)
states: 38,578,513,921 (10)
abstracting: (p93<=0)
states: 36,468,695,579 (10)
abstracting: (1<=p55)
states: 2,407,666,482 (9)
abstracting: (p55<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.200sec

checking: [AG [EF [[~ [[p65<=1 & 1<=p65]] | AG [[p5<=1 & 1<=p5]]]]] & EF [[p33<=1 & 1<=p33]]]
normalized: [E [true U [p33<=1 & 1<=p33]] & ~ [E [true U ~ [E [true U [~ [E [true U ~ [[p5<=1 & 1<=p5]]]] | ~ [[p65<=1 & 1<=p65]]]]]]]]

abstracting: (1<=p65)
states: 2,392,487,582 (9)
abstracting: (p65<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p5)
states: 7,632,804,224 (9)
abstracting: (p5<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p33)
states: 1,634,106,854 (9)
abstracting: (p33<=1)
states: 38,578,513,921 (10)
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.330sec

checking: AG [EF [AX [[A [[p117<=1 & 1<=p117] U [p110<=1 & 1<=p110]] & [p71<=1 & 1<=p71]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [[[p71<=1 & 1<=p71] & [~ [EG [~ [[p110<=1 & 1<=p110]]]] & ~ [E [~ [[p110<=1 & 1<=p110]] U [~ [[p117<=1 & 1<=p117]] & ~ [[p110<=1 & 1<=p110]]]]]]]]]]]]]]

abstracting: (1<=p110)
states: 1,635,584,100 (9)
abstracting: (p110<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p117)
states: 1,635,584,100 (9)
abstracting: (p117<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p110)
states: 1,635,584,100 (9)
abstracting: (p110<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p110)
states: 1,635,584,100 (9)
abstracting: (p110<=1)
states: 38,578,513,921 (10)
...............
EG iterations: 15
abstracting: (1<=p71)
states: 2,392,487,582 (9)
abstracting: (p71<=1)
states: 38,578,513,921 (10)
.-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.275sec

checking: [AF [[AX [AX [[[p2<=0 & 0<=p2] | [p93<=0 & 0<=p93]]]] & [[p83<=0 & 0<=p83] | [p106<=1 & 1<=p106]]]] & EF [[[p120<=1 & 1<=p120] & [p4<=1 & 1<=p4]]]]
normalized: [E [true U [[p4<=1 & 1<=p4] & [p120<=1 & 1<=p120]]] & ~ [EG [~ [[[[p106<=1 & 1<=p106] | [p83<=0 & 0<=p83]] & ~ [EX [EX [~ [[[p93<=0 & 0<=p93] | [p2<=0 & 0<=p2]]]]]]]]]]]

abstracting: (0<=p2)
states: 38,578,513,921 (10)
abstracting: (p2<=0)
states: 30,730,247,853 (10)
abstracting: (0<=p93)
states: 38,578,513,921 (10)
abstracting: (p93<=0)
states: 36,468,695,579 (10)
..abstracting: (0<=p83)
states: 38,578,513,921 (10)
abstracting: (p83<=0)
states: 36,471,058,753 (10)
abstracting: (1<=p106)
states: 1,635,584,100 (9)
abstracting: (p106<=1)
states: 38,578,513,921 (10)
....
EG iterations: 4
abstracting: (1<=p120)
states: 206,231,300 (8)
abstracting: (p120<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p4)
states: 7,632,804,224 (9)
abstracting: (p4<=1)
states: 38,578,513,921 (10)
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.321sec

checking: AG [[A [EF [[p139<=1 & 1<=p139]] U [p67<=1 & 1<=p67]] | [[p47<=0 & 0<=p47] & [A [EX [[p124<=1 & 1<=p124]] U ~ [A [[p35<=1 & 1<=p35] U [p35<=1 & 1<=p35]]]] & EF [[p21<=1 & 1<=p21]]]]]]
normalized: ~ [E [true U ~ [[[[E [true U [p21<=1 & 1<=p21]] & [~ [EG [[~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[p35<=1 & 1<=p35]] & ~ [[p35<=1 & 1<=p35]]]]]]]] & ~ [E [[~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[p35<=1 & 1<=p35]] & ~ [[p35<=1 & 1<=p35]]]]]] U [~ [EX [[p124<=1 & 1<=p124]]] & [~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[p35<=1 & 1<=p35]] & ~ [[p35<=1 & 1<=p35]]]]]]]]]]] & [p47<=0 & 0<=p47]] | [~ [EG [~ [[p67<=1 & 1<=p67]]]] & ~ [E [~ [[p67<=1 & 1<=p67]] U [~ [E [true U [p139<=1 & 1<=p139]]] & ~ [[p67<=1 & 1<=p67]]]]]]]]]]

abstracting: (1<=p67)
states: 2,392,487,582 (9)
abstracting: (p67<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p139)
states: 2,084,931,125 (9)
abstracting: (p139<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p67)
states: 2,392,487,582 (9)
abstracting: (p67<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p67)
states: 2,392,487,582 (9)
abstracting: (p67<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (0<=p47)
states: 38,578,513,921 (10)
abstracting: (p47<=0)
states: 36,173,640,281 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
.........................
EG iterations: 25
abstracting: (1<=p124)
states: 68,277,110 (7)
abstracting: (p124<=1)
states: 38,578,513,921 (10)
.abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
.........................
EG iterations: 25
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p35)
states: 1,634,106,854 (9)
abstracting: (p35<=1)
states: 38,578,513,921 (10)
.........................
EG iterations: 25
.......
EG iterations: 7
abstracting: (1<=p21)
states: 1,634,106,854 (9)
abstracting: (p21<=1)
states: 38,578,513,921 (10)
-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.124sec

checking: [EF [[p36<=1 & 1<=p36]] & [A [AG [EX [AX [[p147<=1 & 1<=p147]]]] U AF [[p29<=1 & 1<=p29]]] | EG [AG [[~ [A [[[p2<=1 & 1<=p2] & [p145<=1 & 1<=p145]] U [p23<=1 & 1<=p23]]] | [p34<=0 & 0<=p34]]]]]]
normalized: [[EG [~ [E [true U ~ [[[p34<=0 & 0<=p34] | ~ [[~ [EG [~ [[p23<=1 & 1<=p23]]]] & ~ [E [~ [[p23<=1 & 1<=p23]] U [~ [[[p145<=1 & 1<=p145] & [p2<=1 & 1<=p2]]] & ~ [[p23<=1 & 1<=p23]]]]]]]]]]]] | [~ [EG [EG [~ [[p29<=1 & 1<=p29]]]]] & ~ [E [EG [~ [[p29<=1 & 1<=p29]]] U [E [true U ~ [EX [~ [EX [~ [[p147<=1 & 1<=p147]]]]]]] & EG [~ [[p29<=1 & 1<=p29]]]]]]]] & E [true U [p36<=1 & 1<=p36]]]

abstracting: (1<=p36)
states: 521,589,584 (8)
abstracting: (p36<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p29)
states: 1,634,106,854 (9)
abstracting: (p29<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p147)
states: 375,328,858 (8)
abstracting: (p147<=1)
states: 38,578,513,921 (10)
..abstracting: (1<=p29)
states: 1,634,106,854 (9)
abstracting: (p29<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p29)
states: 1,634,106,854 (9)
abstracting: (p29<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p23)
states: 1,634,106,854 (9)
abstracting: (p23<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p2)
states: 7,848,266,068 (9)
abstracting: (p2<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p145)
states: 2,084,931,125 (9)
abstracting: (p145<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p23)
states: 1,634,106,854 (9)
abstracting: (p23<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p23)
states: 1,634,106,854 (9)
abstracting: (p23<=1)
states: 38,578,513,921 (10)
.......
EG iterations: 7
abstracting: (0<=p34)
states: 38,578,513,921 (10)
abstracting: (p34<=0)
states: 38,039,445,623 (10)

EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.365sec

checking: [AX [AF [[p139<=1 & 1<=p139]]] | ~ [E [[AF [[~ [[p93<=1 & 1<=p93]] | EX [[p60<=1 & 1<=p60]]]] | [[p2<=1 & 1<=p2] & [[p145<=1 & 1<=p145] & ~ [[p125<=1 & 1<=p125]]]]] U AX [[AG [[p109<=1 & 1<=p109]] & ~ [EG [[p169<=1 & 1<=p169]]]]]]]]
normalized: [~ [E [[[[~ [[p125<=1 & 1<=p125]] & [p145<=1 & 1<=p145]] & [p2<=1 & 1<=p2]] | ~ [EG [~ [[EX [[p60<=1 & 1<=p60]] | ~ [[p93<=1 & 1<=p93]]]]]]] U ~ [EX [~ [[~ [EG [[p169<=1 & 1<=p169]]] & ~ [E [true U ~ [[p109<=1 & 1<=p109]]]]]]]]]] | ~ [EX [EG [~ [[p139<=1 & 1<=p139]]]]]]

abstracting: (1<=p139)
states: 2,084,931,125 (9)
abstracting: (p139<=1)
states: 38,578,513,921 (10)
.......
EG iterations: 7
.abstracting: (1<=p109)
states: 1,635,584,100 (9)
abstracting: (p109<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p169)
states: 2,142,075,100 (9)
abstracting: (p169<=1)
states: 38,578,513,921 (10)
....
EG iterations: 4
.abstracting: (1<=p93)
states: 2,109,818,342 (9)
abstracting: (p93<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p60)
states: 2,392,487,582 (9)
abstracting: (p60<=1)
states: 38,578,513,921 (10)
.............
EG iterations: 12
abstracting: (1<=p2)
states: 7,848,266,068 (9)
abstracting: (p2<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p145)
states: 2,084,931,125 (9)
abstracting: (p145<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p125)
states: 68,277,110 (7)
abstracting: (p125<=1)
states: 38,578,513,921 (10)
-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.850sec

checking: [AG [A [~ [[p142<=1 & 1<=p142]] U AG [~ [[[p26<=1 & 1<=p26] | [p137<=1 & 1<=p137]]]]]] & ~ [A [EF [[[p72<=1 & 1<=p72] & [p43<=1 & 1<=p43]]] U [A [EG [[p122<=1 & 1<=p122]] U [p143<=1 & 1<=p143]] & EG [EX [[p115<=1 & 1<=p115]]]]]]]
normalized: [~ [[~ [EG [~ [[EG [EX [[p115<=1 & 1<=p115]]] & [~ [EG [~ [[p143<=1 & 1<=p143]]]] & ~ [E [~ [[p143<=1 & 1<=p143]] U [~ [EG [[p122<=1 & 1<=p122]]] & ~ [[p143<=1 & 1<=p143]]]]]]]]]] & ~ [E [~ [[EG [EX [[p115<=1 & 1<=p115]]] & [~ [EG [~ [[p143<=1 & 1<=p143]]]] & ~ [E [~ [[p143<=1 & 1<=p143]] U [~ [EG [[p122<=1 & 1<=p122]]] & ~ [[p143<=1 & 1<=p143]]]]]]]] U [~ [E [true U [[p43<=1 & 1<=p43] & [p72<=1 & 1<=p72]]]] & ~ [[EG [EX [[p115<=1 & 1<=p115]]] & [~ [EG [~ [[p143<=1 & 1<=p143]]]] & ~ [E [~ [[p143<=1 & 1<=p143]] U [~ [EG [[p122<=1 & 1<=p122]]] & ~ [[p143<=1 & 1<=p143]]]]]]]]]]]]] & ~ [E [true U ~ [[~ [EG [E [true U [[p137<=1 & 1<=p137] | [p26<=1 & 1<=p26]]]]] & ~ [E [E [true U [[p137<=1 & 1<=p137] | [p26<=1 & 1<=p26]]] U [[p142<=1 & 1<=p142] & E [true U [[p137<=1 & 1<=p137] | [p26<=1 & 1<=p26]]]]]]]]]]]

abstracting: (1<=p26)
states: 1,634,106,854 (9)
abstracting: (p26<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p137)
states: 2,084,931,125 (9)
abstracting: (p137<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p142)
states: 2,084,931,125 (9)
abstracting: (p142<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p26)
states: 1,634,106,854 (9)
abstracting: (p26<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p137)
states: 2,084,931,125 (9)
abstracting: (p137<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p26)
states: 1,634,106,854 (9)
abstracting: (p26<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p137)
states: 2,084,931,125 (9)
abstracting: (p137<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p122)
states: 68,277,110 (7)
abstracting: (p122<=1)
states: 38,578,513,921 (10)
....
EG iterations: 4
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p115)
states: 1,635,584,100 (9)
abstracting: (p115<=1)
states: 38,578,513,921 (10)
........
EG iterations: 7
abstracting: (1<=p72)
states: 1,682,835,952 (9)
abstracting: (p72<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p43)
states: 2,404,873,640 (9)
abstracting: (p43<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p122)
states: 68,277,110 (7)
abstracting: (p122<=1)
states: 38,578,513,921 (10)
....
EG iterations: 4
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p115)
states: 1,635,584,100 (9)
abstracting: (p115<=1)
states: 38,578,513,921 (10)
........
EG iterations: 7
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p122)
states: 68,277,110 (7)
abstracting: (p122<=1)
states: 38,578,513,921 (10)
....
EG iterations: 4
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p143)
states: 2,084,931,125 (9)
abstracting: (p143<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p115)
states: 1,635,584,100 (9)
abstracting: (p115<=1)
states: 38,578,513,921 (10)
........
EG iterations: 7
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.387sec

checking: EF [[[[[A [[p146<=1 & 1<=p146] U [p54<=1 & 1<=p54]] & [AG [[p103<=1 & 1<=p103]] | [[p54<=1 & 1<=p54] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]] & [p167<=1 & 1<=p167]] & [[1<=p161 & p161<=1] & [p164<=1 & 1<=p164]]]]
normalized: E [true U [[[p164<=1 & 1<=p164] & [1<=p161 & p161<=1]] & [[p167<=1 & 1<=p167] & [[p144<=1 & 1<=p144] | [[[[p6<=1 & 1<=p6] & [p54<=1 & 1<=p54]] | ~ [E [true U ~ [[p103<=1 & 1<=p103]]]]] & [~ [EG [~ [[p54<=1 & 1<=p54]]]] & ~ [E [~ [[p54<=1 & 1<=p54]] U [~ [[p146<=1 & 1<=p146]] & ~ [[p54<=1 & 1<=p54]]]]]]]]]]]

abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p146)
states: 385,771,818 (8)
abstracting: (p146<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p103)
states: 1,635,584,100 (9)
abstracting: (p103<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p6)
states: 7,617,841,772 (9)
abstracting: (p6<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p144)
states: 2,084,931,125 (9)
abstracting: (p144<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p167)
states: 4,114,696,320 (9)
abstracting: (p167<=1)
states: 38,578,513,921 (10)
abstracting: (p161<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p161)
states: 3,863,116,800 (9)
abstracting: (1<=p164)
states: 3,299,512,320 (9)
abstracting: (p164<=1)
states: 38,578,513,921 (10)
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.684sec

checking: E [[~ [AF [[[p161<=1 & 1<=p161] & [[p164<=1 & 1<=p164] & [p167<=1 & 1<=p167]]]]] | [A [~ [[[p30<=1 & 1<=p30] & [p100<=1 & 1<=p100]]] U AX [AF [[p54<=1 & 1<=p54]]]] | [AF [[p39<=1 & 1<=p39]] & [~ [EX [[p79<=1 & 1<=p79]]] | [p76<=1 & 1<=p76]]]]] U [[~ [AX [EG [[p103<=1 & 1<=p103]]]] | [p118<=1 & 1<=p118]] & [[p25<=1 & 1<=p25] | [[AF [~ [AG [[p118<=1 & 1<=p118]]]] & EX [[[p19<=1 & 1<=p19] & [p119<=1 & 1<=p119]]]] & [~ [[p153<=1 & 1<=p153]] & [p20<=1 & 1<=p20]]]]]]
normalized: E [[[[[[p76<=1 & 1<=p76] | ~ [EX [[p79<=1 & 1<=p79]]]] & ~ [EG [~ [[p39<=1 & 1<=p39]]]]] | [~ [EG [EX [EG [~ [[p54<=1 & 1<=p54]]]]]] & ~ [E [EX [EG [~ [[p54<=1 & 1<=p54]]]] U [[[p100<=1 & 1<=p100] & [p30<=1 & 1<=p30]] & EX [EG [~ [[p54<=1 & 1<=p54]]]]]]]]] | EG [~ [[[[p167<=1 & 1<=p167] & [p164<=1 & 1<=p164]] & [p161<=1 & 1<=p161]]]]] U [[[[[p20<=1 & 1<=p20] & ~ [[p153<=1 & 1<=p153]]] & [EX [[[p119<=1 & 1<=p119] & [p19<=1 & 1<=p19]]] & ~ [EG [~ [E [true U ~ [[p118<=1 & 1<=p118]]]]]]]] | [p25<=1 & 1<=p25]] & [[p118<=1 & 1<=p118] | EX [~ [EG [[p103<=1 & 1<=p103]]]]]]]

abstracting: (1<=p103)
states: 1,635,584,100 (9)
abstracting: (p103<=1)
states: 38,578,513,921 (10)
.......
EG iterations: 7
.abstracting: (1<=p118)
states: 206,231,300 (8)
abstracting: (p118<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p25)
states: 1,634,106,854 (9)
abstracting: (p25<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p118)
states: 206,231,300 (8)
abstracting: (p118<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,634,106,854 (9)
abstracting: (p19<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p119)
states: 206,231,300 (8)
abstracting: (p119<=1)
states: 38,578,513,921 (10)
.abstracting: (1<=p153)
states: 466,197,120 (8)
abstracting: (p153<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p20)
states: 1,634,106,854 (9)
abstracting: (p20<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p161)
states: 3,863,116,800 (9)
abstracting: (p161<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p164)
states: 3,299,512,320 (9)
abstracting: (p164<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p167)
states: 4,114,696,320 (9)
abstracting: (p167<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
.abstracting: (1<=p30)
states: 1,634,106,854 (9)
abstracting: (p30<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p100)
states: 1,635,584,100 (9)
abstracting: (p100<=1)
states: 38,578,513,921 (10)
abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
.abstracting: (1<=p54)
states: 2,407,666,482 (9)
abstracting: (p54<=1)
states: 38,578,513,921 (10)
.
EG iterations: 1
.......
EG iterations: 6
abstracting: (1<=p39)
states: 67,077,920 (7)
abstracting: (p39<=1)
states: 38,578,513,921 (10)
....
EG iterations: 4
abstracting: (1<=p79)
states: 2,107,455,168 (9)
abstracting: (p79<=1)
states: 38,578,513,921 (10)
.abstracting: (1<=p76)
states: 2,109,818,342 (9)
abstracting: (p76<=1)
states: 38,578,513,921 (10)
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.949sec

totally nodes used: 11860889 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23049441 53022802 76072243
used/not used/entry size/cache size: 41222459 25886405 16 1024MB
basic ops cache: hits/miss/sum: 2410453 5701524 8111977
used/not used/entry size/cache size: 7220097 9557119 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: 107478 282015 389493
used/not used/entry size/cache size: 277527 8111081 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 56969327
1 8671072
2 1248585
3 190559
4 25989
5 3008
6 297
7 24
8 3
9 0
>= 10 0

Total processing time: 0m33.113sec

BK_STOP 1679312081490

--------------------
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:8595 (40), effective:940 (4)

initing FirstDep: 0m 0.000sec

iterations count:4027 (18), effective:350 (1)

iterations count:1532 (7), effective:136 (0)

iterations count:1559 (7), effective:171 (0)

iterations count:619 (2), effective:59 (0)

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

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

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

iterations count:1552 (7), effective:136 (0)

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

iterations count:2682 (12), effective:248 (1)

iterations count:5476 (25), effective:487 (2)

iterations count:3087 (14), effective:257 (1)

iterations count:1748 (8), effective:202 (0)

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

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

iterations count:216 (1), effective:2 (0)

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

iterations count:1532 (7), effective:136 (0)

iterations count:1617 (7), effective:153 (0)

iterations count:270 (1), effective:10 (0)

iterations count:752 (3), effective:18 (0)

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

iterations count:362 (1), effective:22 (0)

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

iterations count:2762 (13), effective:254 (1)

iterations count:1608 (7), effective:138 (0)

iterations count:1608 (7), effective:138 (0)

iterations count:3087 (14), effective:257 (1)

iterations count:1608 (7), effective:138 (0)

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

iterations count:856 (4), effective:54 (0)

iterations count:523 (2), effective:29 (0)

iterations count:856 (4), effective:54 (0)

iterations count:455 (2), effective:23 (0)

iterations count:856 (4), effective:54 (0)

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

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

iterations count:6005 (28), effective:550 (2)

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

iterations count:2015 (9), effective:194 (0)

iterations count:1780 (8), effective:174 (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="SmartHome-PT-10"
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 SmartHome-PT-10, 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 r458-smll-167912650000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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