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-167912650000225.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650000225
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME SmartHome-PT-10-CTLCardinality-01
FORMULA_NAME SmartHome-PT-10-CTLCardinality-02
FORMULA_NAME SmartHome-PT-10-CTLCardinality-03
FORMULA_NAME SmartHome-PT-10-CTLCardinality-04
FORMULA_NAME SmartHome-PT-10-CTLCardinality-05
FORMULA_NAME SmartHome-PT-10-CTLCardinality-06
FORMULA_NAME SmartHome-PT-10-CTLCardinality-07
FORMULA_NAME SmartHome-PT-10-CTLCardinality-08
FORMULA_NAME SmartHome-PT-10-CTLCardinality-09
FORMULA_NAME SmartHome-PT-10-CTLCardinality-10
FORMULA_NAME SmartHome-PT-10-CTLCardinality-11
FORMULA_NAME SmartHome-PT-10-CTLCardinality-12
FORMULA_NAME SmartHome-PT-10-CTLCardinality-13
FORMULA_NAME SmartHome-PT-10-CTLCardinality-14
FORMULA_NAME SmartHome-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679311961841

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=CTLCardinality
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:32:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:32:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:32:44] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-20 11:32:44] [INFO ] Transformed 273 places.
[2023-03-20 11:32:44] [INFO ] Transformed 308 transitions.
[2023-03-20 11:32:44] [INFO ] Found NUPN structural information;
[2023-03-20 11:32:44] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 206 transition count 236
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 206 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 206 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 204 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 204 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 202 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 202 transition count 231
Applied a total of 63 rules in 77 ms. Remains 202 /233 variables (removed 31) and now considering 231/263 (removed 32) transitions.
// Phase 1: matrix 231 rows 202 cols
[2023-03-20 11:32:44] [INFO ] Computed 12 place invariants in 22 ms
[2023-03-20 11:32:44] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-20 11:32:44] [INFO ] Invariant cache hit.
[2023-03-20 11:32:45] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-20 11:32:45] [INFO ] Invariant cache hit.
[2023-03-20 11:32:45] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/233 places, 231/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1005 ms. Remains : 202/233 places, 231/263 transitions.
Support contains 84 out of 202 places after structural reductions.
[2023-03-20 11:32:45] [INFO ] Flatten gal took : 67 ms
[2023-03-20 11:32:45] [INFO ] Flatten gal took : 25 ms
[2023-03-20 11:32:45] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 81 out of 202 places (down from 84) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 816 ms. (steps per millisecond=12 ) properties (out of 57) seen :47
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 11:32:47] [INFO ] Invariant cache hit.
[2023-03-20 11:32:47] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:32:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-20 11:32:47] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 11:32:47] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 11:32:48] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 18 ms to minimize.
[2023-03-20 11:32:48] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2023-03-20 11:32:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-03-20 11:32:48] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2023-03-20 11:32:48] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2023-03-20 11:32:48] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2023-03-20 11:32:49] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2023-03-20 11:32:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1104 ms
[2023-03-20 11:32:49] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2023-03-20 11:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-20 11:32:49] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2023-03-20 11:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-20 11:32:49] [INFO ] After 1688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-20 11:32:49] [INFO ] After 2041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 7 properties in 49 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 231/231 transitions.
Graph (trivial) has 183 edges and 202 vertex of which 86 / 202 are part of one of the 6 SCC in 7 ms
Free SCC test removed 80 places
Drop transitions removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Graph (complete) has 232 edges and 122 vertex of which 118 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 118 transition count 84
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 44 rules applied. Total rules applied 84 place count 83 transition count 75
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 78 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 89 place count 78 transition count 71
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 97 place count 74 transition count 71
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 109 place count 62 transition count 59
Iterating global reduction 3 with 12 rules applied. Total rules applied 121 place count 62 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 62 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 122 place count 62 transition count 57
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 61 transition count 57
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 160 place count 43 transition count 39
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 43 transition count 36
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 170 place count 43 transition count 29
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 177 place count 36 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 35 transition count 28
Reduce places removed 3 places and 0 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 6 with 7 rules applied. Total rules applied 185 place count 32 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 189 place count 28 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 189 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 198 place count 23 transition count 20
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 8 with 4 rules applied. Total rules applied 202 place count 21 transition count 18
Applied a total of 202 rules in 57 ms. Remains 21 /202 variables (removed 181) and now considering 18/231 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 21/202 places, 18/231 transitions.
Finished random walk after 58 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=29 )
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 17 ms
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 17 ms
[2023-03-20 11:32:49] [INFO ] Input system was already deterministic with 231 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 169 transition count 198
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 169 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 169 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 159 transition count 186
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 159 transition count 186
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 150 transition count 177
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 150 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 146 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 145 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 145 transition count 172
Applied a total of 116 rules in 29 ms. Remains 145 /202 variables (removed 57) and now considering 172/231 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 145/202 places, 172/231 transitions.
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:49] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Graph (trivial) has 181 edges and 202 vertex of which 80 / 202 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 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 127 transition count 105
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 41 rules applied. Total rules applied 75 place count 94 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 82 place count 90 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 87 transition count 94
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 85 place count 87 transition count 90
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 93 place count 83 transition count 90
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 109 place count 67 transition count 74
Iterating global reduction 4 with 16 rules applied. Total rules applied 125 place count 67 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 67 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 127 place count 67 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 66 transition count 71
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 161 place count 50 transition count 55
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 167 place count 50 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 169 place count 48 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 171 place count 46 transition count 47
Applied a total of 171 rules in 35 ms. Remains 46 /202 variables (removed 156) and now considering 47/231 (removed 184) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 46/202 places, 47/231 transitions.
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 4 ms
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 4 ms
[2023-03-20 11:32:49] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Graph (trivial) has 175 edges and 202 vertex of which 73 / 202 are part of one of the 6 SCC in 0 ms
Free SCC test removed 67 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 134 transition count 109
Reduce places removed 38 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 45 rules applied. Total rules applied 84 place count 96 transition count 102
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 90 place count 92 transition count 100
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 93 place count 90 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 93 place count 90 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 101 place count 86 transition count 95
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 117 place count 70 transition count 79
Iterating global reduction 4 with 16 rules applied. Total rules applied 133 place count 70 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 70 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 135 place count 70 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 69 transition count 76
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 173 place count 51 transition count 58
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 178 place count 51 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 179 place count 50 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 50 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 182 place count 48 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 47 transition count 51
Applied a total of 183 rules in 34 ms. Remains 47 /202 variables (removed 155) and now considering 51/231 (removed 180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 47/202 places, 51/231 transitions.
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:32:49] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 171 transition count 200
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 171 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 171 transition count 199
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 73 place count 161 transition count 189
Iterating global reduction 1 with 10 rules applied. Total rules applied 83 place count 161 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 92 place count 152 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 101 place count 152 transition count 180
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 147 transition count 175
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 147 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 146 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 146 transition count 174
Applied a total of 113 rules in 32 ms. Remains 146 /202 variables (removed 56) and now considering 174/231 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 146/202 places, 174/231 transitions.
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:32:49] [INFO ] Flatten gal took : 11 ms
[2023-03-20 11:32:49] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 168 transition count 197
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 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 70 place count 168 transition count 195
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 80 place count 158 transition count 185
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 158 transition count 185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 98 place count 150 transition count 177
Iterating global reduction 1 with 8 rules applied. Total rules applied 106 place count 150 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 146 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 145 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 145 transition count 172
Applied a total of 116 rules in 20 ms. Remains 145 /202 variables (removed 57) and now considering 172/231 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 145/202 places, 172/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 170 transition count 199
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 170 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 170 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 160 transition count 188
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 160 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 93 place count 152 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 101 place count 152 transition count 180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 148 transition count 176
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 148 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 147 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 147 transition count 175
Applied a total of 111 rules in 26 ms. Remains 147 /202 variables (removed 55) and now considering 175/231 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 147/202 places, 175/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 171 transition count 200
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 171 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 171 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 164 transition count 192
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 164 transition count 192
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 158 transition count 186
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 156 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 156 transition count 184
Applied a total of 93 rules in 16 ms. Remains 156 /202 variables (removed 46) and now considering 184/231 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 156/202 places, 184/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 170 transition count 199
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 170 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 170 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 160 transition count 188
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 160 transition count 188
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 94 place count 151 transition count 179
Iterating global reduction 1 with 9 rules applied. Total rules applied 103 place count 151 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 108 place count 146 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 146 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 145 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 145 transition count 173
Applied a total of 115 rules in 51 ms. Remains 145 /202 variables (removed 57) and now considering 173/231 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 145/202 places, 173/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 8 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Graph (trivial) has 185 edges and 202 vertex of which 93 / 202 are part of one of the 6 SCC in 1 ms
Free SCC test removed 87 places
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 114 transition count 93
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 35 rules applied. Total rules applied 65 place count 85 transition count 87
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 82 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 81 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 70 place count 81 transition count 83
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 76 place count 78 transition count 83
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 92 place count 62 transition count 67
Iterating global reduction 4 with 16 rules applied. Total rules applied 108 place count 62 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 110 place count 62 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 110 place count 62 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 61 transition count 64
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 148 place count 43 transition count 46
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 153 place count 43 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 154 place count 42 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 156 place count 40 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 157 place count 39 transition count 39
Applied a total of 157 rules in 28 ms. Remains 39 /202 variables (removed 163) and now considering 39/231 (removed 192) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 39/202 places, 39/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 175 transition count 204
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 175 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 175 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 169 transition count 196
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 169 transition count 196
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 164 transition count 191
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 164 transition count 191
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 162 transition count 189
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 162 transition count 189
Applied a total of 82 rules in 15 ms. Remains 162 /202 variables (removed 40) and now considering 189/231 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 162/202 places, 189/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Graph (trivial) has 174 edges and 202 vertex of which 64 / 202 are part of one of the 6 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 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 143 transition count 119
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 49 rules applied. Total rules applied 89 place count 104 transition count 109
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 98 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 96 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 99 place count 96 transition count 102
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 109 place count 91 transition count 102
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 125 place count 75 transition count 86
Iterating global reduction 4 with 16 rules applied. Total rules applied 141 place count 75 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 75 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 143 place count 75 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 74 transition count 83
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 183 place count 55 transition count 64
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 189 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 54 transition count 58
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 54 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 193 place count 52 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 22 edges and 51 vertex of which 2 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 195 place count 50 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 197 place count 50 transition count 54
Applied a total of 197 rules in 32 ms. Remains 50 /202 variables (removed 152) and now considering 54/231 (removed 177) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 50/202 places, 54/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 3 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 4 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Graph (trivial) has 187 edges and 202 vertex of which 91 / 202 are part of one of the 6 SCC in 0 ms
Free SCC test removed 85 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 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 116 transition count 92
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 38 rules applied. Total rules applied 71 place count 84 transition count 86
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 81 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 80 transition count 85
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 76 place count 80 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 77 transition count 82
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 99 place count 60 transition count 65
Iterating global reduction 4 with 17 rules applied. Total rules applied 116 place count 60 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 60 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 118 place count 60 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 120 place count 59 transition count 62
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 156 place count 41 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 162 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 164 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 37 transition count 36
Applied a total of 166 rules in 22 ms. Remains 37 /202 variables (removed 165) and now considering 36/231 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 37/202 places, 36/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 2 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 36 transitions.
Finished random walk after 13 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA SmartHome-PT-10-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 170 transition count 199
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 170 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 170 transition count 197
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 160 transition count 187
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 160 transition count 187
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 95 place count 151 transition count 178
Iterating global reduction 1 with 9 rules applied. Total rules applied 104 place count 151 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 146 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 145 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 145 transition count 172
Applied a total of 116 rules in 19 ms. Remains 145 /202 variables (removed 57) and now considering 172/231 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 145/202 places, 172/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 9 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 231/231 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 173 transition count 202
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 173 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 173 transition count 200
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 165 transition count 192
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 165 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 160 transition count 187
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 160 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 158 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 157 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 157 transition count 184
Applied a total of 92 rules in 19 ms. Remains 157 /202 variables (removed 45) and now considering 184/231 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 157/202 places, 184/231 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 10 ms
[2023-03-20 11:32:50] [INFO ] Input system was already deterministic with 184 transitions.
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 12 ms
[2023-03-20 11:32:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 11:32:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-20 11:32:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 231 transitions and 543 arcs took 2 ms.
Total runtime 6695 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 202 NrTr: 231 NrArc: 543)

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

