About the Execution of LTSMin+red for DES-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15956.247 | 3588691.00 | 14308122.00 | 383.80 | ?????????F?????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481100402.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 ltsminxred
Input is DES-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481100402
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 73K Mar 5 18:22 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 DES-PT-05b-CTLFireability-00
FORMULA_NAME DES-PT-05b-CTLFireability-01
FORMULA_NAME DES-PT-05b-CTLFireability-02
FORMULA_NAME DES-PT-05b-CTLFireability-03
FORMULA_NAME DES-PT-05b-CTLFireability-04
FORMULA_NAME DES-PT-05b-CTLFireability-05
FORMULA_NAME DES-PT-05b-CTLFireability-06
FORMULA_NAME DES-PT-05b-CTLFireability-07
FORMULA_NAME DES-PT-05b-CTLFireability-08
FORMULA_NAME DES-PT-05b-CTLFireability-09
FORMULA_NAME DES-PT-05b-CTLFireability-10
FORMULA_NAME DES-PT-05b-CTLFireability-11
FORMULA_NAME DES-PT-05b-CTLFireability-12
FORMULA_NAME DES-PT-05b-CTLFireability-13
FORMULA_NAME DES-PT-05b-CTLFireability-14
FORMULA_NAME DES-PT-05b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678291670814
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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 16:07:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 16:07:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 16:07:52] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 16:07:52] [INFO ] Transformed 300 places.
[2023-03-08 16:07:52] [INFO ] Transformed 251 transitions.
[2023-03-08 16:07:52] [INFO ] Found NUPN structural information;
[2023-03-08 16:07:52] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 158 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 286 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 286 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 282 transition count 236
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 282 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 282 transition count 234
Applied a total of 35 rules in 49 ms. Remains 282 /300 variables (removed 18) and now considering 234/251 (removed 17) transitions.
// Phase 1: matrix 234 rows 282 cols
[2023-03-08 16:07:52] [INFO ] Computed 62 place invariants in 32 ms
[2023-03-08 16:07:53] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-08 16:07:53] [INFO ] Invariant cache hit.
[2023-03-08 16:07:53] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-08 16:07:53] [INFO ] Invariant cache hit.
[2023-03-08 16:07:53] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/300 places, 234/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 951 ms. Remains : 282/300 places, 234/251 transitions.
Support contains 158 out of 282 places after structural reductions.
[2023-03-08 16:07:53] [INFO ] Flatten gal took : 45 ms
[2023-03-08 16:07:53] [INFO ] Flatten gal took : 19 ms
[2023-03-08 16:07:53] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 100) seen :82
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-08 16:07:54] [INFO ] Invariant cache hit.
[2023-03-08 16:07:54] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 16:07:54] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 16:07:54] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-08 16:07:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 16:07:55] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 16:07:55] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :11
[2023-03-08 16:07:55] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
[2023-03-08 16:07:55] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-08 16:07:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-08 16:07:55] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2023-03-08 16:07:55] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2023-03-08 16:07:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 370 ms
[2023-03-08 16:07:55] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2023-03-08 16:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 325 ms
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2023-03-08 16:07:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-08 16:07:56] [INFO ] After 1753ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :11
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-08 16:07:57] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :11
Fused 18 Parikh solutions to 11 different solutions.
Parikh walk visited 1 properties in 173 ms.
Support contains 45 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 234/234 transitions.
Graph (complete) has 530 edges and 282 vertex of which 278 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 278 transition count 216
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 266 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 265 transition count 215
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 29 place count 265 transition count 207
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 45 place count 257 transition count 207
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 54 place count 248 transition count 198
Iterating global reduction 3 with 9 rules applied. Total rules applied 63 place count 248 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 248 transition count 197
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 70 place count 242 transition count 191
Iterating global reduction 4 with 6 rules applied. Total rules applied 76 place count 242 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 82 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 82 place count 242 transition count 184
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 84 place count 241 transition count 184
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 190 place count 188 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 198 place count 184 transition count 140
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 202 place count 184 transition count 136
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 206 place count 180 transition count 136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 207 place count 180 transition count 135
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 180 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 209 place count 179 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 210 place count 178 transition count 133
Applied a total of 210 rules in 83 ms. Remains 178 /282 variables (removed 104) and now considering 133/234 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 178/282 places, 133/234 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 133 rows 178 cols
[2023-03-08 16:07:57] [INFO ] Computed 64 place invariants in 7 ms
[2023-03-08 16:07:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 16:07:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 16:07:57] [INFO ] [Nat]Absence check using 36 positive and 28 generalized place invariants in 23 ms returned sat
[2023-03-08 16:07:57] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 16:07:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 16:07:57] [INFO ] After 47ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 16:07:57] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-08 16:07:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 394 ms
[2023-03-08 16:07:58] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-08 16:07:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 16:07:58] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 16:07:58] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 54 ms.
Support contains 13 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 133/133 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 178 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 177 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 175 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 175 transition count 130
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 50 place count 153 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 153 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 150 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 150 transition count 102
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 70 place count 150 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 150 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 148 transition count 87
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 148 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 147 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 146 transition count 86
Applied a total of 78 rules in 53 ms. Remains 146 /178 variables (removed 32) and now considering 86/133 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 146/178 places, 86/133 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1353508 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 1353508 steps, saw 190201 distinct states, run finished after 3003 ms. (steps per millisecond=450 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 146 cols
[2023-03-08 16:08:01] [INFO ] Computed 63 place invariants in 8 ms
[2023-03-08 16:08:02] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 16:08:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:08:02] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-08 16:08:02] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 16:08:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 16:08:02] [INFO ] After 18ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 16:08:02] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-08 16:08:02] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-08 16:08:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-08 16:08:02] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-08 16:08:02] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 4 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 86/86 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 146 transition count 85
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 141 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 139 transition count 79
Applied a total of 12 rules in 15 ms. Remains 139 /146 variables (removed 7) and now considering 79/86 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 139/146 places, 79/86 transitions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2165675 steps, run timeout after 3001 ms. (steps per millisecond=721 ) properties seen :{}
Probabilistic random walk after 2165675 steps, saw 298939 distinct states, run finished after 3002 ms. (steps per millisecond=721 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 139 cols
[2023-03-08 16:08:05] [INFO ] Computed 63 place invariants in 3 ms
[2023-03-08 16:08:05] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:08:05] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-08 16:08:05] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:08:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:08:05] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 54 ms returned sat
[2023-03-08 16:08:05] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:08:05] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 16:08:05] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 79/79 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 139/139 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-08 16:08:05] [INFO ] Invariant cache hit.
[2023-03-08 16:08:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 16:08:05] [INFO ] Invariant cache hit.
[2023-03-08 16:08:05] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-08 16:08:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 16:08:05] [INFO ] Invariant cache hit.
[2023-03-08 16:08:05] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 139/139 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 16:08:05] [INFO ] Invariant cache hit.
[2023-03-08 16:08:06] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 16:08:06] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-08 16:08:06] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 16:08:06] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-08 16:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-08 16:08:06] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:08:06] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:08:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 16:08:06] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-08 16:08:06] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:08:06] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 16:08:06] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2023-03-08 16:08:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 15 ms
FORMULA DES-PT-05b-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 13 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 234 transitions.
Support contains 141 out of 282 places (down from 142) after GAL structural reductions.
Computed a total of 81 stabilizing places and 73 stable transitions
Graph (complete) has 530 edges and 282 vertex of which 274 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 271 transition count 223
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 271 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 271 transition count 222
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 263 transition count 214
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 263 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 263 transition count 207
Applied a total of 46 rules in 31 ms. Remains 263 /282 variables (removed 19) and now considering 207/234 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 263/282 places, 207/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 10 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 11 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Graph (complete) has 530 edges and 282 vertex of which 274 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 273 transition count 214
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 259 transition count 214
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 259 transition count 204
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 249 transition count 204
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 62 place count 236 transition count 191
Iterating global reduction 2 with 13 rules applied. Total rules applied 75 place count 236 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 236 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 235 transition count 188
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 88 place count 226 transition count 179
Iterating global reduction 4 with 9 rules applied. Total rules applied 97 place count 226 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 106 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 225 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 108 place count 225 transition count 167
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 112 place count 223 transition count 167
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 232 place count 163 transition count 107
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 163 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 161 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 160 transition count 105
Applied a total of 237 rules in 54 ms. Remains 160 /282 variables (removed 122) and now considering 105/234 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 160/282 places, 105/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 8 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 8 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 266 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 266 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 266 transition count 216
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 257 transition count 207
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 257 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 59 place count 257 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 256 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 256 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 256 transition count 198
Applied a total of 62 rules in 26 ms. Remains 256 /282 variables (removed 26) and now considering 198/234 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 256/282 places, 198/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 10 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 267 transition count 219
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 267 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 267 transition count 217
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 257 transition count 207
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 257 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 61 place count 257 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 256 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 256 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 256 transition count 196
Applied a total of 64 rules in 24 ms. Remains 256 /282 variables (removed 26) and now considering 196/234 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 256/282 places, 196/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 266 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 266 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 266 transition count 216
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 255 transition count 205
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 255 transition count 205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 255 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 254 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 254 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 254 transition count 194
Applied a total of 68 rules in 23 ms. Remains 254 /282 variables (removed 28) and now considering 194/234 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 254/282 places, 194/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Graph (complete) has 530 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 275 transition count 221
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 266 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 265 transition count 220
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 21 place count 265 transition count 210
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 41 place count 255 transition count 210
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 54 place count 242 transition count 197
Iterating global reduction 3 with 13 rules applied. Total rules applied 67 place count 242 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 242 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 241 transition count 194
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 79 place count 233 transition count 186
Iterating global reduction 5 with 8 rules applied. Total rules applied 87 place count 233 transition count 186
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 95 place count 233 transition count 178
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 97 place count 232 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 97 place count 232 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 99 place count 231 transition count 176
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 215 place count 173 transition count 118
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 217 place count 173 transition count 118
Applied a total of 217 rules in 46 ms. Remains 173 /282 variables (removed 109) and now considering 118/234 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 173/282 places, 118/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 6 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Graph (complete) has 530 edges and 282 vertex of which 274 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 273 transition count 217
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 262 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 261 transition count 216
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25 place count 261 transition count 205
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 47 place count 250 transition count 205
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 61 place count 236 transition count 191
Iterating global reduction 3 with 14 rules applied. Total rules applied 75 place count 236 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 78 place count 236 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 235 transition count 188
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 89 place count 225 transition count 178
Iterating global reduction 5 with 10 rules applied. Total rules applied 99 place count 225 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 109 place count 225 transition count 168
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 111 place count 224 transition count 167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 111 place count 224 transition count 164
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 117 place count 221 transition count 164
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 128 rules applied. Total rules applied 245 place count 157 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 157 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 248 place count 155 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 249 place count 154 transition count 98
Applied a total of 249 rules in 35 ms. Remains 154 /282 variables (removed 128) and now considering 98/234 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 154/282 places, 98/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 5 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 5 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 267 transition count 219
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 267 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 267 transition count 217
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 257 transition count 207
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 257 transition count 207
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 257 transition count 199
Applied a total of 60 rules in 11 ms. Remains 257 /282 variables (removed 25) and now considering 199/234 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 257/282 places, 199/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 8 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 10 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Graph (complete) has 530 edges and 282 vertex of which 274 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 273 transition count 216
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 261 transition count 216
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 25 place count 261 transition count 206
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 45 place count 251 transition count 206
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 57 place count 239 transition count 194
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 239 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 239 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 238 transition count 191
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 82 place count 229 transition count 182
Iterating global reduction 4 with 9 rules applied. Total rules applied 91 place count 229 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 99 place count 229 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 99 place count 229 transition count 172
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 103 place count 227 transition count 172
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 225 place count 166 transition count 111
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 166 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 166 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 164 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 163 transition count 108
Applied a total of 231 rules in 35 ms. Remains 163 /282 variables (removed 119) and now considering 108/234 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 163/282 places, 108/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 5 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 5 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 266 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 266 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 266 transition count 216
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 257 transition count 207
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 257 transition count 207
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 257 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 256 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 256 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 256 transition count 197
Applied a total of 63 rules in 12 ms. Remains 256 /282 variables (removed 26) and now considering 197/234 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 256/282 places, 197/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 8 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 271 transition count 223
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 271 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 271 transition count 222
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 263 transition count 214
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 263 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 263 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 262 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 262 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 262 transition count 205
Applied a total of 49 rules in 11 ms. Remains 262 /282 variables (removed 20) and now considering 205/234 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 262/282 places, 205/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:06] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 267 transition count 219
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 267 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 267 transition count 218
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 42 place count 256 transition count 207
Iterating global reduction 1 with 11 rules applied. Total rules applied 53 place count 256 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 62 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 255 transition count 196
Applied a total of 65 rules in 11 ms. Remains 255 /282 variables (removed 27) and now considering 196/234 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 255/282 places, 196/234 transitions.
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:06] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:07] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Graph (complete) has 530 edges and 282 vertex of which 274 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 273 transition count 216
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 261 transition count 216
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 261 transition count 205
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 250 transition count 205
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 236 transition count 191
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 236 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 236 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 235 transition count 188
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 88 place count 226 transition count 179
Iterating global reduction 4 with 9 rules applied. Total rules applied 97 place count 226 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 106 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 225 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 108 place count 225 transition count 167
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 112 place count 223 transition count 167
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 236 place count 161 transition count 105
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 161 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 159 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 241 place count 158 transition count 103
Applied a total of 241 rules in 33 ms. Remains 158 /282 variables (removed 124) and now considering 103/234 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 158/282 places, 103/234 transitions.
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 6 ms
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 5 ms
[2023-03-08 16:08:07] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 266 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 266 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 266 transition count 216
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 256 transition count 206
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 256 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 62 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 255 transition count 196
Applied a total of 65 rules in 11 ms. Remains 255 /282 variables (removed 27) and now considering 196/234 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 255/282 places, 196/234 transitions.
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:07] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 234/234 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 270 transition count 222
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 270 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 270 transition count 220
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 262 transition count 212
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 262 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 48 place count 262 transition count 206
Applied a total of 48 rules in 8 ms. Remains 262 /282 variables (removed 20) and now considering 206/234 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 262/282 places, 206/234 transitions.
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 7 ms
[2023-03-08 16:08:07] [INFO ] Input system was already deterministic with 206 transitions.
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:07] [INFO ] Flatten gal took : 9 ms
[2023-03-08 16:08:07] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-08 16:08:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 234 transitions and 704 arcs took 1 ms.
Total runtime 14904 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/605/ctl_0_ --ctl=/tmp/605/ctl_1_ --ctl=/tmp/605/ctl_2_ --ctl=/tmp/605/ctl_3_ --ctl=/tmp/605/ctl_4_ --ctl=/tmp/605/ctl_5_ --ctl=/tmp/605/ctl_6_ --ctl=/tmp/605/ctl_7_ --ctl=/tmp/605/ctl_8_ --ctl=/tmp/605/ctl_9_ --ctl=/tmp/605/ctl_10_ --ctl=/tmp/605/ctl_11_ --ctl=/tmp/605/ctl_12_ --ctl=/tmp/605/ctl_13_ --ctl=/tmp/605/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 195940 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16095392 kB
Could not compute solution for formula : DES-PT-05b-CTLFireability-00
Could not compute solution for formula : DES-PT-05b-CTLFireability-01
Could not compute solution for formula : DES-PT-05b-CTLFireability-02
Could not compute solution for formula : DES-PT-05b-CTLFireability-03
Could not compute solution for formula : DES-PT-05b-CTLFireability-04
Could not compute solution for formula : DES-PT-05b-CTLFireability-05
Could not compute solution for formula : DES-PT-05b-CTLFireability-06
Could not compute solution for formula : DES-PT-05b-CTLFireability-07
Could not compute solution for formula : DES-PT-05b-CTLFireability-08
Could not compute solution for formula : DES-PT-05b-CTLFireability-10
Could not compute solution for formula : DES-PT-05b-CTLFireability-11
Could not compute solution for formula : DES-PT-05b-CTLFireability-12
Could not compute solution for formula : DES-PT-05b-CTLFireability-13
Could not compute solution for formula : DES-PT-05b-CTLFireability-14
Could not compute solution for formula : DES-PT-05b-CTLFireability-15
BK_STOP 1678295259505
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name DES-PT-05b-CTLFireability-00
ctl formula formula --ctl=/tmp/605/ctl_0_
ctl formula name DES-PT-05b-CTLFireability-01
ctl formula formula --ctl=/tmp/605/ctl_1_
ctl formula name DES-PT-05b-CTLFireability-02
ctl formula formula --ctl=/tmp/605/ctl_2_
ctl formula name DES-PT-05b-CTLFireability-03
ctl formula formula --ctl=/tmp/605/ctl_3_
ctl formula name DES-PT-05b-CTLFireability-04
ctl formula formula --ctl=/tmp/605/ctl_4_
ctl formula name DES-PT-05b-CTLFireability-05
ctl formula formula --ctl=/tmp/605/ctl_5_
ctl formula name DES-PT-05b-CTLFireability-06
ctl formula formula --ctl=/tmp/605/ctl_6_
ctl formula name DES-PT-05b-CTLFireability-07
ctl formula formula --ctl=/tmp/605/ctl_7_
ctl formula name DES-PT-05b-CTLFireability-08
ctl formula formula --ctl=/tmp/605/ctl_8_
ctl formula name DES-PT-05b-CTLFireability-10
ctl formula formula --ctl=/tmp/605/ctl_9_
ctl formula name DES-PT-05b-CTLFireability-11
ctl formula formula --ctl=/tmp/605/ctl_10_
ctl formula name DES-PT-05b-CTLFireability-12
ctl formula formula --ctl=/tmp/605/ctl_11_
ctl formula name DES-PT-05b-CTLFireability-13
ctl formula formula --ctl=/tmp/605/ctl_12_
ctl formula name DES-PT-05b-CTLFireability-14
ctl formula formula --ctl=/tmp/605/ctl_13_
ctl formula name DES-PT-05b-CTLFireability-15
ctl formula formula --ctl=/tmp/605/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 282 places, 234 transitions and 704 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 234->232 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 282; there are 232 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 9994261 group checks and 0 next state calls
pnml2lts-sym: reachability took 67.280 real 268.760 user 0.130 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.120 real 0.460 user 0.000 sys
pnml2lts-sym: state space has 1.05887817567047e+20 states, 332148 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 611
Killing (9) : 611
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="DES-PT-05b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-05b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481100402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;