fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r109-tall-171624207900133
Last Updated
July 7, 2024

About the Execution of 2023-gold for CloudReconfiguration-PT-313

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1882.544 177102.00 316479.00 859.10 FFTFFTFTFFFFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624207900133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CloudReconfiguration-PT-313, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624207900133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 19:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 19:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 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 CloudReconfiguration-PT-313-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-313-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716307125039

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-313
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:58:46] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-21 15:58:46] [INFO ] Transformed 2585 places.
[2024-05-21 15:58:46] [INFO ] Transformed 3095 transitions.
[2024-05-21 15:58:46] [INFO ] Found NUPN structural information;
[2024-05-21 15:58:46] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-313-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 2068 transition count 2578
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 2068 transition count 2578
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1062 place count 2068 transition count 2550
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1301 place count 1829 transition count 2311
Iterating global reduction 1 with 239 rules applied. Total rules applied 1540 place count 1829 transition count 2311
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1630 place count 1739 transition count 2221
Iterating global reduction 1 with 90 rules applied. Total rules applied 1720 place count 1739 transition count 2221
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1738 place count 1739 transition count 2203
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1785 place count 1692 transition count 2156
Iterating global reduction 2 with 47 rules applied. Total rules applied 1832 place count 1692 transition count 2156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1840 place count 1692 transition count 2148
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1878 place count 1654 transition count 2106
Iterating global reduction 3 with 38 rules applied. Total rules applied 1916 place count 1654 transition count 2106
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1943 place count 1627 transition count 2079
Iterating global reduction 3 with 27 rules applied. Total rules applied 1970 place count 1627 transition count 2079
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1996 place count 1601 transition count 2053
Iterating global reduction 3 with 26 rules applied. Total rules applied 2022 place count 1601 transition count 2053
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2048 place count 1575 transition count 2027
Iterating global reduction 3 with 26 rules applied. Total rules applied 2074 place count 1575 transition count 2027
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2096 place count 1553 transition count 1991
Iterating global reduction 3 with 22 rules applied. Total rules applied 2118 place count 1553 transition count 1991
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2126 place count 1545 transition count 1978
Iterating global reduction 3 with 8 rules applied. Total rules applied 2134 place count 1545 transition count 1978
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2141 place count 1538 transition count 1970
Iterating global reduction 3 with 7 rules applied. Total rules applied 2148 place count 1538 transition count 1970
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2151 place count 1538 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2152 place count 1537 transition count 1966
Iterating global reduction 4 with 1 rules applied. Total rules applied 2153 place count 1537 transition count 1966
Applied a total of 2153 rules in 1520 ms. Remains 1537 /2585 variables (removed 1048) and now considering 1966/3095 (removed 1129) transitions.
// Phase 1: matrix 1966 rows 1537 cols
[2024-05-21 15:58:48] [INFO ] Computed 4 invariants in 34 ms
[2024-05-21 15:58:49] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-21 15:58:49] [INFO ] Invariant cache hit.
[2024-05-21 15:58:50] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-21 15:58:50] [INFO ] Invariant cache hit.
[2024-05-21 15:58:50] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1537/2585 places, 1966/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3739 ms. Remains : 1537/2585 places, 1966/3095 transitions.
Support contains 25 out of 1537 places after structural reductions.
[2024-05-21 15:58:51] [INFO ] Flatten gal took : 128 ms
[2024-05-21 15:58:51] [INFO ] Flatten gal took : 73 ms
[2024-05-21 15:58:51] [INFO ] Input system was already deterministic with 1966 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2024-05-21 15:58:52] [INFO ] Invariant cache hit.
[2024-05-21 15:58:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:58:55] [INFO ] After 3139ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2024-05-21 15:58:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:58:58] [INFO ] After 1830ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2024-05-21 15:59:00] [INFO ] After 3917ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 1140 ms.
[2024-05-21 15:59:01] [INFO ] After 6219ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 18 different solutions.
Parikh walk visited 16 properties in 164 ms.
Support contains 5 out of 1537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1866 edges and 1537 vertex of which 687 / 1537 are part of one of the 63 SCC in 7 ms
Free SCC test removed 624 places
Drop transitions removed 786 transitions
Reduce isomorphic transitions removed 786 transitions.
Graph (complete) has 1355 edges and 913 vertex of which 904 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 512 rules applied. Total rules applied 514 place count 904 transition count 664
Reduce places removed 505 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 558 rules applied. Total rules applied 1072 place count 399 transition count 611
Reduce places removed 34 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 38 rules applied. Total rules applied 1110 place count 365 transition count 607
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1116 place count 361 transition count 605
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1116 place count 361 transition count 556
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1214 place count 312 transition count 556
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1226 place count 300 transition count 538
Iterating global reduction 4 with 12 rules applied. Total rules applied 1238 place count 300 transition count 538
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1240 place count 300 transition count 536
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1242 place count 298 transition count 536
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1249 place count 291 transition count 528
Iterating global reduction 6 with 7 rules applied. Total rules applied 1256 place count 291 transition count 528
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 1262 place count 291 transition count 522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1263 place count 290 transition count 522
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1264 place count 289 transition count 520
Iterating global reduction 8 with 1 rules applied. Total rules applied 1265 place count 289 transition count 520
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1266 place count 288 transition count 518
Iterating global reduction 8 with 1 rules applied. Total rules applied 1267 place count 288 transition count 518
Performed 150 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 8 with 300 rules applied. Total rules applied 1567 place count 138 transition count 273
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1588 place count 138 transition count 252
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1592 place count 134 transition count 248
Iterating global reduction 9 with 4 rules applied. Total rules applied 1596 place count 134 transition count 248
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1597 place count 133 transition count 247
Iterating global reduction 9 with 1 rules applied. Total rules applied 1598 place count 133 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1599 place count 133 transition count 246
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1625 place count 120 transition count 230
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1640 place count 120 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1642 place count 119 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1645 place count 119 transition count 211
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1711 place count 86 transition count 243
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1738 place count 86 transition count 216
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 1758 place count 66 transition count 176
Iterating global reduction 13 with 20 rules applied. Total rules applied 1778 place count 66 transition count 176
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1788 place count 66 transition count 166
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1794 place count 60 transition count 154
Iterating global reduction 14 with 6 rules applied. Total rules applied 1800 place count 60 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1806 place count 60 transition count 148
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1812 place count 60 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1814 place count 59 transition count 141
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 1819 place count 59 transition count 136
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1825 place count 54 transition count 135
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1827 place count 54 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1828 place count 54 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1829 place count 53 transition count 132
Applied a total of 1829 rules in 151 ms. Remains 53 /1537 variables (removed 1484) and now considering 132/1966 (removed 1834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 53/1537 places, 132/1966 transitions.
Finished random walk after 1142 steps, including 18 resets, run visited all 4 properties in 14 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2145 edges and 1537 vertex of which 1528 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(G(p1)))||F(p2))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1521 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1518 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1516 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Applied a total of 60 rules in 686 ms. Remains 1508 /1537 variables (removed 29) and now considering 1930/1966 (removed 36) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 15:59:02] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 15:59:03] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 15:59:03] [INFO ] Invariant cache hit.
[2024-05-21 15:59:03] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2024-05-21 15:59:03] [INFO ] Invariant cache hit.
[2024-05-21 15:59:04] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1537 places, 1930/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2632 ms. Remains : 1508/1537 places, 1930/1966 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s176 1), p2:(EQ s955 1), p1:(EQ s687 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 5 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-00 finished in 3017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1873 edges and 1537 vertex of which 682 / 1537 are part of one of the 63 SCC in 4 ms
Free SCC test removed 619 places
Ensure Unique test removed 719 transitions
Reduce isomorphic transitions removed 719 transitions.
Graph (complete) has 1422 edges and 918 vertex of which 909 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 908 transition count 742
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 526 rules applied. Total rules applied 1027 place count 409 transition count 715
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1041 place count 395 transition count 715
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1041 place count 395 transition count 669
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1133 place count 349 transition count 669
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1148 place count 334 transition count 644
Iterating global reduction 3 with 15 rules applied. Total rules applied 1163 place count 334 transition count 644
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1165 place count 334 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1167 place count 332 transition count 642
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1177 place count 322 transition count 627
Iterating global reduction 5 with 10 rules applied. Total rules applied 1187 place count 322 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 1192 place count 322 transition count 622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1193 place count 321 transition count 622
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1196 place count 318 transition count 616
Iterating global reduction 7 with 3 rules applied. Total rules applied 1199 place count 318 transition count 616
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1202 place count 315 transition count 610
Iterating global reduction 7 with 3 rules applied. Total rules applied 1205 place count 315 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1207 place count 313 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1209 place count 313 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 311 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 311 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1215 place count 309 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1217 place count 309 transition count 598
Performed 140 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 7 with 280 rules applied. Total rules applied 1497 place count 169 transition count 379
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1512 place count 169 transition count 364
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1517 place count 164 transition count 354
Iterating global reduction 8 with 5 rules applied. Total rules applied 1522 place count 164 transition count 354
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1546 place count 152 transition count 339
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1557 place count 152 transition count 328
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1558 place count 151 transition count 324
Iterating global reduction 9 with 1 rules applied. Total rules applied 1559 place count 151 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1561 place count 150 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1563 place count 150 transition count 321
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1603 place count 130 transition count 356
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1623 place count 130 transition count 336
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1632 place count 121 transition count 318
Iterating global reduction 11 with 9 rules applied. Total rules applied 1641 place count 121 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1647 place count 121 transition count 312
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1683 place count 121 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1684 place count 120 transition count 275
Applied a total of 1684 rules in 150 ms. Remains 120 /1537 variables (removed 1417) and now considering 275/1966 (removed 1691) transitions.
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
// Phase 1: matrix 218 rows 120 cols
[2024-05-21 15:59:05] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
[2024-05-21 15:59:05] [INFO ] Invariant cache hit.
[2024-05-21 15:59:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [8, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1537 places, 275/1966 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 116 transition count 273
Applied a total of 4 rules in 9 ms. Remains 116 /118 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
// Phase 1: matrix 216 rows 116 cols
[2024-05-21 15:59:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 15:59:05] [INFO ] Invariant cache hit.
[2024-05-21 15:59:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1537 places, 273/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 472 ms. Remains : 116/1537 places, 273/1966 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s78 1), p1:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-01 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1877 edges and 1537 vertex of which 695 / 1537 are part of one of the 63 SCC in 3 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1406 edges and 905 vertex of which 896 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 895 transition count 732
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 518 rules applied. Total rules applied 1014 place count 401 transition count 708
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1026 place count 389 transition count 708
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1026 place count 389 transition count 663
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1116 place count 344 transition count 663
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1132 place count 328 transition count 636
Iterating global reduction 3 with 16 rules applied. Total rules applied 1148 place count 328 transition count 636
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1150 place count 328 transition count 634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1152 place count 326 transition count 634
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1162 place count 316 transition count 619
Iterating global reduction 5 with 10 rules applied. Total rules applied 1172 place count 316 transition count 619
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 1178 place count 316 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1179 place count 315 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1181 place count 313 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1183 place count 313 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1185 place count 311 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1187 place count 311 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1189 place count 309 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1191 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1193 place count 307 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1195 place count 307 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1197 place count 305 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1199 place count 305 transition count 593
Performed 143 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1485 place count 162 transition count 367
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1500 place count 162 transition count 352
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1506 place count 156 transition count 341
Iterating global reduction 8 with 6 rules applied. Total rules applied 1512 place count 156 transition count 341
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1513 place count 155 transition count 340
Iterating global reduction 8 with 1 rules applied. Total rules applied 1514 place count 155 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1515 place count 155 transition count 339
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1539 place count 143 transition count 324
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1550 place count 143 transition count 313
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1551 place count 142 transition count 309
Iterating global reduction 10 with 1 rules applied. Total rules applied 1552 place count 142 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1554 place count 141 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1556 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1590 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1607 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1616 place count 115 transition count 305
Iterating global reduction 12 with 9 rules applied. Total rules applied 1625 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1631 place count 115 transition count 299
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1667 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1668 place count 114 transition count 262
Applied a total of 1668 rules in 105 ms. Remains 114 /1537 variables (removed 1423) and now considering 262/1966 (removed 1704) transitions.
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-21 15:59:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-21 15:59:05] [INFO ] Invariant cache hit.
[2024-05-21 15:59:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1537 places, 262/1966 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 260
Applied a total of 4 rules in 5 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-21 15:59:05] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 15:59:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 15:59:05] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 15:59:05] [INFO ] Invariant cache hit.
[2024-05-21 15:59:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:06] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1537 places, 260/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 110/1537 places, 260/1966 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-03 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)||X((F(p2)||!p0))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1520 transition count 1945
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1517 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1515 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1515 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1929
Applied a total of 62 rules in 720 ms. Remains 1507 /1537 variables (removed 30) and now considering 1929/1966 (removed 37) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 15:59:06] [INFO ] Computed 4 invariants in 20 ms
[2024-05-21 15:59:07] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 15:59:07] [INFO ] Invariant cache hit.
[2024-05-21 15:59:08] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2024-05-21 15:59:08] [INFO ] Invariant cache hit.
[2024-05-21 15:59:08] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1537 places, 1929/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2651 ms. Remains : 1507/1537 places, 1929/1966 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p1 (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s1389 1), p0:(NEQ s1370 1), p1:(EQ s598 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 709 reset in 261 ms.
Product exploration explored 100000 steps with 718 reset in 227 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 361 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 233714 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233714 steps, saw 58461 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-21 15:59:13] [INFO ] Invariant cache hit.
[2024-05-21 15:59:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 15:59:15] [INFO ] After 1280ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-21 15:59:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 15:59:16] [INFO ] After 956ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-21 15:59:17] [INFO ] After 1573ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 328 ms.
[2024-05-21 15:59:17] [INFO ] After 2359ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 141 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 4 properties in 12 ms.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1839 edges and 1507 vertex of which 693 / 1507 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1305 edges and 877 vertex of which 868 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 868 transition count 634
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 548 rules applied. Total rules applied 1045 place count 380 transition count 574
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1084 place count 341 transition count 574
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1084 place count 341 transition count 524
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1184 place count 291 transition count 524
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1195 place count 280 transition count 508
Iterating global reduction 3 with 11 rules applied. Total rules applied 1206 place count 280 transition count 508
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1209 place count 280 transition count 505
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1212 place count 277 transition count 505
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1220 place count 269 transition count 495
Iterating global reduction 5 with 8 rules applied. Total rules applied 1228 place count 269 transition count 495
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1234 place count 269 transition count 489
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1236 place count 267 transition count 477
Iterating global reduction 6 with 2 rules applied. Total rules applied 1238 place count 267 transition count 477
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1239 place count 267 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1240 place count 266 transition count 476
Performed 140 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1520 place count 126 transition count 242
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 8 with 13 rules applied. Total rules applied 1533 place count 126 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1535 place count 125 transition count 228
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1538 place count 122 transition count 225
Iterating global reduction 10 with 3 rules applied. Total rules applied 1541 place count 122 transition count 225
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1567 place count 109 transition count 209
Drop transitions removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1582 place count 109 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1648 place count 76 transition count 225
Drop transitions removed 32 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 11 with 56 rules applied. Total rules applied 1704 place count 76 transition count 169
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1727 place count 53 transition count 146
Iterating global reduction 12 with 23 rules applied. Total rules applied 1750 place count 53 transition count 146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1764 place count 53 transition count 132
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1770 place count 47 transition count 120
Iterating global reduction 13 with 6 rules applied. Total rules applied 1776 place count 47 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1782 place count 47 transition count 114
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 14 with 31 rules applied. Total rules applied 1813 place count 47 transition count 83
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1816 place count 44 transition count 74
Iterating global reduction 14 with 3 rules applied. Total rules applied 1819 place count 44 transition count 74
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1822 place count 41 transition count 71
Iterating global reduction 14 with 3 rules applied. Total rules applied 1825 place count 41 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1828 place count 41 transition count 68
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1831 place count 41 transition count 65
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1834 place count 41 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1837 place count 38 transition count 62
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1838 place count 38 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1839 place count 37 transition count 61
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 35 edges and 36 vertex of which 24 / 36 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 16 with 2 rules applied. Total rules applied 1841 place count 21 transition count 61
Drop transitions removed 24 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 17 with 31 rules applied. Total rules applied 1872 place count 21 transition count 30
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 1875 place count 18 transition count 27
Iterating global reduction 18 with 3 rules applied. Total rules applied 1878 place count 18 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 1884 place count 15 transition count 24
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 1891 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1892 place count 15 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 1894 place count 15 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 1896 place count 13 transition count 14
Applied a total of 1896 rules in 79 ms. Remains 13 /1507 variables (removed 1494) and now considering 14/1929 (removed 1915) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 13/1507 places, 14/1929 transitions.
Finished random walk after 23 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F p2)]
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 376 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 335 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1836 edges and 1507 vertex of which 685 / 1507 are part of one of the 62 SCC in 3 ms
Free SCC test removed 623 places
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Graph (complete) has 1376 edges and 884 vertex of which 875 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 874 transition count 725
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 496 rules applied. Total rules applied 972 place count 400 transition count 703
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 984 place count 389 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 985 place count 388 transition count 702
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 985 place count 388 transition count 654
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1081 place count 340 transition count 654
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1097 place count 324 transition count 628
Iterating global reduction 4 with 16 rules applied. Total rules applied 1113 place count 324 transition count 628
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1116 place count 324 transition count 625
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1119 place count 321 transition count 625
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1129 place count 311 transition count 611
Iterating global reduction 6 with 10 rules applied. Total rules applied 1139 place count 311 transition count 611
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1145 place count 311 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1147 place count 309 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1149 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1151 place count 307 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1153 place count 307 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1155 place count 305 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1157 place count 305 transition count 593
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1159 place count 303 transition count 589
Iterating global reduction 7 with 2 rules applied. Total rules applied 1161 place count 303 transition count 589
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1163 place count 301 transition count 585
Iterating global reduction 7 with 2 rules applied. Total rules applied 1165 place count 301 transition count 585
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1167 place count 299 transition count 571
Iterating global reduction 7 with 2 rules applied. Total rules applied 1169 place count 299 transition count 571
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1170 place count 299 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1171 place count 298 transition count 570
Performed 137 Post agglomeration using F-continuation condition with reduction of 76 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 9 with 274 rules applied. Total rules applied 1445 place count 161 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 9 with 13 rules applied. Total rules applied 1458 place count 161 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1460 place count 160 transition count 343
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1464 place count 156 transition count 338
Iterating global reduction 11 with 4 rules applied. Total rules applied 1468 place count 156 transition count 338
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1494 place count 143 transition count 322
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1506 place count 143 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1540 place count 126 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1557 place count 126 transition count 327
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 1565 place count 118 transition count 311
Iterating global reduction 13 with 8 rules applied. Total rules applied 1573 place count 118 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1578 place count 118 transition count 306
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1614 place count 118 transition count 270
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1615 place count 118 transition count 270
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1616 place count 118 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1617 place count 117 transition count 268
Applied a total of 1617 rules in 92 ms. Remains 117 /1507 variables (removed 1390) and now considering 268/1929 (removed 1661) transitions.
[2024-05-21 15:59:18] [INFO ] Flow matrix only has 212 transitions (discarded 56 similar events)
// Phase 1: matrix 212 rows 117 cols
[2024-05-21 15:59:18] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:59:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 15:59:18] [INFO ] Flow matrix only has 212 transitions (discarded 56 similar events)
[2024-05-21 15:59:18] [INFO ] Invariant cache hit.
[2024-05-21 15:59:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:18] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1507 places, 268/1929 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 266
Applied a total of 4 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 266/268 (removed 2) transitions.
[2024-05-21 15:59:18] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
// Phase 1: matrix 210 rows 113 cols
[2024-05-21 15:59:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:59:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 15:59:18] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
[2024-05-21 15:59:18] [INFO ] Invariant cache hit.
[2024-05-21 15:59:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:18] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1507 places, 266/1929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 113/1507 places, 266/1929 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 147 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1081 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 15:59:19] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
[2024-05-21 15:59:19] [INFO ] Invariant cache hit.
[2024-05-21 15:59:19] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2024-05-21 15:59:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:59:19] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 15:59:19] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 15:59:19] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 15:59:19] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-21 15:59:19] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-21 15:59:19] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 266/266 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 113 transition count 204
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 71 place count 105 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 104 transition count 203
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 114 place count 83 transition count 182
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 128 place count 83 transition count 168
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 140 place count 71 transition count 156
Iterating global reduction 4 with 12 rules applied. Total rules applied 152 place count 71 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 158 place count 71 transition count 150
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 176 place count 62 transition count 141
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 185 place count 62 transition count 132
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 191 place count 56 transition count 126
Iterating global reduction 6 with 6 rules applied. Total rules applied 197 place count 56 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 203 place count 56 transition count 120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 221 place count 47 transition count 125
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 233 place count 47 transition count 113
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 239 place count 41 transition count 107
Iterating global reduction 8 with 6 rules applied. Total rules applied 245 place count 41 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 250 place count 41 transition count 102
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 265 place count 41 transition count 87
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 268 place count 38 transition count 78
Iterating global reduction 9 with 3 rules applied. Total rules applied 271 place count 38 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 274 place count 38 transition count 75
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 277 place count 35 transition count 72
Iterating global reduction 10 with 3 rules applied. Total rules applied 280 place count 35 transition count 72
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 286 place count 35 transition count 66
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 289 place count 35 transition count 63
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 31 edges and 31 vertex of which 21 / 31 are part of one of the 9 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 11 with 8 rules applied. Total rules applied 297 place count 19 transition count 60
Drop transitions removed 21 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 12 with 26 rules applied. Total rules applied 323 place count 19 transition count 34
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 326 place count 16 transition count 31
Iterating global reduction 13 with 3 rules applied. Total rules applied 329 place count 16 transition count 31
Performed 3 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 335 place count 13 transition count 24
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 342 place count 13 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 344 place count 13 transition count 15
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 347 place count 13 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 350 place count 10 transition count 12
Applied a total of 350 rules in 22 ms. Remains 10 /113 variables (removed 103) and now considering 12/266 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 10/113 places, 12/266 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 19 factoid took 483 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 376 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 499 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 343 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Stuttering criterion allowed to conclude after 1533 steps with 148 reset in 9 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-04 finished in 15477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1521 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1518 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1516 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Applied a total of 60 rules in 717 ms. Remains 1508 /1537 variables (removed 29) and now considering 1930/1966 (removed 36) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 15:59:22] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 15:59:22] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 15:59:22] [INFO ] Invariant cache hit.
[2024-05-21 15:59:23] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2024-05-21 15:59:23] [INFO ] Invariant cache hit.
[2024-05-21 15:59:24] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1537 places, 1930/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2563 ms. Remains : 1508/1537 places, 1930/1966 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s568 1), p0:(NEQ s834 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 805 ms.
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-313-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-313-LTLFireability-05 finished in 4366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1526 transition count 1953
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1526 transition count 1953
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 1526 transition count 1952
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1519 transition count 1944
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1519 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1516 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1514 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1514 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1506 transition count 1928
Applied a total of 64 rules in 672 ms. Remains 1506 /1537 variables (removed 31) and now considering 1928/1966 (removed 38) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 15:59:26] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 15:59:26] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 15:59:26] [INFO ] Invariant cache hit.
[2024-05-21 15:59:27] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2024-05-21 15:59:27] [INFO ] Invariant cache hit.
[2024-05-21 15:59:28] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1537 places, 1928/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2522 ms. Remains : 1506/1537 places, 1928/1966 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s791 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-06 finished in 2639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p0&&G(F(!p1))))))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1528 transition count 1955
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1528 transition count 1955
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 1522 transition count 1948
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1520 transition count 1946
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1520 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1519 transition count 1945
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1519 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1518 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1518 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1517 transition count 1943
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1516 transition count 1942
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1516 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1515 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1514 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1513 transition count 1938
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1512 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1511 transition count 1935
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1511 transition count 1935
Applied a total of 52 rules in 675 ms. Remains 1511 /1537 variables (removed 26) and now considering 1935/1966 (removed 31) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 15:59:29] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 15:59:29] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-21 15:59:29] [INFO ] Invariant cache hit.
[2024-05-21 15:59:30] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2024-05-21 15:59:30] [INFO ] Invariant cache hit.
[2024-05-21 15:59:31] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1537 places, 1935/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2580 ms. Remains : 1511/1537 places, 1935/1966 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s195 1) (EQ s459 1)), p0:(NEQ s916 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 697 reset in 172 ms.
Product exploration explored 100000 steps with 698 reset in 169 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 362446 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 362446 steps, saw 88029 distinct states, run finished after 3003 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 15:59:35] [INFO ] Invariant cache hit.
[2024-05-21 15:59:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:59:36] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 15:59:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 15:59:37] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 15:59:37] [INFO ] After 959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-21 15:59:37] [INFO ] After 1295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1511 vertex of which 693 / 1511 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1311 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 872 transition count 640
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 548 rules applied. Total rules applied 1045 place count 384 transition count 580
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1085 place count 345 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1086 place count 344 transition count 579
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1086 place count 344 transition count 529
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1186 place count 294 transition count 529
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1197 place count 283 transition count 513
Iterating global reduction 4 with 11 rules applied. Total rules applied 1208 place count 283 transition count 513
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1211 place count 283 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1214 place count 280 transition count 510
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1222 place count 272 transition count 500
Iterating global reduction 6 with 8 rules applied. Total rules applied 1230 place count 272 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1236 place count 272 transition count 494
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1237 place count 271 transition count 488
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 271 transition count 488
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1522 place count 129 transition count 250
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1536 place count 129 transition count 236
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1539 place count 126 transition count 233
Iterating global reduction 8 with 3 rules applied. Total rules applied 1542 place count 126 transition count 233
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1568 place count 113 transition count 217
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1583 place count 113 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1585 place count 112 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1587 place count 112 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1589 place count 111 transition count 198
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1591 place count 111 transition count 196
Performed 31 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 62 rules applied. Total rules applied 1653 place count 80 transition count 227
Drop transitions removed 20 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 11 with 43 rules applied. Total rules applied 1696 place count 80 transition count 184
Discarding 21 places :
Symmetric choice reduction at 12 with 21 rule applications. Total rules 1717 place count 59 transition count 156
Iterating global reduction 12 with 21 rules applied. Total rules applied 1738 place count 59 transition count 156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1751 place count 59 transition count 143
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1756 place count 54 transition count 133
Iterating global reduction 13 with 5 rules applied. Total rules applied 1761 place count 54 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1766 place count 54 transition count 128
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 14 with 22 rules applied. Total rules applied 1788 place count 54 transition count 106
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1791 place count 51 transition count 99
Iterating global reduction 14 with 3 rules applied. Total rules applied 1794 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1796 place count 49 transition count 97
Iterating global reduction 14 with 2 rules applied. Total rules applied 1798 place count 49 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1800 place count 49 transition count 95
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1802 place count 49 transition count 93
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1806 place count 49 transition count 89
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1811 place count 45 transition count 88
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1812 place count 45 transition count 87
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1814 place count 45 transition count 87
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1815 place count 45 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1816 place count 44 transition count 85
Applied a total of 1816 rules in 65 ms. Remains 44 /1511 variables (removed 1467) and now considering 85/1935 (removed 1850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 44/1511 places, 85/1935 transitions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:59:37] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
// Phase 1: matrix 80 rows 44 cols
[2024-05-21 15:59:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:59:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:59:37] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 15:59:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:59:37] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:59:37] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:59:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:59:37] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:59:37] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:59:37] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-21 15:59:37] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 44/44 places, 85/85 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1183 steps, run visited all 1 properties in 6 ms. (steps per millisecond=197 )
Probabilistic random walk after 1183 steps, saw 497 distinct states, run finished after 6 ms. (steps per millisecond=197 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1511 vertex of which 693 / 1511 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1374 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 474 place count 871 transition count 725
Reduce places removed 472 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 496 rules applied. Total rules applied 970 place count 399 transition count 701
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 983 place count 387 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 984 place count 386 transition count 700
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 984 place count 386 transition count 653
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1078 place count 339 transition count 653
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1094 place count 323 transition count 627
Iterating global reduction 4 with 16 rules applied. Total rules applied 1110 place count 323 transition count 627
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1113 place count 323 transition count 624
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1116 place count 320 transition count 624
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1126 place count 310 transition count 610
Iterating global reduction 6 with 10 rules applied. Total rules applied 1136 place count 310 transition count 610
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1142 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1144 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1146 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 306 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 304 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 304 transition count 592
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1156 place count 302 transition count 588
Iterating global reduction 7 with 2 rules applied. Total rules applied 1158 place count 302 transition count 588
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1160 place count 300 transition count 584
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 300 transition count 584
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1163 place count 299 transition count 577
Iterating global reduction 7 with 1 rules applied. Total rules applied 1164 place count 299 transition count 577
Performed 137 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 7 with 274 rules applied. Total rules applied 1438 place count 162 transition count 362
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1449 place count 162 transition count 351
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1453 place count 158 transition count 346
Iterating global reduction 8 with 4 rules applied. Total rules applied 1457 place count 158 transition count 346
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1483 place count 145 transition count 330
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1497 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1533 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1552 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1561 place count 118 transition count 313
Iterating global reduction 10 with 9 rules applied. Total rules applied 1570 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1576 place count 118 transition count 307
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1613 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1614 place count 117 transition count 269
Applied a total of 1614 rules in 79 ms. Remains 117 /1511 variables (removed 1394) and now considering 269/1935 (removed 1666) transitions.
[2024-05-21 15:59:38] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 117 cols
[2024-05-21 15:59:38] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:59:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 15:59:38] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-21 15:59:38] [INFO ] Invariant cache hit.
[2024-05-21 15:59:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:59:38] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [11, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1511 places, 269/1935 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 267
Applied a total of 4 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 15:59:38] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 113 cols
[2024-05-21 15:59:38] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:59:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 15:59:38] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:59:38] [INFO ] Invariant cache hit.
[2024-05-21 15:59:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:59:38] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1511 places, 267/1935 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 366 ms. Remains : 113/1511 places, 267/1935 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 1073 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 320247 steps, run visited all 2 properties in 479 ms. (steps per millisecond=668 )
Probabilistic random walk after 320247 steps, saw 69227 distinct states, run finished after 480 ms. (steps per millisecond=667 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 8931 reset in 131 ms.
Product exploration explored 100000 steps with 8929 reset in 133 ms.
Built C files in :
/tmp/ltsmin823706413501276225
[2024-05-21 15:59:39] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-21 15:59:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:59:39] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-21 15:59:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:59:39] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-21 15:59:39] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:59:39] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin823706413501276225
Running compilation step : cd /tmp/ltsmin823706413501276225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 549 ms.
Running link step : cd /tmp/ltsmin823706413501276225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin823706413501276225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1189071810410094329.hoa' '--buchi-type=spotba'
LTSmin run took 1773 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-313-LTLFireability-08 finished in 13619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&G(p1)) U (p2&&F(!p0))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1520 transition count 1945
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1517 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1515 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1515 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1929
Applied a total of 62 rules in 693 ms. Remains 1507 /1537 variables (removed 30) and now considering 1929/1966 (removed 37) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 15:59:42] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 15:59:43] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 15:59:43] [INFO ] Invariant cache hit.
[2024-05-21 15:59:44] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2024-05-21 15:59:44] [INFO ] Invariant cache hit.
[2024-05-21 15:59:44] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1537 places, 1929/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2539 ms. Remains : 1507/1537 places, 1929/1966 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) p0), true, (AND p1 (NOT p0)), (NOT p1), p0]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s392 1), p1:(NEQ s130 1), p0:(NEQ s572 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1424 reset in 139 ms.
Product exploration explored 100000 steps with 1364 reset in 193 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p1), (X (AND (NOT p2) p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 149 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) p0), true, (AND p1 (NOT p0)), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 15:59:46] [INFO ] Invariant cache hit.
[2024-05-21 15:59:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 15:59:47] [INFO ] After 697ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-21 15:59:47] [INFO ] After 808ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:59:47] [INFO ] After 1167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:59:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 15:59:48] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 15:59:48] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-05-21 15:59:48] [INFO ] After 1753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 4 properties in 15 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p1), (X (AND (NOT p2) p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p0)), (F (AND (NOT p2) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 14 factoid took 187 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-313-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-313-LTLFireability-09 finished in 6945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F((G(F(p1))||(F(p1)&&G((p2||G(p1))))))))))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1527 transition count 1954
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1521 transition count 1947
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1519 transition count 1945
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1517 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1517 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 1516 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1515 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1514 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1513 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1512 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1932
Applied a total of 58 rules in 713 ms. Remains 1509 /1537 variables (removed 28) and now considering 1932/1966 (removed 34) transitions.
// Phase 1: matrix 1932 rows 1509 cols
[2024-05-21 15:59:49] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 15:59:50] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 15:59:50] [INFO ] Invariant cache hit.
[2024-05-21 15:59:51] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2024-05-21 15:59:51] [INFO ] Invariant cache hit.
[2024-05-21 15:59:51] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1537 places, 1932/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2659 ms. Remains : 1509/1537 places, 1932/1966 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s121 0), p2:(NEQ s72 1), p1:(NEQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 716 reset in 137 ms.
Product exploration explored 100000 steps with 709 reset in 146 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2109 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (X (AND p0 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 15:59:53] [INFO ] Invariant cache hit.
[2024-05-21 15:59:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:59:53] [INFO ] After 647ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-21 15:59:54] [INFO ] After 749ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-21 15:59:54] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1932/1932 transitions.
Graph (trivial) has 1843 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1308 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 870 transition count 635
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 550 rules applied. Total rules applied 1049 place count 380 transition count 575
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1088 place count 341 transition count 575
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1088 place count 341 transition count 525
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1188 place count 291 transition count 525
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1199 place count 280 transition count 509
Iterating global reduction 3 with 11 rules applied. Total rules applied 1210 place count 280 transition count 509
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1213 place count 280 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1216 place count 277 transition count 506
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1224 place count 269 transition count 496
Iterating global reduction 5 with 8 rules applied. Total rules applied 1232 place count 269 transition count 496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1238 place count 269 transition count 490
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1239 place count 268 transition count 484
Iterating global reduction 6 with 1 rules applied. Total rules applied 1240 place count 268 transition count 484
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1241 place count 268 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1242 place count 267 transition count 483
Performed 140 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1522 place count 127 transition count 247
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1536 place count 127 transition count 233
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1539 place count 124 transition count 230
Iterating global reduction 9 with 3 rules applied. Total rules applied 1542 place count 124 transition count 230
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1568 place count 111 transition count 214
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1582 place count 111 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1584 place count 110 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1586 place count 110 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1588 place count 109 transition count 196
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1590 place count 109 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1656 place count 76 transition count 225
Drop transitions removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 12 with 47 rules applied. Total rules applied 1703 place count 76 transition count 178
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1726 place count 53 transition count 148
Iterating global reduction 13 with 23 rules applied. Total rules applied 1749 place count 53 transition count 148
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 1763 place count 53 transition count 134
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1769 place count 47 transition count 122
Iterating global reduction 14 with 6 rules applied. Total rules applied 1775 place count 47 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1781 place count 47 transition count 116
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1802 place count 47 transition count 95
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1804 place count 45 transition count 89
Iterating global reduction 15 with 2 rules applied. Total rules applied 1806 place count 45 transition count 89
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1808 place count 43 transition count 87
Iterating global reduction 15 with 2 rules applied. Total rules applied 1810 place count 43 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1812 place count 43 transition count 85
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1814 place count 43 transition count 83
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1818 place count 43 transition count 79
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1823 place count 39 transition count 78
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1824 place count 39 transition count 77
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1825 place count 39 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1826 place count 38 transition count 76
Applied a total of 1826 rules in 55 ms. Remains 38 /1509 variables (removed 1471) and now considering 76/1932 (removed 1856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 38/1509 places, 76/1932 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (X (AND p0 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1509/1509 places, 1932/1932 transitions.
Graph (trivial) has 1840 edges and 1509 vertex of which 689 / 1509 are part of one of the 63 SCC in 1 ms
Free SCC test removed 626 places
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Graph (complete) has 1378 edges and 883 vertex of which 874 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 873 transition count 725
Reduce places removed 476 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 501 rules applied. Total rules applied 979 place count 397 transition count 700
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 992 place count 385 transition count 699
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 994 place count 384 transition count 698
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 994 place count 384 transition count 651
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1088 place count 337 transition count 651
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1104 place count 321 transition count 625
Iterating global reduction 4 with 16 rules applied. Total rules applied 1120 place count 321 transition count 625
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1123 place count 321 transition count 622
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1126 place count 318 transition count 622
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1136 place count 308 transition count 608
Iterating global reduction 6 with 10 rules applied. Total rules applied 1146 place count 308 transition count 608
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1152 place count 308 transition count 602
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1153 place count 307 transition count 600
Iterating global reduction 7 with 1 rules applied. Total rules applied 1154 place count 307 transition count 600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1155 place count 306 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 1156 place count 306 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1157 place count 305 transition count 596
Iterating global reduction 7 with 1 rules applied. Total rules applied 1158 place count 305 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1159 place count 304 transition count 594
Iterating global reduction 7 with 1 rules applied. Total rules applied 1160 place count 304 transition count 594
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1161 place count 303 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 1162 place count 303 transition count 592
Performed 137 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 7 with 274 rules applied. Total rules applied 1436 place count 166 transition count 377
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1449 place count 166 transition count 364
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1453 place count 162 transition count 359
Iterating global reduction 8 with 4 rules applied. Total rules applied 1457 place count 162 transition count 359
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1483 place count 149 transition count 343
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1497 place count 149 transition count 329
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1498 place count 148 transition count 327
Iterating global reduction 9 with 1 rules applied. Total rules applied 1499 place count 148 transition count 327
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1537 place count 129 transition count 366
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1560 place count 129 transition count 343
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1569 place count 120 transition count 325
Iterating global reduction 10 with 9 rules applied. Total rules applied 1578 place count 120 transition count 325
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1584 place count 120 transition count 319
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 1625 place count 120 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1626 place count 120 transition count 278
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1627 place count 120 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1628 place count 119 transition count 276
Applied a total of 1628 rules in 80 ms. Remains 119 /1509 variables (removed 1390) and now considering 276/1932 (removed 1656) transitions.
[2024-05-21 15:59:54] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
// Phase 1: matrix 219 rows 119 cols
[2024-05-21 15:59:54] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:59:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 15:59:54] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
[2024-05-21 15:59:54] [INFO ] Invariant cache hit.
[2024-05-21 15:59:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:59:55] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [15, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 300 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1509 places, 276/1932 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 274
Applied a total of 4 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 274/276 (removed 2) transitions.
[2024-05-21 15:59:55] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
// Phase 1: matrix 217 rows 115 cols
[2024-05-21 15:59:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:59:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:59:55] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 15:59:55] [INFO ] Invariant cache hit.
[2024-05-21 15:59:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:59:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1509 places, 274/1932 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 580 ms. Remains : 115/1509 places, 274/1932 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1079 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:59:55] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 15:59:55] [INFO ] Invariant cache hit.
[2024-05-21 15:59:55] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 9027 reset in 135 ms.
Product exploration explored 100000 steps with 9049 reset in 138 ms.
Built C files in :
/tmp/ltsmin888286431947931988
[2024-05-21 15:59:56] [INFO ] Computing symmetric may disable matrix : 274 transitions.
[2024-05-21 15:59:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:59:56] [INFO ] Computing symmetric may enable matrix : 274 transitions.
[2024-05-21 15:59:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:59:56] [INFO ] Computing Do-Not-Accords matrix : 274 transitions.
[2024-05-21 15:59:56] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:59:56] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin888286431947931988
Running compilation step : cd /tmp/ltsmin888286431947931988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 517 ms.
Running link step : cd /tmp/ltsmin888286431947931988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin888286431947931988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6835983620840761684.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 274/274 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2024-05-21 16:00:11] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 16:00:11] [INFO ] Invariant cache hit.
[2024-05-21 16:00:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 16:00:11] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 16:00:11] [INFO ] Invariant cache hit.
[2024-05-21 16:00:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:00:11] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-21 16:00:11] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-21 16:00:11] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2024-05-21 16:00:11] [INFO ] Invariant cache hit.
[2024-05-21 16:00:12] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 115/115 places, 274/274 transitions.
Built C files in :
/tmp/ltsmin12345887767416511439
[2024-05-21 16:00:12] [INFO ] Computing symmetric may disable matrix : 274 transitions.
[2024-05-21 16:00:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:00:12] [INFO ] Computing symmetric may enable matrix : 274 transitions.
[2024-05-21 16:00:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:00:12] [INFO ] Computing Do-Not-Accords matrix : 274 transitions.
[2024-05-21 16:00:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:00:12] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12345887767416511439
Running compilation step : cd /tmp/ltsmin12345887767416511439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin12345887767416511439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12345887767416511439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10684556880887677657.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:00:27] [INFO ] Flatten gal took : 10 ms
[2024-05-21 16:00:27] [INFO ] Flatten gal took : 9 ms
[2024-05-21 16:00:27] [INFO ] Time to serialize gal into /tmp/LTL17691314423109388147.gal : 4 ms
[2024-05-21 16:00:27] [INFO ] Time to serialize properties into /tmp/LTL5786540193232355980.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17691314423109388147.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14564590265206911756.hoa' '-atoms' '/tmp/LTL5786540193232355980.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5786540193232355980.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14564590265206911756.hoa
Reverse transition relation is NOT exact ! Due to transitions t185, t297, t449, t654, t770, t922, t1140, t1252, t1405, t1693.t1694.t1695.t1811, t1575.t1576...2009
Computing Next relation with stutter on 36736 deadlock states
5 unique states visited
0 strongly connected components in search stack
10 transitions explored
5 items max in DFS search stack
501 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.04522,154060,1,0,544,545061,526,317,4598,998461,806
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-313-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CloudReconfiguration-PT-313-LTLFireability-12 finished in 44132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1&&X((X(F(p2))||G(p1))))))))'
Support contains 3 out of 1537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1526 transition count 1953
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1526 transition count 1953
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 1526 transition count 1952
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1519 transition count 1944
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1517 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1516 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1516 transition count 1940
Applied a total of 44 rules in 283 ms. Remains 1516 /1537 variables (removed 21) and now considering 1940/1966 (removed 26) transitions.
// Phase 1: matrix 1940 rows 1516 cols
[2024-05-21 16:00:33] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 16:00:33] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 16:00:33] [INFO ] Invariant cache hit.
[2024-05-21 16:00:34] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2024-05-21 16:00:34] [INFO ] Invariant cache hit.
[2024-05-21 16:00:35] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1516/1537 places, 1940/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2254 ms. Remains : 1516/1537 places, 1940/1966 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(NEQ s1412 1), p0:(EQ s1500 1), p1:(NEQ s639 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 405 ms.
Product exploration explored 100000 steps with 20000 reset in 398 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1516 vertex of which 1507 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 289752 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289752 steps, saw 71979 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 16:00:40] [INFO ] Invariant cache hit.
[2024-05-21 16:00:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 16:00:41] [INFO ] After 808ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-21 16:00:41] [INFO ] After 1026ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:00:41] [INFO ] After 1357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:00:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 16:00:42] [INFO ] After 868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 16:00:43] [INFO ] After 1271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 242 ms.
[2024-05-21 16:00:43] [INFO ] After 1864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 130 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 1516 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1516/1516 places, 1940/1940 transitions.
Applied a total of 0 rules in 57 ms. Remains 1516 /1516 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2024-05-21 16:00:44] [INFO ] Invariant cache hit.
[2024-05-21 16:00:44] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 16:00:44] [INFO ] Invariant cache hit.
[2024-05-21 16:00:45] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2024-05-21 16:00:45] [INFO ] Invariant cache hit.
[2024-05-21 16:00:46] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1864 ms. Remains : 1516/1516 places, 1940/1940 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1516 vertex of which 1507 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 292993 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292993 steps, saw 72990 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 16:00:49] [INFO ] Invariant cache hit.
[2024-05-21 16:00:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 16:00:50] [INFO ] After 811ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-21 16:00:51] [INFO ] After 1019ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:00:51] [INFO ] After 1391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:00:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 16:00:52] [INFO ] After 855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 16:00:52] [INFO ] After 1253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 227 ms.
[2024-05-21 16:00:52] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 130 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=43 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND p2 p1), true]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 405 ms.
Product exploration explored 100000 steps with 20000 reset in 436 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1516/1516 places, 1940/1940 transitions.
Graph (trivial) has 1849 edges and 1516 vertex of which 693 / 1516 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1379 edges and 886 vertex of which 877 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 480 rules applied. Total rules applied 482 place count 877 transition count 1203
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 494 place count 877 transition count 1191
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 494 place count 877 transition count 1203
Deduced a syphon composed of 500 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 514 place count 877 transition count 1203
Discarding 287 places :
Symmetric choice reduction at 2 with 287 rule applications. Total rules 801 place count 590 transition count 906
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 287 rules applied. Total rules applied 1088 place count 590 transition count 906
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1100 place count 578 transition count 890
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1112 place count 578 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1118 place count 578 transition count 884
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1130 place count 566 transition count 872
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1142 place count 566 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1144 place count 564 transition count 868
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1146 place count 564 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1148 place count 562 transition count 864
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1150 place count 562 transition count 864
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1154 place count 558 transition count 860
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1158 place count 558 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1160 place count 556 transition count 856
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1162 place count 556 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1164 place count 554 transition count 852
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1166 place count 554 transition count 852
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1170 place count 550 transition count 846
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1174 place count 550 transition count 846
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1178 place count 546 transition count 830
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1182 place count 546 transition count 830
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1183 place count 546 transition count 830
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1187 place count 542 transition count 826
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1191 place count 542 transition count 826
Performed 107 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1298 place count 542 transition count 904
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1338 place count 542 transition count 864
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1439 place count 441 transition count 752
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1540 place count 441 transition count 752
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1542 place count 441 transition count 750
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1548 place count 435 transition count 742
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1554 place count 435 transition count 742
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1561 place count 435 transition count 742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1565 place count 435 transition count 738
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1580 place count 420 transition count 719
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1595 place count 420 transition count 719
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1602 place count 420 transition count 712
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1606 place count 416 transition count 708
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1610 place count 416 transition count 708
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1613 place count 416 transition count 708
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1619 place count 416 transition count 702
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1622 place count 413 transition count 699
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1625 place count 413 transition count 699
Performed 69 Post agglomeration using F-continuation condition with reduction of 112 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 9 with 69 rules applied. Total rules applied 1694 place count 413 transition count 1010
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 9 with 114 rules applied. Total rules applied 1808 place count 413 transition count 896
Discarding 123 places :
Symmetric choice reduction at 10 with 123 rule applications. Total rules 1931 place count 290 transition count 569
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 10 with 123 rules applied. Total rules applied 2054 place count 290 transition count 569
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 2067 place count 290 transition count 556
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 2089 place count 268 transition count 513
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 11 with 22 rules applied. Total rules applied 2111 place count 268 transition count 513
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2114 place count 268 transition count 565
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2117 place count 265 transition count 536
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2120 place count 265 transition count 536
Deduced a syphon composed of 144 places in 1 ms
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 11 with 49 rules applied. Total rules applied 2169 place count 265 transition count 487
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2174 place count 260 transition count 482
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2179 place count 260 transition count 482
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2182 place count 260 transition count 542
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2185 place count 257 transition count 527
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2188 place count 257 transition count 527
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2188 rules in 322 ms. Remains 257 /1516 variables (removed 1259) and now considering 527/1940 (removed 1413) transitions.
[2024-05-21 16:00:55] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-21 16:00:55] [INFO ] Flow matrix only has 470 transitions (discarded 57 similar events)
// Phase 1: matrix 470 rows 257 cols
[2024-05-21 16:00:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:00:55] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1516 places, 527/1940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 553 ms. Remains : 257/1516 places, 527/1940 transitions.
Built C files in :
/tmp/ltsmin7853228932601219353
[2024-05-21 16:00:55] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7853228932601219353
Running compilation step : cd /tmp/ltsmin7853228932601219353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7853228932601219353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7853228932601219353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1516/1516 places, 1940/1940 transitions.
Applied a total of 0 rules in 48 ms. Remains 1516 /1516 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
// Phase 1: matrix 1940 rows 1516 cols
[2024-05-21 16:00:58] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 16:00:58] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 16:00:58] [INFO ] Invariant cache hit.
[2024-05-21 16:00:59] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2024-05-21 16:00:59] [INFO ] Invariant cache hit.
[2024-05-21 16:01:00] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1846 ms. Remains : 1516/1516 places, 1940/1940 transitions.
Built C files in :
/tmp/ltsmin9474314679120813144
[2024-05-21 16:01:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9474314679120813144
Running compilation step : cd /tmp/ltsmin9474314679120813144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9474314679120813144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9474314679120813144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 16:01:03] [INFO ] Flatten gal took : 46 ms
[2024-05-21 16:01:03] [INFO ] Flatten gal took : 46 ms
[2024-05-21 16:01:03] [INFO ] Time to serialize gal into /tmp/LTL6442626868251915888.gal : 14 ms
[2024-05-21 16:01:03] [INFO ] Time to serialize properties into /tmp/LTL3396943243638851064.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6442626868251915888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1339915755470040155.hoa' '-atoms' '/tmp/LTL3396943243638851064.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3396943243638851064.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1339915755470040155.hoa
Detected timeout of ITS tools.
[2024-05-21 16:01:18] [INFO ] Flatten gal took : 41 ms
[2024-05-21 16:01:18] [INFO ] Flatten gal took : 41 ms
[2024-05-21 16:01:18] [INFO ] Time to serialize gal into /tmp/LTL15538050389671866004.gal : 8 ms
[2024-05-21 16:01:18] [INFO ] Time to serialize properties into /tmp/LTL10587202635317236.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15538050389671866004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10587202635317236.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(("(p2566==1)")||(X(("(p1105!=1)")&&(X((X(F("(p2369!=1)")))||(G("(p1105!=1)")))))))))
Formula 0 simplified : X(!"(p2566==1)" & X(!"(p1105!=1)" | X(XG!"(p2369!=1)" & F!"(p1105!=1)")))
Detected timeout of ITS tools.
[2024-05-21 16:01:33] [INFO ] Flatten gal took : 36 ms
[2024-05-21 16:01:33] [INFO ] Applying decomposition
[2024-05-21 16:01:34] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11057831908660182351.txt' '-o' '/tmp/graph11057831908660182351.bin' '-w' '/tmp/graph11057831908660182351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11057831908660182351.bin' '-l' '-1' '-v' '-w' '/tmp/graph11057831908660182351.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:01:34] [INFO ] Decomposing Gal with order
[2024-05-21 16:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:01:34] [INFO ] Removed a total of 522 redundant transitions.
[2024-05-21 16:01:34] [INFO ] Flatten gal took : 122 ms
[2024-05-21 16:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 29 ms.
[2024-05-21 16:01:34] [INFO ] Time to serialize gal into /tmp/LTL9787499539438769441.gal : 20 ms
[2024-05-21 16:01:34] [INFO ] Time to serialize properties into /tmp/LTL13893513822708073881.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9787499539438769441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13893513822708073881.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("(i8.i1.i1.u456.p2566==1)")||(X(("(i18.i0.i6.u249.p1105!=1)")&&(X((X(F("(i37.i1.i1.u571.p2369!=1)")))||(G("(i18.i0.i6.u249.p1105...169
Formula 0 simplified : X(!"(i8.i1.i1.u456.p2566==1)" & X(!"(i18.i0.i6.u249.p1105!=1)" | X(XG!"(i37.i1.i1.u571.p2369!=1)" & F!"(i18.i0.i6.u249.p1105!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t210, t262, t322, t371, t442, t494, t681, t735, t766, t844, t915, t968, t1136, t11...2134
Computing Next relation with stutter on 140576 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
501 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.16951,157840,1,0,240411,12954,19759,660911,549,108705,1017482
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-313-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-313-LTLFireability-13 finished in 67081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 2 out of 1537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1537/1537 places, 1966/1966 transitions.
Graph (trivial) has 1873 edges and 1537 vertex of which 691 / 1537 are part of one of the 63 SCC in 1 ms
Free SCC test removed 628 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1411 edges and 909 vertex of which 900 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 899 transition count 737
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 516 rules applied. Total rules applied 1012 place count 405 transition count 715
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1024 place count 394 transition count 714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1025 place count 393 transition count 714
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1025 place count 393 transition count 668
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1117 place count 347 transition count 668
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1133 place count 331 transition count 642
Iterating global reduction 4 with 16 rules applied. Total rules applied 1149 place count 331 transition count 642
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1151 place count 331 transition count 640
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1153 place count 329 transition count 640
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1163 place count 319 transition count 626
Iterating global reduction 6 with 10 rules applied. Total rules applied 1173 place count 319 transition count 626
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1178 place count 319 transition count 621
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1181 place count 316 transition count 615
Iterating global reduction 7 with 3 rules applied. Total rules applied 1184 place count 316 transition count 615
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1187 place count 313 transition count 609
Iterating global reduction 7 with 3 rules applied. Total rules applied 1190 place count 313 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 311 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 311 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 309 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 307 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 307 transition count 597
Performed 143 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1488 place count 164 transition count 374
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1505 place count 164 transition count 357
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1511 place count 158 transition count 346
Iterating global reduction 8 with 6 rules applied. Total rules applied 1517 place count 158 transition count 346
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1518 place count 157 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 1519 place count 157 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1520 place count 157 transition count 344
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1544 place count 145 transition count 330
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1556 place count 145 transition count 318
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1557 place count 144 transition count 314
Iterating global reduction 10 with 1 rules applied. Total rules applied 1558 place count 144 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1560 place count 143 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1562 place count 143 transition count 311
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1598 place count 125 transition count 345
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1615 place count 125 transition count 328
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1624 place count 116 transition count 310
Iterating global reduction 12 with 9 rules applied. Total rules applied 1633 place count 116 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1639 place count 116 transition count 304
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 13 with 39 rules applied. Total rules applied 1678 place count 116 transition count 265
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1679 place count 116 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1680 place count 115 transition count 264
Applied a total of 1680 rules in 115 ms. Remains 115 /1537 variables (removed 1422) and now considering 264/1966 (removed 1702) transitions.
[2024-05-21 16:01:40] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 115 cols
[2024-05-21 16:01:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:01:40] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 16:01:40] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
[2024-05-21 16:01:40] [INFO ] Invariant cache hit.
[2024-05-21 16:01:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:01:40] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [8, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 281 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1537 places, 264/1966 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 262
Applied a total of 4 rules in 5 ms. Remains 111 /113 variables (removed 2) and now considering 262/264 (removed 2) transitions.
[2024-05-21 16:01:40] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 111 cols
[2024-05-21 16:01:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 16:01:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 16:01:40] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-21 16:01:40] [INFO ] Invariant cache hit.
[2024-05-21 16:01:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:01:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1537 places, 262/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 111/1537 places, 262/1966 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s98 0), p0:(AND (EQ s105 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLFireability-15 finished in 649 ms.
All properties solved by simple procedures.
Total runtime 174546 ms.

BK_STOP 1716307302141

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CloudReconfiguration-PT-313"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CloudReconfiguration-PT-313, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624207900133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-313.tgz
mv CloudReconfiguration-PT-313 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;