net check time: 0m 0.000sec

init dd package: 0m 3.375sec


RS generation: 0m 1.379sec


-> reachability set: #nodes 18690 (1.9e+04) #states 151,819,193,674 (11)



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

checking: AG [AX [EG [AF [[p89<=0 & 0<=p89]]]]]
normalized: ~ [E [true U EX [~ [EG [~ [EG [~ [[p89<=0 & 0<=p89]]]]]]]]]

abstracting: (0<=p89)
states: 151,819,193,674 (11)
abstracting: (p89<=0)
states: 145,832,464,482 (11)
.......
EG iterations: 7
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.926sec

checking: EX [AG [[~ [[p3<=1 & 1<=p3]] | [p142<=0 & 0<=p142]]]]
normalized: EX [~ [E [true U ~ [[[p142<=0 & 0<=p142] | ~ [[p3<=1 & 1<=p3]]]]]]]

abstracting: (1<=p3)
states: 25,653,039,412 (10)
abstracting: (p3<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p142)
states: 151,819,193,674 (11)
abstracting: (p142<=0)
states: 150,759,573,274 (11)
.-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.890sec

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

abstracting: (0<=p55)
states: 151,819,193,674 (11)
abstracting: (p55<=0)
states: 143,860,741,586 (11)
abstracting: (1<=p74)
states: 8,899,104,920 (9)
abstracting: (p74<=1)
states: 151,819,193,674 (11)
-> the formula is TRUE

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

MC time: 0m 5.514sec

checking: [AG [[[p69<=1 & 1<=p69] & [p138<=0 & 0<=p138]]] | AG [AX [EG [AX [[[p32<=0 & 0<=p32] | [p101<=1 & 1<=p101]]]]]]]
normalized: [~ [E [true U EX [~ [EG [~ [EX [~ [[[p101<=1 & 1<=p101] | [p32<=0 & 0<=p32]]]]]]]]]] | ~ [E [true U ~ [[[p138<=0 & 0<=p138] & [p69<=1 & 1<=p69]]]]]]

abstracting: (1<=p69)
states: 5,986,729,192 (9)
abstracting: (p69<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p138)
states: 151,819,193,674 (11)
abstracting: (p138<=0)
states: 145,592,830,053 (11)
abstracting: (0<=p32)
states: 151,819,193,674 (11)
abstracting: (p32<=0)
states: 146,097,597,906 (11)
abstracting: (1<=p101)
states: 8,186,474,088 (9)
abstracting: (p101<=1)
states: 151,819,193,674 (11)
........
EG iterations: 7
.-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.543sec

checking: A [AF [AX [[p188<=1 & 1<=p188]]] U AF [[EG [EF [[p103<=1 & 1<=p103]]] & [[p179<=0 & 0<=p179] | [p17<=1 & 1<=p17]]]]]
normalized: [~ [EG [EG [~ [[[[p17<=1 & 1<=p17] | [p179<=0 & 0<=p179]] & EG [E [true U [p103<=1 & 1<=p103]]]]]]]] & ~ [E [EG [~ [[[[p17<=1 & 1<=p17] | [p179<=0 & 0<=p179]] & EG [E [true U [p103<=1 & 1<=p103]]]]]] U [EG [EX [~ [[p188<=1 & 1<=p188]]]] & EG [~ [[[[p17<=1 & 1<=p17] | [p179<=0 & 0<=p179]] & EG [E [true U [p103<=1 & 1<=p103]]]]]]]]]]

abstracting: (1<=p103)
states: 8,186,474,088 (9)
abstracting: (p103<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p179)
states: 151,819,193,674 (11)
abstracting: (p179<=0)
states: 138,247,626,826 (11)
abstracting: (1<=p17)
states: 5,721,595,768 (9)
abstracting: (p17<=1)
states: 151,819,193,674 (11)
....
EG iterations: 4
abstracting: (1<=p188)
states: 6,849,273,600 (9)
abstracting: (p188<=1)
states: 151,819,193,674 (11)
.......
EG iterations: 6
abstracting: (1<=p103)
states: 8,186,474,088 (9)
abstracting: (p103<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p179)
states: 151,819,193,674 (11)
abstracting: (p179<=0)
states: 138,247,626,826 (11)
abstracting: (1<=p17)
states: 5,721,595,768 (9)
abstracting: (p17<=1)
states: 151,819,193,674 (11)
....
EG iterations: 4
abstracting: (1<=p103)
states: 8,186,474,088 (9)
abstracting: (p103<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p179)
states: 151,819,193,674 (11)
abstracting: (p179<=0)
states: 138,247,626,826 (11)
abstracting: (1<=p17)
states: 5,721,595,768 (9)
abstracting: (p17<=1)
states: 151,819,193,674 (11)
....
EG iterations: 4
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.294sec

checking: AG [A [~ [[EF [[p4<=0 & 0<=p4]] | AG [[[p109<=0 & 0<=p109] | [p20<=1 & 1<=p20]]]]] U EX [E [EF [[p88<=1 & 1<=p88]] U AX [[p181<=0 & 0<=p181]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [E [E [true U [p88<=1 & 1<=p88]] U ~ [EX [~ [[p181<=0 & 0<=p181]]]]]]]]] & ~ [E [~ [EX [E [E [true U [p88<=1 & 1<=p88]] U ~ [EX [~ [[p181<=0 & 0<=p181]]]]]]] U [[~ [E [true U ~ [[[p20<=1 & 1<=p20] | [p109<=0 & 0<=p109]]]]] | E [true U [p4<=0 & 0<=p4]]] & ~ [EX [E [E [true U [p88<=1 & 1<=p88]] U ~ [EX [~ [[p181<=0 & 0<=p181]]]]]]]]]]]]]]

abstracting: (0<=p181)
states: 151,819,193,674 (11)
abstracting: (p181<=0)
states: 136,239,588,874 (11)
.abstracting: (1<=p88)
states: 5,986,729,192 (9)
abstracting: (p88<=1)
states: 151,819,193,674 (11)
.abstracting: (0<=p4)
states: 151,819,193,674 (11)
abstracting: (p4<=0)
states: 126,166,154,262 (11)
abstracting: (0<=p109)
states: 151,819,193,674 (11)
abstracting: (p109<=0)
states: 150,680,944,436 (11)
abstracting: (1<=p20)
states: 5,721,595,768 (9)
abstracting: (p20<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p181)
states: 151,819,193,674 (11)
abstracting: (p181<=0)
states: 136,239,588,874 (11)
.abstracting: (1<=p88)
states: 5,986,729,192 (9)
abstracting: (p88<=1)
states: 151,819,193,674 (11)
.abstracting: (0<=p181)
states: 151,819,193,674 (11)
abstracting: (p181<=0)
states: 136,239,588,874 (11)
.abstracting: (1<=p88)
states: 5,986,729,192 (9)
abstracting: (p88<=1)
states: 151,819,193,674 (11)
.....................
EG iterations: 20
-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.544sec

checking: AF [[[AG [~ [[p121<=1 & 1<=p121]]] | A [[p60<=1 & 1<=p60] U [p175<=1 & 1<=p175]]] & [[p12<=1 & 1<=p12] | EF [[[p109<=0 & 0<=p109] & [p31<=1 & 1<=p31]]]]]]
normalized: ~ [EG [~ [[[E [true U [[p109<=0 & 0<=p109] & [p31<=1 & 1<=p31]]] | [p12<=1 & 1<=p12]] & [[~ [EG [~ [[p175<=1 & 1<=p175]]]] & ~ [E [~ [[p175<=1 & 1<=p175]] U [~ [[p60<=1 & 1<=p60]] & ~ [[p175<=1 & 1<=p175]]]]]] | ~ [E [true U [p121<=1 & 1<=p121]]]]]]]]

abstracting: (1<=p121)
states: 6,226,363,621 (9)
abstracting: (p121<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p175)
states: 2,676,650,184 (9)
abstracting: (p175<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p60)
states: 7,974,504,488 (9)
abstracting: (p60<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p175)
states: 2,676,650,184 (9)
abstracting: (p175<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p175)
states: 2,676,650,184 (9)
abstracting: (p175<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (1<=p12)
states: 3,095,904 (6)
abstracting: (p12<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p31)
states: 5,721,595,768 (9)
abstracting: (p31<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p109)
states: 151,819,193,674 (11)
abstracting: (p109<=0)
states: 150,680,944,436 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.398sec

checking: EF [AG [A [[AF [[[p118<=0 & 0<=p118] | [p96<=1 & 1<=p96]]] & A [[p19<=1 & 1<=p19] U [p27<=1 & 1<=p27]]] U A [~ [[p59<=1 & 1<=p59]] U [[p15<=0 & 0<=p15] | [p152<=1 & 1<=p152]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [[~ [EG [~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]]]] & ~ [E [~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]] U [[p59<=1 & 1<=p59] & ~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]]]] & ~ [E [~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]] U [[p59<=1 & 1<=p59] & ~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]]]]]]] U [~ [[[~ [EG [~ [[p27<=1 & 1<=p27]]]] & ~ [E [~ [[p27<=1 & 1<=p27]] U [~ [[p19<=1 & 1<=p19]] & ~ [[p27<=1 & 1<=p27]]]]]] & ~ [EG [~ [[[p96<=1 & 1<=p96] | [p118<=0 & 0<=p118]]]]]]] & ~ [[~ [EG [~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]]]] & ~ [E [~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]] U [[p59<=1 & 1<=p59] & ~ [[[p152<=1 & 1<=p152] | [p15<=0 & 0<=p15]]]]]]]]]]]]]]]]

abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p59)
states: 7,974,504,488 (9)
abstracting: (p59<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
.............
EG iterations: 13
abstracting: (0<=p118)
states: 151,819,193,674 (11)
abstracting: (p118<=0)
states: 145,592,830,053 (11)
abstracting: (1<=p96)
states: 8,168,405,688 (9)
abstracting: (p96<=1)
states: 151,819,193,674 (11)
.........
EG iterations: 9
abstracting: (1<=p27)
states: 5,721,595,768 (9)
abstracting: (p27<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p19)
states: 5,721,595,768 (9)
abstracting: (p19<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p27)
states: 5,721,595,768 (9)
abstracting: (p27<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p27)
states: 5,721,595,768 (9)
abstracting: (p27<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p59)
states: 7,974,504,488 (9)
abstracting: (p59<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
.............
EG iterations: 13
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p59)
states: 7,974,504,488 (9)
abstracting: (p59<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p15)
states: 151,819,193,674 (11)
abstracting: (p15<=0)
states: 150,417,294,202 (11)
abstracting: (1<=p152)
states: 7,801,586,813 (9)
abstracting: (p152<=1)
states: 151,819,193,674 (11)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.665sec

checking: [AF [AX [AX [[p6<=1 & 1<=p6]]]] | E [EG [AG [[[[p197<=0 & 0<=p197] | [p167<=1 & 1<=p167]] & ~ [[p170<=0 & 0<=p170]]]]] U ~ [[AF [[p160<=0 & 0<=p160]] & [EG [AG [[p48<=0 & 0<=p48]]] | AG [[[p132<=1 & 1<=p132] | [p199<=0 & 0<=p199]]]]]]]]
normalized: [E [EG [~ [E [true U ~ [[~ [[p170<=0 & 0<=p170]] & [[p167<=1 & 1<=p167] | [p197<=0 & 0<=p197]]]]]]] U ~ [[[~ [E [true U ~ [[[p199<=0 & 0<=p199] | [p132<=1 & 1<=p132]]]]] | EG [~ [E [true U ~ [[p48<=0 & 0<=p48]]]]]] & ~ [EG [~ [[p160<=0 & 0<=p160]]]]]]] | ~ [EG [EX [EX [~ [[p6<=1 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 24,982,395,949 (10)
abstracting: (p6<=1)
states: 151,819,193,674 (11)
.......
EG iterations: 5
abstracting: (0<=p160)
states: 151,819,193,674 (11)
abstracting: (p160<=0)
states: 144,017,606,861 (11)
.......
EG iterations: 7
abstracting: (0<=p48)
states: 151,819,193,674 (11)
abstracting: (p48<=0)
states: 151,691,897,674 (11)
.
EG iterations: 1
abstracting: (1<=p132)
states: 6,226,363,621 (9)
abstracting: (p132<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p199)
states: 151,819,193,674 (11)
abstracting: (p199<=0)
states: 132,962,413,546 (11)
abstracting: (0<=p197)
states: 151,819,193,674 (11)
abstracting: (p197<=0)
states: 143,214,327,658 (11)
abstracting: (1<=p167)
states: 36,862,770,276 (10)
abstracting: (p167<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p170)
states: 151,819,193,674 (11)
abstracting: (p170<=0)
states: 150,561,596,746 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-10-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.829sec

checking: AG [[AG [[AG [AF [[p33<=1 & 1<=p33]]] | EF [[[p162<=0 & 0<=p162] | [p7<=1 & 1<=p7]]]]] | E [[[p170<=0 & 0<=p170] | [p6<=1 & 1<=p6]] U [[[p53<=0 & 0<=p53] | [p163<=1 & 1<=p163]] & AX [[p87<=0 & 0<=p87]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[~ [E [true U EG [~ [[p33<=1 & 1<=p33]]]]] | E [true U [[p7<=1 & 1<=p7] | [p162<=0 & 0<=p162]]]]]]] | E [[[p6<=1 & 1<=p6] | [p170<=0 & 0<=p170]] U [~ [EX [~ [[p87<=0 & 0<=p87]]]] & [[p163<=1 & 1<=p163] | [p53<=0 & 0<=p53]]]]]]]]

abstracting: (0<=p53)
states: 151,819,193,674 (11)
abstracting: (p53<=0)
states: 143,860,741,586 (11)
abstracting: (1<=p163)
states: 775,878,382 (8)
abstracting: (p163<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p87)
states: 151,819,193,674 (11)
abstracting: (p87<=0)
states: 142,920,088,754 (11)
.abstracting: (0<=p170)
states: 151,819,193,674 (11)
abstracting: (p170<=0)
states: 150,561,596,746 (11)
abstracting: (1<=p6)
states: 24,982,395,949 (10)
abstracting: (p6<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p162)
states: 151,819,193,674 (11)
abstracting: (p162<=0)
states: 150,971,684,400 (11)
abstracting: (1<=p7)
states: 24,982,395,949 (10)
abstracting: (p7<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p33)
states: 5,721,595,768 (9)
abstracting: (p33<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.993sec

checking: AG [~ [E [~ [AF [[p186<=1 & 1<=p186]]] U ~ [[[[[p144<=0 & 0<=p144] | [p67<=1 & 1<=p67]] & ~ [[[p152<=0 & 0<=p152] | [p134<=1 & 1<=p134]]]] | E [[p126<=1 & 1<=p126] U [[p120<=0 & 0<=p120] | [p73<=1 & 1<=p73]]]]]]]]
normalized: ~ [E [true U E [EG [~ [[p186<=1 & 1<=p186]]] U ~ [[E [[p126<=1 & 1<=p126] U [[p73<=1 & 1<=p73] | [p120<=0 & 0<=p120]]] | [~ [[[p134<=1 & 1<=p134] | [p152<=0 & 0<=p152]]] & [[p67<=1 & 1<=p67] | [p144<=0 & 0<=p144]]]]]]]]

abstracting: (0<=p144)
states: 151,819,193,674 (11)
abstracting: (p144<=0)
states: 144,019,478,861 (11)
abstracting: (1<=p67)
states: 89,781,216 (7)
abstracting: (p67<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p152)
states: 151,819,193,674 (11)
abstracting: (p152<=0)
states: 144,017,606,861 (11)
abstracting: (1<=p134)
states: 6,226,363,621 (9)
abstracting: (p134<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p120)
states: 151,819,193,674 (11)
abstracting: (p120<=0)
states: 145,592,830,053 (11)
abstracting: (1<=p73)
states: 8,899,104,920 (9)
abstracting: (p73<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p126)
states: 6,226,363,621 (9)
abstracting: (p126<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p186)
states: 16,725,852,000 (10)
abstracting: (p186<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 1.221sec

checking: [EX [AG [EF [[[p126<=0 & 0<=p126] & [[p40<=0 & 0<=p40] | [p42<=1 & 1<=p42]]]]]] | [EF [[EX [[[p175<=0 & 0<=p175] | [[p84<=0 & 0<=p84] & [p56<=1 & 1<=p56]]]] & AG [[[p2<=0 & 0<=p2] | [p71<=1 & 1<=p71]]]]] & AF [[AG [~ [A [[[p119<=0 & 0<=p119] | [p191<=1 & 1<=p191]] U [[p103<=0 & 0<=p103] | [p47<=1 & 1<=p47]]]]] | [[~ [E [[[p88<=0 & 0<=p88] | [p8<=1 & 1<=p8]] U [p92<=0 & 0<=p92]]] | [[p121<=0 & 0<=p121] & [p87<=1 & 1<=p87]]] & AF [[[p100<=0 & 0<=p100] & [p139<=1 & 1<=p139]]]]]]]]
normalized: [[E [true U [EX [[[[p56<=1 & 1<=p56] & [p84<=0 & 0<=p84]] | [p175<=0 & 0<=p175]]] & ~ [E [true U ~ [[[p71<=1 & 1<=p71] | [p2<=0 & 0<=p2]]]]]]] & ~ [EG [~ [[[~ [EG [~ [[[p139<=1 & 1<=p139] & [p100<=0 & 0<=p100]]]]] & [[[p87<=1 & 1<=p87] & [p121<=0 & 0<=p121]] | ~ [E [[[p8<=1 & 1<=p8] | [p88<=0 & 0<=p88]] U [p92<=0 & 0<=p92]]]]] | ~ [E [true U [~ [EG [~ [[[p47<=1 & 1<=p47] | [p103<=0 & 0<=p103]]]]] & ~ [E [~ [[[p47<=1 & 1<=p47] | [p103<=0 & 0<=p103]]] U [~ [[[p191<=1 & 1<=p191] | [p119<=0 & 0<=p119]]] & ~ [[[p47<=1 & 1<=p47] | [p103<=0 & 0<=p103]]]]]]]]]]]]]] | EX [~ [E [true U ~ [E [true U [[[p42<=1 & 1<=p42] | [p40<=0 & 0<=p40]] & [p126<=0 & 0<=p126]]]]]]]]

abstracting: (0<=p126)
states: 151,819,193,674 (11)
abstracting: (p126<=0)
states: 145,592,830,053 (11)
abstracting: (0<=p40)
states: 151,819,193,674 (11)
abstracting: (p40<=0)
states: 150,162,359,626 (11)
abstracting: (1<=p42)
states: 1,678,192,840 (9)
abstracting: (p42<=1)
states: 151,819,193,674 (11)
.abstracting: (0<=p103)
states: 151,819,193,674 (11)
abstracting: (p103<=0)
states: 143,632,719,586 (11)
abstracting: (1<=p47)
states: 7,974,504,488 (9)
abstracting: (p47<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p119)
states: 151,819,193,674 (11)
abstracting: (p119<=0)
states: 145,592,830,053 (11)
abstracting: (1<=p191)
states: 7,625,416,320 (9)
abstracting: (p191<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p103)
states: 151,819,193,674 (11)
abstracting: (p103<=0)
states: 143,632,719,586 (11)
abstracting: (1<=p47)
states: 7,974,504,488 (9)
abstracting: (p47<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p103)
states: 151,819,193,674 (11)
abstracting: (p103<=0)
states: 143,632,719,586 (11)
abstracting: (1<=p47)
states: 7,974,504,488 (9)
abstracting: (p47<=1)
states: 151,819,193,674 (11)
.......
EG iterations: 7
abstracting: (0<=p92)
states: 151,819,193,674 (11)
abstracting: (p92<=0)
states: 143,632,719,586 (11)
abstracting: (0<=p88)
states: 151,819,193,674 (11)
abstracting: (p88<=0)
states: 145,832,464,482 (11)
abstracting: (1<=p8)
states: 2
abstracting: (p8<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p121)
states: 151,819,193,674 (11)
abstracting: (p121<=0)
states: 145,592,830,053 (11)
abstracting: (1<=p87)
states: 8,899,104,920 (9)
abstracting: (p87<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p100)
states: 151,819,193,674 (11)
abstracting: (p100<=0)
states: 143,632,719,586 (11)
abstracting: (1<=p139)
states: 223,491,605 (8)
abstracting: (p139<=1)
states: 151,819,193,674 (11)
....
EG iterations: 4
.
EG iterations: 1
abstracting: (0<=p2)
states: 151,819,193,674 (11)
abstracting: (p2<=0)
states: 126,077,706,121 (11)
abstracting: (1<=p71)
states: 5,390,390,128 (9)
abstracting: (p71<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p175)
states: 151,819,193,674 (11)
abstracting: (p175<=0)
states: 149,142,543,490 (11)
abstracting: (0<=p84)
states: 151,819,193,674 (11)
abstracting: (p84<=0)
states: 150,525,540,394 (11)
abstracting: (1<=p56)
states: 7,958,452,088 (9)
abstracting: (p56<=1)
states: 151,819,193,674 (11)
.-> the formula is TRUE

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

MC time: 0m 3.520sec

checking: E [AG [E [[AF [[p58<=0 & 0<=p58]] & EX [[[p66<=0 & 0<=p66] | [p174<=1 & 1<=p174]]]] U [AX [[p75<=0 & 0<=p75]] & [EG [[p60<=1 & 1<=p60]] & [[p162<=1 & 1<=p162] | [p90<=0 & 0<=p90]]]]]] U [A [[p37<=1 & 1<=p37] U [[A [[p166<=0 & 0<=p166] U [p93<=1 & 1<=p93]] | [~ [[[p185<=0 & 0<=p185] | [p116<=1 & 1<=p116]]] | ~ [[[[p76<=0 & 0<=p76] | [p177<=1 & 1<=p177]] & [[p200<=0 & 0<=p200] | [p87<=1 & 1<=p87]]]]]] & AG [AX [[p146<=0 & 0<=p146]]]]] & AG [[AG [[p196<=1 & 1<=p196]] | [[p69<=1 & 1<=p69] | ~ [[[p160<=0 & 0<=p160] | [p190<=1 & 1<=p190]]]]]]]]
normalized: E [~ [E [true U ~ [E [[EX [[[p174<=1 & 1<=p174] | [p66<=0 & 0<=p66]]] & ~ [EG [~ [[p58<=0 & 0<=p58]]]]] U [[[[p90<=0 & 0<=p90] | [p162<=1 & 1<=p162]] & EG [[p60<=1 & 1<=p60]]] & ~ [EX [~ [[p75<=0 & 0<=p75]]]]]]]]] U [[~ [EG [~ [[~ [E [true U EX [~ [[p146<=0 & 0<=p146]]]]] & [[~ [[[[p87<=1 & 1<=p87] | [p200<=0 & 0<=p200]] & [[p177<=1 & 1<=p177] | [p76<=0 & 0<=p76]]]] | ~ [[[p116<=1 & 1<=p116] | [p185<=0 & 0<=p185]]]] | [~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p166<=0 & 0<=p166]] & ~ [[p93<=1 & 1<=p93]]]]]]]]]]] & ~ [E [~ [[~ [E [true U EX [~ [[p146<=0 & 0<=p146]]]]] & [[~ [[[[p87<=1 & 1<=p87] | [p200<=0 & 0<=p200]] & [[p177<=1 & 1<=p177] | [p76<=0 & 0<=p76]]]] | ~ [[[p116<=1 & 1<=p116] | [p185<=0 & 0<=p185]]]] | [~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p166<=0 & 0<=p166]] & ~ [[p93<=1 & 1<=p93]]]]]]]]] U [~ [[~ [E [true U EX [~ [[p146<=0 & 0<=p146]]]]] & [[~ [[[[p87<=1 & 1<=p87] | [p200<=0 & 0<=p200]] & [[p177<=1 & 1<=p177] | [p76<=0 & 0<=p76]]]] | ~ [[[p116<=1 & 1<=p116] | [p185<=0 & 0<=p185]]]] | [~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p166<=0 & 0<=p166]] & ~ [[p93<=1 & 1<=p93]]]]]]]]] & ~ [[p37<=1 & 1<=p37]]]]]] & ~ [E [true U ~ [[[~ [[[p190<=1 & 1<=p190] | [p160<=0 & 0<=p160]]] | [p69<=1 & 1<=p69]] | ~ [E [true U ~ [[p196<=1 & 1<=p196]]]]]]]]]]

abstracting: (1<=p196)
states: 7,625,416,320 (9)
abstracting: (p196<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p69)
states: 5,986,729,192 (9)
abstracting: (p69<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p160)
states: 151,819,193,674 (11)
abstracting: (p160<=0)
states: 144,017,606,861 (11)
abstracting: (1<=p190)
states: 7,625,416,320 (9)
abstracting: (p190<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p37)
states: 5,721,595,768 (9)
abstracting: (p37<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p166)
states: 151,819,193,674 (11)
abstracting: (p166<=0)
states: 114,300,603,065 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p185)
states: 151,819,193,674 (11)
abstracting: (p185<=0)
states: 136,379,945,674 (11)
abstracting: (1<=p116)
states: 6,226,363,621 (9)
abstracting: (p116<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p76)
states: 151,819,193,674 (11)
abstracting: (p76<=0)
states: 142,920,088,754 (11)
abstracting: (1<=p177)
states: 5,193,201,600 (9)
abstracting: (p177<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p200)
states: 151,819,193,674 (11)
abstracting: (p200<=0)
states: 132,348,274,570 (11)
abstracting: (1<=p87)
states: 8,899,104,920 (9)
abstracting: (p87<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p146)
states: 151,819,193,674 (11)
abstracting: (p146<=0)
states: 144,019,478,861 (11)
.abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p166)
states: 151,819,193,674 (11)
abstracting: (p166<=0)
states: 114,300,603,065 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p185)
states: 151,819,193,674 (11)
abstracting: (p185<=0)
states: 136,379,945,674 (11)
abstracting: (1<=p116)
states: 6,226,363,621 (9)
abstracting: (p116<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p76)
states: 151,819,193,674 (11)
abstracting: (p76<=0)
states: 142,920,088,754 (11)
abstracting: (1<=p177)
states: 5,193,201,600 (9)
abstracting: (p177<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p200)
states: 151,819,193,674 (11)
abstracting: (p200<=0)
states: 132,348,274,570 (11)
abstracting: (1<=p87)
states: 8,899,104,920 (9)
abstracting: (p87<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p146)
states: 151,819,193,674 (11)
abstracting: (p146<=0)
states: 144,019,478,861 (11)
.abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p166)
states: 151,819,193,674 (11)
abstracting: (p166<=0)
states: 114,300,603,065 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
abstracting: (1<=p93)
states: 8,168,405,688 (9)
abstracting: (p93<=1)
states: 151,819,193,674 (11)
.
EG iterations: 1
abstracting: (0<=p185)
states: 151,819,193,674 (11)
abstracting: (p185<=0)
states: 136,379,945,674 (11)
abstracting: (1<=p116)
states: 6,226,363,621 (9)
abstracting: (p116<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p76)
states: 151,819,193,674 (11)
abstracting: (p76<=0)
states: 142,920,088,754 (11)
abstracting: (1<=p177)
states: 5,193,201,600 (9)
abstracting: (p177<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p200)
states: 151,819,193,674 (11)
abstracting: (p200<=0)
states: 132,348,274,570 (11)
abstracting: (1<=p87)
states: 8,899,104,920 (9)
abstracting: (p87<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p146)
states: 151,819,193,674 (11)
abstracting: (p146<=0)
states: 144,019,478,861 (11)
.............
EG iterations: 12
abstracting: (0<=p75)
states: 151,819,193,674 (11)
abstracting: (p75<=0)
states: 142,920,088,754 (11)
.abstracting: (1<=p60)
states: 7,974,504,488 (9)
abstracting: (p60<=1)
states: 151,819,193,674 (11)
.......
EG iterations: 7
abstracting: (1<=p162)
states: 847,509,274 (8)
abstracting: (p162<=1)
states: 151,819,193,674 (11)
abstracting: (0<=p90)
states: 151,819,193,674 (11)
abstracting: (p90<=0)
states: 150,680,944,436 (11)
abstracting: (0<=p58)
states: 151,819,193,674 (11)
abstracting: (p58<=0)
states: 143,844,689,186 (11)
.......
EG iterations: 7
abstracting: (0<=p66)
states: 151,819,193,674 (11)
abstracting: (p66<=0)
states: 143,844,689,186 (11)
abstracting: (1<=p174)
states: 2,470,754,016 (9)
abstracting: (p174<=1)
states: 151,819,193,674 (11)
.-> the formula is FALSE

FORMULA SmartHome-PT-10-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.105sec

totally nodes used: 22412784 (2.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 40137547 95596441 135733988
used/not used/entry size/cache size: 55155023 11953841 16 1024MB
basic ops cache: hits/miss/sum: 5291650 12063065 17354715
used/not used/entry size/cache size: 11828587 4948629 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: 168306 412606 580912
used/not used/entry size/cache size: 403040 7985568 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 49250087
1 14113907
2 3058022
3 580275
4 92626
5 12341
6 1456
7 137
8 13
9 0
>= 10 0

Total processing time: 0m54.545sec


BK_STOP 1679312026498

--------------------
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 CTLCardinality -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:14766 (63), effective:1524 (6)

initing FirstDep: 0m 0.000sec


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

iterations count:4529 (19), effective:393 (1)

iterations count:4274 (18), effective:354 (1)

iterations count:1945 (8), effective:200 (0)

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

iterations count:2184 (9), effective:196 (0)

iterations count:3534 (15), effective:270 (1)

iterations count:3534 (15), effective:270 (1)

iterations count:627 (2), effective:50 (0)

iterations count:3534 (15), effective:270 (1)

iterations count:291 (1), effective:8 (0)

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

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

iterations count:294 (1), effective:9 (0)

iterations count:291 (1), effective:8 (0)

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

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

iterations count:291 (1), effective:8 (0)

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

iterations count:4454 (19), effective:392 (1)

iterations count:1920 (8), effective:145 (0)

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

iterations count:1955 (8), effective:152 (0)

iterations count:344 (1), effective:18 (0)

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

iterations count:344 (1), effective:18 (0)

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

iterations count:344 (1), effective:18 (0)

iterations count:4352 (18), effective:376 (1)

iterations count:2074 (8), effective:222 (0)

iterations count:4391 (19), effective:369 (1)

iterations count:3008 (13), effective:270 (1)

iterations count:1036 (4), effective:113 (0)

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

iterations count:2117 (9), effective:202 (0)

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

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

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

iterations count:1928 (8), effective:146 (0)

iterations count:378 (1), effective:26 (0)

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

iterations count:545 (2), effective:27 (0)

iterations count:527 (2), effective:46 (0)

iterations count:2868 (12), effective:239 (1)

iterations count:386 (1), effective:8 (0)

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

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

iterations count:3823 (16), effective:290 (1)

iterations count:3779 (16), effective:294 (1)

iterations count:3823 (16), effective:290 (1)

iterations count:3779 (16), effective:294 (1)

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

iterations count:3823 (16), effective:290 (1)

iterations count:3779 (16), effective:294 (1)

iterations count:4562 (19), effective:393 (1)

iterations count:1860 (8), effective:194 (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="CTLCardinality"
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 CTLCardinality"
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-167912650000225"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;