Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-311-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678230776574

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-311
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 23:12:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 23:12:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:12:58] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-07 23:12:58] [INFO ] Transformed 2585 places.
[2023-03-07 23:12:58] [INFO ] Transformed 3095 transitions.
[2023-03-07 23:12:58] [INFO ] Found NUPN structural information;
[2023-03-07 23:12:58] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 307 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 4 formulas.
FORMULA CloudReconfiguration-PT-311-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2066 transition count 2547
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1306 place count 1827 transition count 2308
Iterating global reduction 1 with 239 rules applied. Total rules applied 1545 place count 1827 transition count 2308
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 1637 place count 1735 transition count 2216
Iterating global reduction 1 with 92 rules applied. Total rules applied 1729 place count 1735 transition count 2216
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1747 place count 1735 transition count 2198
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1796 place count 1686 transition count 2149
Iterating global reduction 2 with 49 rules applied. Total rules applied 1845 place count 1686 transition count 2149
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1854 place count 1686 transition count 2140
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1893 place count 1647 transition count 2096
Iterating global reduction 3 with 39 rules applied. Total rules applied 1932 place count 1647 transition count 2096
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1959 place count 1620 transition count 2069
Iterating global reduction 3 with 27 rules applied. Total rules applied 1986 place count 1620 transition count 2069
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2011 place count 1595 transition count 2044
Iterating global reduction 3 with 25 rules applied. Total rules applied 2036 place count 1595 transition count 2044
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2061 place count 1570 transition count 2019
Iterating global reduction 3 with 25 rules applied. Total rules applied 2086 place count 1570 transition count 2019
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2107 place count 1549 transition count 1985
Iterating global reduction 3 with 21 rules applied. Total rules applied 2128 place count 1549 transition count 1985
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2135 place count 1542 transition count 1973
Iterating global reduction 3 with 7 rules applied. Total rules applied 2142 place count 1542 transition count 1973
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2149 place count 1535 transition count 1964
Iterating global reduction 3 with 7 rules applied. Total rules applied 2156 place count 1535 transition count 1964
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2159 place count 1535 transition count 1961
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2161 place count 1533 transition count 1959
Iterating global reduction 4 with 2 rules applied. Total rules applied 2163 place count 1533 transition count 1959
Applied a total of 2163 rules in 1409 ms. Remains 1533 /2585 variables (removed 1052) and now considering 1959/3095 (removed 1136) transitions.
// Phase 1: matrix 1959 rows 1533 cols
[2023-03-07 23:13:00] [INFO ] Computed 4 place invariants in 34 ms
[2023-03-07 23:13:00] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-07 23:13:00] [INFO ] Invariant cache hit.
[2023-03-07 23:13:01] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-07 23:13:01] [INFO ] Invariant cache hit.
[2023-03-07 23:13:02] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1533/2585 places, 1959/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3502 ms. Remains : 1533/2585 places, 1959/3095 transitions.
Support contains 30 out of 1533 places after structural reductions.
[2023-03-07 23:13:02] [INFO ] Flatten gal took : 126 ms
[2023-03-07 23:13:02] [INFO ] Flatten gal took : 70 ms
[2023-03-07 23:13:02] [INFO ] Input system was already deterministic with 1959 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 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 4 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 3 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 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-07 23:13:03] [INFO ] Invariant cache hit.
[2023-03-07 23:13:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 23:13:04] [INFO ] After 1490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-07 23:13:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 23:13:07] [INFO ] After 1848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-07 23:13:09] [INFO ] After 4088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1198 ms.
[2023-03-07 23:13:11] [INFO ] After 6423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 14 properties in 99 ms.
Support contains 10 out of 1533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1847 edges and 1533 vertex of which 670 / 1533 are part of one of the 63 SCC in 7 ms
Free SCC test removed 607 places
Drop transitions removed 766 transitions
Reduce isomorphic transitions removed 766 transitions.
Graph (complete) has 1368 edges and 926 vertex of which 917 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 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 917 transition count 679
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 561 rules applied. Total rules applied 1073 place count 413 transition count 622
Reduce places removed 37 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 44 rules applied. Total rules applied 1117 place count 376 transition count 615
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1124 place count 369 transition count 615
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1124 place count 369 transition count 565
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 1224 place count 319 transition count 565
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1233 place count 310 transition count 553
Iterating global reduction 4 with 9 rules applied. Total rules applied 1242 place count 310 transition count 553
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1243 place count 310 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1244 place count 309 transition count 552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1244 place count 309 transition count 551
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1246 place count 308 transition count 551
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1253 place count 301 transition count 543
Iterating global reduction 6 with 7 rules applied. Total rules applied 1260 place count 301 transition count 543
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1265 place count 301 transition count 538
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1266 place count 300 transition count 536
Iterating global reduction 7 with 1 rules applied. Total rules applied 1267 place count 300 transition count 536
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1268 place count 299 transition count 534
Iterating global reduction 7 with 1 rules applied. Total rules applied 1269 place count 299 transition count 534
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 1270 place count 299 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1271 place count 298 transition count 533
Performed 157 Post agglomeration using F-continuation condition with reduction of 106 identical transitions.
Deduced a syphon composed of 157 places in 7 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 9 with 314 rules applied. Total rules applied 1585 place count 141 transition count 270
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1601 place count 141 transition count 254
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1604 place count 138 transition count 251
Iterating global reduction 10 with 3 rules applied. Total rules applied 1607 place count 138 transition count 251
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1627 place count 128 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1640 place count 128 transition count 226
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 127 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1644 place count 127 transition count 223
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 12 with 2 rules applied. Total rules applied 1646 place count 126 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1648 place count 126 transition count 220
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 13 with 2 rules applied. Total rules applied 1650 place count 125 transition count 219
Performed 31 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 1712 place count 94 transition count 256
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 13 with 26 rules applied. Total rules applied 1738 place count 94 transition count 230
Discarding 20 places :
Symmetric choice reduction at 14 with 20 rule applications. Total rules 1758 place count 74 transition count 190
Iterating global reduction 14 with 20 rules applied. Total rules applied 1778 place count 74 transition count 190
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 1789 place count 74 transition count 179
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 1794 place count 69 transition count 169
Iterating global reduction 15 with 5 rules applied. Total rules applied 1799 place count 69 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1804 place count 69 transition count 164
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1811 place count 69 transition count 157
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1812 place count 68 transition count 156
Iterating global reduction 16 with 1 rules applied. Total rules applied 1813 place count 68 transition count 156
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 16 with 2 rules applied. Total rules applied 1815 place count 67 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1817 place count 66 transition count 165
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1818 place count 66 transition count 164
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1820 place count 66 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1821 place count 65 transition count 163
Applied a total of 1821 rules in 218 ms. Remains 65 /1533 variables (removed 1468) and now considering 163/1959 (removed 1796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 65/1533 places, 163/1959 transitions.
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 273 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 244 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-07 23:13:11] [INFO ] Flow matrix only has 155 transitions (discarded 8 similar events)
// Phase 1: matrix 155 rows 65 cols
[2023-03-07 23:13:11] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-07 23:13:11] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-07 23:13:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 23:13:11] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-07 23:13:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-07 23:13:11] [INFO ] After 23ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-07 23:13:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-07 23:13:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-07 23:13:12] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2023-03-07 23:13:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-07 23:13:12] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-07 23:13:12] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 163/163 transitions.
Graph (trivial) has 33 edges and 65 vertex of which 7 / 65 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 61 transition count 153
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 5 place count 59 transition count 153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 56 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 56 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 55 transition count 143
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 55 transition count 135
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 52 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 52 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 52 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 51 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 51 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 51 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 49 transition count 128
Drop transitions removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 47 place count 49 transition count 121
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 72 place count 49 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 74 place count 47 transition count 90
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 47 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 77 place count 47 transition count 89
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 79 place count 45 transition count 87
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 45 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 83 place count 45 transition count 85
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 85 place count 45 transition count 83
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 88 place count 45 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 91 place count 42 transition count 80
Applied a total of 91 rules in 27 ms. Remains 42 /65 variables (removed 23) and now considering 80/163 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 42/65 places, 80/163 transitions.
Incomplete random walk after 10000 steps, including 255 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished Best-First random walk after 2321 steps, including 15 resets, run visited all 1 properties in 3 ms. (steps per millisecond=773 )
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA CloudReconfiguration-PT-311-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2138 edges and 1533 vertex of which 1524 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(G((p1||(X(p2) U ((X(p2)&&G(!p0))||X(G(p2)))))))))))'
Support contains 4 out of 1533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1524 transition count 1950
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1524 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 1520 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 1517 transition count 1941
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 1517 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1514 transition count 1937
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1513 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1512 transition count 1935
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1511 transition count 1934
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1510 transition count 1933
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1510 transition count 1933
Applied a total of 46 rules in 614 ms. Remains 1510 /1533 variables (removed 23) and now considering 1933/1959 (removed 26) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2023-03-07 23:13:13] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-07 23:13:13] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-07 23:13:13] [INFO ] Invariant cache hit.
[2023-03-07 23:13:14] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-03-07 23:13:14] [INFO ] Invariant cache hit.
[2023-03-07 23:13:15] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1533 places, 1933/1959 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2598 ms. Remains : 1510/1533 places, 1933/1959 transitions.
Stuttering acceptance computed with spot in 598 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=true, acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=3 dest: 6}, { cond=(NOT p1), acceptance={0, 1, 2} source=3 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={2} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=6 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={2} source=6 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(NOT p2), acceptance={0, 2} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=8 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 2} source=10 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=10 dest: 11}], [{ cond=p0, acceptance={0, 2} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=11 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=11 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=11 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=11 dest: 10}, { cond=(NOT p0), acceptance={2} source=11 dest: 11}]], initial=3, aps=[p0:(AND (EQ s279 1) (EQ s1120 1)), p1:(NEQ s1476 1), p2:(NEQ s482 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20004 reset in 549 ms.
Product exploration explored 100000 steps with 19917 reset in 457 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 5188 ms. Reduced automaton from 12 states, 50 edges and 3 AP (stutter sensitive) to 12 states, 50 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 101 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 19) 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 19) seen :3
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-07 23:13:22] [INFO ] Invariant cache hit.
[2023-03-07 23:13:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-07 23:13:24] [INFO ] After 725ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:13
[2023-03-07 23:13:24] [INFO ] After 831ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:14
[2023-03-07 23:13:24] [INFO ] After 1547ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:14
[2023-03-07 23:13:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-07 23:13:26] [INFO ] After 1445ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-07 23:13:27] [INFO ] After 2823ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-07 23:13:28] [INFO ] After 4477ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 30 ms.
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1836 edges and 1510 vertex of which 689 / 1510 are part of one of the 63 SCC in 5 ms
Free SCC test removed 626 places
Drop transitions removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1316 edges and 884 vertex of which 875 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 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 875 transition count 645
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 544 rules applied. Total rules applied 1039 place count 388 transition count 588
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 40 rules applied. Total rules applied 1079 place count 351 transition count 585
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1082 place count 348 transition count 585
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1082 place count 348 transition count 535
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 1182 place count 298 transition count 535
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1192 place count 288 transition count 521
Iterating global reduction 4 with 10 rules applied. Total rules applied 1202 place count 288 transition count 521
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 1204 place count 288 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1206 place count 286 transition count 519
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1213 place count 279 transition count 510
Iterating global reduction 6 with 7 rules applied. Total rules applied 1220 place count 279 transition count 510
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1225 place count 279 transition count 505
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1227 place count 277 transition count 493
Iterating global reduction 7 with 2 rules applied. Total rules applied 1229 place count 277 transition count 493
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 1230 place count 277 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1231 place count 276 transition count 492
Performed 145 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 9 with 290 rules applied. Total rules applied 1521 place count 131 transition count 248
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 1534 place count 131 transition count 235
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 1536 place count 130 transition count 234
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1539 place count 127 transition count 231
Iterating global reduction 11 with 3 rules applied. Total rules applied 1542 place count 127 transition count 231
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 11 with 24 rules applied. Total rules applied 1566 place count 115 transition count 217
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1577 place count 115 transition count 206
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 12 with 70 rules applied. Total rules applied 1647 place count 80 transition count 240
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 12 with 28 rules applied. Total rules applied 1675 place count 80 transition count 212
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1696 place count 59 transition count 170
Iterating global reduction 13 with 21 rules applied. Total rules applied 1717 place count 59 transition count 170
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1729 place count 59 transition count 158
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1735 place count 53 transition count 146
Iterating global reduction 14 with 6 rules applied. Total rules applied 1741 place count 53 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1747 place count 53 transition count 140
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1751 place count 53 transition count 136
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1753 place count 53 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1754 place count 52 transition count 135
Applied a total of 1754 rules in 69 ms. Remains 52 /1510 variables (removed 1458) and now considering 135/1933 (removed 1798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 52/1510 places, 135/1933 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 364 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 333 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-07 23:13:29] [INFO ] Flow matrix only has 122 transitions (discarded 13 similar events)
// Phase 1: matrix 122 rows 52 cols
[2023-03-07 23:13:29] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-07 23:13:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 23:13:29] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-07 23:13:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-07 23:13:29] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-07 23:13:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 23:13:29] [INFO ] After 31ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-07 23:13:29] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-07 23:13:29] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 52/52 places, 135/135 transitions.
Incomplete random walk after 10000 steps, including 1494 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 337 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 239 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 378 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Finished probabilistic random walk after 4461 steps, run visited all 4 properties in 35 ms. (steps per millisecond=127 )
Probabilistic random walk after 4461 steps, saw 1589 distinct states, run finished after 35 ms. (steps per millisecond=127 ) properties seen :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 p2 p1)), (F (NOT (AND p2 p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F p0), (F (AND p0 (NOT p2))), (F (NOT p1)), (F (AND (NOT p2) p1)), (F (AND p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 39 factoid took 6184 ms. Reduced automaton from 12 states, 50 edges and 3 AP (stutter sensitive) to 12 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 458 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 53 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2023-03-07 23:13:36] [INFO ] Computed 4 place invariants in 20 ms
[2023-03-07 23:13:37] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-07 23:13:37] [INFO ] Invariant cache hit.
[2023-03-07 23:13:37] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2023-03-07 23:13:37] [INFO ] Invariant cache hit.
[2023-03-07 23:13:38] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1850 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1510 vertex of which 1501 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 (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 7441 ms. Reduced automaton from 12 states, 41 edges and 3 AP (stutter sensitive) to 12 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 102 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-07 23:13:47] [INFO ] Invariant cache hit.
[2023-03-07 23:13:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-07 23:13:48] [INFO ] After 1566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-07 23:13:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-07 23:13:50] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-07 23:13:51] [INFO ] After 2123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 569 ms.
[2023-03-07 23:13:51] [INFO ] After 3232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 23 ms.
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1836 edges and 1510 vertex of which 689 / 1510 are part of one of the 63 SCC in 2 ms
Free SCC test removed 626 places
Drop transitions removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1316 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 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 875 transition count 645
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 544 rules applied. Total rules applied 1039 place count 388 transition count 588
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 40 rules applied. Total rules applied 1079 place count 351 transition count 585
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1082 place count 348 transition count 585
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1082 place count 348 transition count 535
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1182 place count 298 transition count 535
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1192 place count 288 transition count 521
Iterating global reduction 4 with 10 rules applied. Total rules applied 1202 place count 288 transition count 521
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 1204 place count 288 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1206 place count 286 transition count 519
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1213 place count 279 transition count 510
Iterating global reduction 6 with 7 rules applied. Total rules applied 1220 place count 279 transition count 510
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1225 place count 279 transition count 505
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1227 place count 277 transition count 493
Iterating global reduction 7 with 2 rules applied. Total rules applied 1229 place count 277 transition count 493
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 1230 place count 277 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1231 place count 276 transition count 492
Performed 145 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 9 with 290 rules applied. Total rules applied 1521 place count 131 transition count 248
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 1534 place count 131 transition count 235
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 1536 place count 130 transition count 234
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1539 place count 127 transition count 231
Iterating global reduction 11 with 3 rules applied. Total rules applied 1542 place count 127 transition count 231
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 11 with 24 rules applied. Total rules applied 1566 place count 115 transition count 217
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1577 place count 115 transition count 206
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 12 with 70 rules applied. Total rules applied 1647 place count 80 transition count 240
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 12 with 28 rules applied. Total rules applied 1675 place count 80 transition count 212
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1696 place count 59 transition count 170
Iterating global reduction 13 with 21 rules applied. Total rules applied 1717 place count 59 transition count 170
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1729 place count 59 transition count 158
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1735 place count 53 transition count 146
Iterating global reduction 14 with 6 rules applied. Total rules applied 1741 place count 53 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1747 place count 53 transition count 140
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1751 place count 53 transition count 136
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1753 place count 53 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1754 place count 52 transition count 135
Applied a total of 1754 rules in 84 ms. Remains 52 /1510 variables (removed 1458) and now considering 135/1933 (removed 1798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 52/1510 places, 135/1933 transitions.
Incomplete random walk after 10000 steps, including 1527 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 339 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-07 23:13:52] [INFO ] Flow matrix only has 122 transitions (discarded 13 similar events)
// Phase 1: matrix 122 rows 52 cols
[2023-03-07 23:13:52] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-07 23:13:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 23:13:52] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 23:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 23:13:52] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 23:13:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 23:13:52] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-07 23:13:52] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-07 23:13:52] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 52/52 places, 135/135 transitions.
Incomplete random walk after 10000 steps, including 1475 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:13:52] [INFO ] Flow matrix only has 122 transitions (discarded 13 similar events)
[2023-03-07 23:13:52] [INFO ] Invariant cache hit.
[2023-03-07 23:13:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 23:13:52] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-07 23:13:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 23:13:52] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:13:52] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 23:13:52] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:13:52] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:13:52] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-07 23:13:52] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 135/135 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 52 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 51 transition count 133
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 15 place count 51 transition count 121
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 47 transition count 117
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 47 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 47 transition count 114
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 3 with 2 rules applied. Total rules applied 28 place count 46 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 46 transition count 111
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 58 place count 46 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 43 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 43 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 40 transition count 71
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 40 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 40 transition count 68
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 76 place count 40 transition count 65
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 40 transition count 62
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 35 edges and 36 vertex of which 23 / 36 are part of one of the 9 SCC in 0 ms
Free SCC test removed 14 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 85 place count 22 transition count 61
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 117 place count 21 transition count 30
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 120 place count 18 transition count 27
Iterating global reduction 7 with 3 rules applied. Total rules applied 123 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 7 with 6 rules applied. Total rules applied 129 place count 15 transition count 24
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 136 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 137 place count 15 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 139 place count 15 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 141 place count 13 transition count 14
Applied a total of 141 rules in 14 ms. Remains 13 /52 variables (removed 39) and now considering 14/135 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 13/52 places, 14/135 transitions.
Finished random walk after 316 steps, including 32 resets, run visited all 1 properties in 1 ms. (steps per millisecond=316 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 p2)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 23 factoid took 7952 ms. Reduced automaton from 12 states, 41 edges and 3 AP (stutter sensitive) to 12 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 501 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20029 reset in 418 ms.
Product exploration explored 100000 steps with 19946 reset in 427 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1836 edges and 1510 vertex of which 689 / 1510 are part of one of the 63 SCC in 5 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1379 edges and 884 vertex of which 875 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
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 475 rules applied. Total rules applied 477 place count 875 transition count 1201
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 488 place count 875 transition count 1190
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 488 place count 875 transition count 1203
Deduced a syphon composed of 497 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 510 place count 875 transition count 1203
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 794 place count 591 transition count 910
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 284 rules applied. Total rules applied 1078 place count 591 transition count 910
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1089 place count 580 transition count 895
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1100 place count 580 transition count 895
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1105 place count 580 transition count 890
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1116 place count 569 transition count 879
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1127 place count 569 transition count 879
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1129 place count 567 transition count 875
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 567 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1133 place count 565 transition count 871
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1135 place count 565 transition count 871
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1139 place count 561 transition count 867
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1143 place count 561 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1145 place count 559 transition count 863
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1147 place count 559 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1149 place count 557 transition count 859
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1151 place count 557 transition count 859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1155 place count 553 transition count 853
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1159 place count 553 transition count 853
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1163 place count 549 transition count 837
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1167 place count 549 transition count 837
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1168 place count 549 transition count 837
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1172 place count 545 transition count 833
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1176 place count 545 transition count 833
Performed 107 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1283 place count 545 transition count 911
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 1324 place count 545 transition count 870
Discarding 99 places :
Symmetric choice reduction at 5 with 99 rule applications. Total rules 1423 place count 446 transition count 760
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 99 rules applied. Total rules applied 1522 place count 446 transition count 760
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1528 place count 440 transition count 751
Deduced a syphon composed of 222 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1534 place count 440 transition count 751
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1541 place count 440 transition count 751
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1547 place count 440 transition count 745
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1563 place count 424 transition count 725
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 16 rules applied. Total rules applied 1579 place count 424 transition count 725
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1585 place count 424 transition count 719
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1589 place count 420 transition count 715
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1593 place count 420 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1595 place count 420 transition count 715
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1599 place count 420 transition count 711
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1601 place count 418 transition count 709
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 418 transition count 709
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1673 place count 418 transition count 1031
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1794 place count 418 transition count 910
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 1918 place count 294 transition count 579
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 9 with 124 rules applied. Total rules applied 2042 place count 294 transition count 579
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2057 place count 294 transition count 564
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 2083 place count 268 transition count 510
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 26 rules applied. Total rules applied 2109 place count 268 transition count 510
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2112 place count 268 transition count 560
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2115 place count 265 transition count 532
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2118 place count 265 transition count 532
Deduced a syphon composed of 142 places in 0 ms
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 2165 place count 265 transition count 485
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2169 place count 261 transition count 481
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2173 place count 261 transition count 481
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2176 place count 261 transition count 541
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2179 place count 258 transition count 526
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2182 place count 258 transition count 526
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 2182 rules in 393 ms. Remains 258 /1510 variables (removed 1252) and now considering 526/1933 (removed 1407) transitions.
[2023-03-07 23:14:03] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-07 23:14:03] [INFO ] Flow matrix only has 469 transitions (discarded 57 similar events)
// Phase 1: matrix 469 rows 258 cols
[2023-03-07 23:14:03] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:03] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1510 places, 526/1933 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 642 ms. Remains : 258/1510 places, 526/1933 transitions.
Support contains 4 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 46 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2023-03-07 23:14:04] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-07 23:14:04] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-07 23:14:04] [INFO ] Invariant cache hit.
[2023-03-07 23:14:05] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-07 23:14:05] [INFO ] Invariant cache hit.
[2023-03-07 23:14:05] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1875 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Treatment of property CloudReconfiguration-PT-311-LTLFireability-00 finished in 53583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1867 edges and 1533 vertex of which 694 / 1533 are part of one of the 63 SCC in 1 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1399 edges and 902 vertex of which 893 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 892 transition count 728
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 515 rules applied. Total rules applied 1009 place count 400 transition count 705
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1022 place count 389 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1024 place count 387 transition count 703
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1024 place count 387 transition count 657
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 1116 place count 341 transition count 657
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1131 place count 326 transition count 634
Iterating global reduction 4 with 15 rules applied. Total rules applied 1146 place count 326 transition count 634
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1147 place count 326 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1148 place count 325 transition count 633
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1159 place count 314 transition count 618
Iterating global reduction 6 with 11 rules applied. Total rules applied 1170 place count 314 transition count 618
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1176 place count 314 transition count 612
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1179 place count 311 transition count 606
Iterating global reduction 7 with 3 rules applied. Total rules applied 1182 place count 311 transition count 606
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1185 place count 308 transition count 600
Iterating global reduction 7 with 3 rules applied. Total rules applied 1188 place count 308 transition count 600
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 1189 place count 308 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1190 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1192 place count 305 transition count 595
Iterating global reduction 9 with 2 rules applied. Total rules applied 1194 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1196 place count 303 transition count 591
Iterating global reduction 9 with 2 rules applied. Total rules applied 1198 place count 303 transition count 591
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1200 place count 301 transition count 587
Iterating global reduction 9 with 2 rules applied. Total rules applied 1202 place count 301 transition count 587
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1204 place count 299 transition count 573
Iterating global reduction 9 with 2 rules applied. Total rules applied 1206 place count 299 transition count 573
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 1 rules applied. Total rules applied 1207 place count 299 transition count 572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1208 place count 298 transition count 572
Performed 142 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 11 with 284 rules applied. Total rules applied 1492 place count 156 transition count 345
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 with 11 rules applied. Total rules applied 1503 place count 156 transition count 334
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1505 place count 155 transition count 333
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1509 place count 151 transition count 328
Iterating global reduction 13 with 4 rules applied. Total rules applied 1513 place count 151 transition count 328
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1533 place count 141 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 1542 place count 141 transition count 307
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 14 with 34 rules applied. Total rules applied 1576 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1593 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1602 place count 115 transition count 306
Iterating global reduction 15 with 9 rules applied. Total rules applied 1611 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1617 place count 115 transition count 300
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 16 with 37 rules applied. Total rules applied 1654 place count 115 transition count 263
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1655 place count 115 transition count 263
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1656 place count 115 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1657 place count 114 transition count 261
Applied a total of 1657 rules in 124 ms. Remains 114 /1533 variables (removed 1419) and now considering 261/1959 (removed 1698) transitions.
[2023-03-07 23:14:06] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2023-03-07 23:14:06] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-07 23:14:06] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2023-03-07 23:14:06] [INFO ] Invariant cache hit.
[2023-03-07 23:14:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:06] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1533 places, 261/1959 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 259
Applied a total of 4 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 259/261 (removed 2) transitions.
[2023-03-07 23:14:06] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 110 cols
[2023-03-07 23:14:06] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-07 23:14:06] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2023-03-07 23:14:06] [INFO ] Invariant cache hit.
[2023-03-07 23:14:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:06] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1533 places, 259/1959 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 504 ms. Remains : 110/1533 places, 259/1959 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-02 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 s68 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-311-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-02 finished in 678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&(p1||F((p0&&X(F(p2))))))))'
Support contains 4 out of 1533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1522 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1522 transition count 1948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1517 transition count 1942
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1517 transition count 1942
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1513 transition count 1936
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1513 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 1510 transition count 1932
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1509 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1508 transition count 1930
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1507 transition count 1929
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1506 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1506 transition count 1928
Applied a total of 54 rules in 422 ms. Remains 1506 /1533 variables (removed 27) and now considering 1928/1959 (removed 31) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2023-03-07 23:14:07] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-07 23:14:07] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-07 23:14:07] [INFO ] Invariant cache hit.
[2023-03-07 23:14:08] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-07 23:14:08] [INFO ] Invariant cache hit.
[2023-03-07 23:14:08] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1533 places, 1928/1959 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2201 ms. Remains : 1506/1533 places, 1928/1959 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p2)), (NOT p2), true]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s279 1) (EQ s944 1)), p0:(EQ s1192 1), p2:(AND (EQ s279 1) (EQ s1300 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]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-05 finished in 2369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1869 edges and 1533 vertex of which 681 / 1533 are part of one of the 63 SCC in 2 ms
Free SCC test removed 618 places
Ensure Unique test removed 718 transitions
Reduce isomorphic transitions removed 718 transitions.
Graph (complete) has 1416 edges and 915 vertex of which 906 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 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 905 transition count 735
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 526 rules applied. Total rules applied 1028 place count 405 transition count 709
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1041 place count 392 transition count 709
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1041 place count 392 transition count 661
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1137 place count 344 transition count 661
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1150 place count 331 transition count 640
Iterating global reduction 3 with 13 rules applied. Total rules applied 1163 place count 331 transition count 640
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1164 place count 331 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1165 place count 330 transition count 639
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1174 place count 321 transition count 626
Iterating global reduction 5 with 9 rules applied. Total rules applied 1183 place count 321 transition count 626
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1187 place count 321 transition count 622
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1190 place count 318 transition count 616
Iterating global reduction 6 with 3 rules applied. Total rules applied 1193 place count 318 transition count 616
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1196 place count 315 transition count 610
Iterating global reduction 6 with 3 rules applied. Total rules applied 1199 place count 315 transition count 610
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 1200 place count 315 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1201 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1203 place count 312 transition count 605
Iterating global reduction 8 with 2 rules applied. Total rules applied 1205 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1207 place count 310 transition count 601
Iterating global reduction 8 with 2 rules applied. Total rules applied 1209 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1211 place count 308 transition count 597
Iterating global reduction 8 with 2 rules applied. Total rules applied 1213 place count 308 transition count 597
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1215 place count 306 transition count 583
Iterating global reduction 8 with 2 rules applied. Total rules applied 1217 place count 306 transition count 583
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 1 rules applied. Total rules applied 1218 place count 306 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1219 place count 305 transition count 582
Performed 144 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 10 with 288 rules applied. Total rules applied 1507 place count 161 transition count 351
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 10 with 11 rules applied. Total rules applied 1518 place count 161 transition count 340
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1520 place count 160 transition count 339
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1524 place count 156 transition count 334
Iterating global reduction 12 with 4 rules applied. Total rules applied 1528 place count 156 transition count 334
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1548 place count 146 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1557 place count 146 transition count 313
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 13 with 36 rules applied. Total rules applied 1593 place count 128 transition count 347
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1610 place count 128 transition count 330
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1619 place count 119 transition count 312
Iterating global reduction 14 with 9 rules applied. Total rules applied 1628 place count 119 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1634 place count 119 transition count 306
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1670 place count 119 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1671 place count 118 transition count 269
Applied a total of 1671 rules in 100 ms. Remains 118 /1533 variables (removed 1415) and now considering 269/1959 (removed 1690) transitions.
[2023-03-07 23:14:09] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
// Phase 1: matrix 212 rows 118 cols
[2023-03-07 23:14:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:09] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-07 23:14:09] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
[2023-03-07 23:14:09] [INFO ] Invariant cache hit.
[2023-03-07 23:14:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:09] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 361 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1533 places, 269/1959 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 114 transition count 267
Applied a total of 4 rules in 4 ms. Remains 114 /116 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2023-03-07 23:14:09] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 114 cols
[2023-03-07 23:14:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 23:14:09] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2023-03-07 23:14:09] [INFO ] Invariant cache hit.
[2023-03-07 23:14:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:09] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1533 places, 267/1959 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 614 ms. Remains : 114/1533 places, 267/1959 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s42 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][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-06 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X(G(!p1))) U p2))'
Support contains 3 out of 1533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1523 transition count 1949
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1523 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1519 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1516 transition count 1941
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1514 transition count 1938
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1513 transition count 1937
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1512 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1511 transition count 1935
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1510 transition count 1934
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1510 transition count 1934
Applied a total of 46 rules in 410 ms. Remains 1510 /1533 variables (removed 23) and now considering 1934/1959 (removed 25) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2023-03-07 23:14:10] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-07 23:14:10] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-07 23:14:10] [INFO ] Invariant cache hit.
[2023-03-07 23:14:11] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2023-03-07 23:14:11] [INFO ] Invariant cache hit.
[2023-03-07 23:14:11] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1533 places, 1934/1959 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2151 ms. Remains : 1510/1533 places, 1934/1959 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s980 1), p0:(EQ s1035 1), p1:(OR (EQ s912 1) (EQ s980 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2197 steps with 16 reset in 6 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-07 finished in 2277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1869 edges and 1533 vertex of which 694 / 1533 are part of one of the 63 SCC in 0 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1399 edges and 902 vertex of which 893 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 892 transition count 728
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 515 rules applied. Total rules applied 1009 place count 400 transition count 705
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1020 place count 389 transition count 705
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1020 place count 389 transition count 659
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1112 place count 343 transition count 659
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1127 place count 328 transition count 636
Iterating global reduction 3 with 15 rules applied. Total rules applied 1142 place count 328 transition count 636
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1143 place count 328 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1144 place count 327 transition count 635
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1155 place count 316 transition count 620
Iterating global reduction 5 with 11 rules applied. Total rules applied 1166 place count 316 transition count 620
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1172 place count 316 transition count 614
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1175 place count 313 transition count 608
Iterating global reduction 6 with 3 rules applied. Total rules applied 1178 place count 313 transition count 608
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1181 place count 310 transition count 602
Iterating global reduction 6 with 3 rules applied. Total rules applied 1184 place count 310 transition count 602
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 1185 place count 310 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1186 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1188 place count 307 transition count 597
Iterating global reduction 8 with 2 rules applied. Total rules applied 1190 place count 307 transition count 597
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1192 place count 305 transition count 593
Iterating global reduction 8 with 2 rules applied. Total rules applied 1194 place count 305 transition count 593
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1196 place count 303 transition count 589
Iterating global reduction 8 with 2 rules applied. Total rules applied 1198 place count 303 transition count 589
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1200 place count 301 transition count 575
Iterating global reduction 8 with 2 rules applied. Total rules applied 1202 place count 301 transition count 575
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 1 rules applied. Total rules applied 1203 place count 301 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1204 place count 300 transition count 574
Performed 144 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 10 with 288 rules applied. Total rules applied 1492 place count 156 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 10 with 11 rules applied. Total rules applied 1503 place count 156 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1505 place count 155 transition count 331
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1509 place count 151 transition count 326
Iterating global reduction 12 with 4 rules applied. Total rules applied 1513 place count 151 transition count 326
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1533 place count 141 transition count 314
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1542 place count 141 transition count 305
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 13 with 34 rules applied. Total rules applied 1576 place count 124 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1593 place count 124 transition count 322
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1602 place count 115 transition count 304
Iterating global reduction 14 with 9 rules applied. Total rules applied 1611 place count 115 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1617 place count 115 transition count 298
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1653 place count 115 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1654 place count 114 transition count 261
Applied a total of 1654 rules in 71 ms. Remains 114 /1533 variables (removed 1419) and now considering 261/1959 (removed 1698) transitions.
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2023-03-07 23:14:12] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2023-03-07 23:14:12] [INFO ] Invariant cache hit.
[2023-03-07 23:14:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [8, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 224 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1533 places, 261/1959 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 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 259
Applied a total of 4 rules in 7 ms. Remains 110 /112 variables (removed 2) and now considering 259/261 (removed 2) transitions.
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 110 cols
[2023-03-07 23:14:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2023-03-07 23:14:12] [INFO ] Invariant cache hit.
[2023-03-07 23:14:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1533 places, 259/1959 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 605 ms. Remains : 110/1533 places, 259/1959 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s27 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][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-09 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1869 edges and 1533 vertex of which 694 / 1533 are part of one of the 63 SCC in 0 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1399 edges and 902 vertex of which 893 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 892 transition count 728
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 515 rules applied. Total rules applied 1009 place count 400 transition count 705
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1020 place count 389 transition count 705
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1020 place count 389 transition count 659
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1112 place count 343 transition count 659
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1127 place count 328 transition count 636
Iterating global reduction 3 with 15 rules applied. Total rules applied 1142 place count 328 transition count 636
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1143 place count 328 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1144 place count 327 transition count 635
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1155 place count 316 transition count 620
Iterating global reduction 5 with 11 rules applied. Total rules applied 1166 place count 316 transition count 620
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1172 place count 316 transition count 614
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1175 place count 313 transition count 608
Iterating global reduction 6 with 3 rules applied. Total rules applied 1178 place count 313 transition count 608
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1181 place count 310 transition count 602
Iterating global reduction 6 with 3 rules applied. Total rules applied 1184 place count 310 transition count 602
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 1185 place count 310 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1186 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1188 place count 307 transition count 597
Iterating global reduction 8 with 2 rules applied. Total rules applied 1190 place count 307 transition count 597
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1192 place count 305 transition count 593
Iterating global reduction 8 with 2 rules applied. Total rules applied 1194 place count 305 transition count 593
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1196 place count 303 transition count 589
Iterating global reduction 8 with 2 rules applied. Total rules applied 1198 place count 303 transition count 589
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1200 place count 301 transition count 575
Iterating global reduction 8 with 2 rules applied. Total rules applied 1202 place count 301 transition count 575
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 1 rules applied. Total rules applied 1203 place count 301 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1204 place count 300 transition count 574
Performed 144 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 10 with 288 rules applied. Total rules applied 1492 place count 156 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 10 with 11 rules applied. Total rules applied 1503 place count 156 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1505 place count 155 transition count 331
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1509 place count 151 transition count 326
Iterating global reduction 12 with 4 rules applied. Total rules applied 1513 place count 151 transition count 326
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1533 place count 141 transition count 314
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1542 place count 141 transition count 305
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 13 with 34 rules applied. Total rules applied 1576 place count 124 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1593 place count 124 transition count 322
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1602 place count 115 transition count 304
Iterating global reduction 14 with 9 rules applied. Total rules applied 1611 place count 115 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1617 place count 115 transition count 298
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1653 place count 115 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1654 place count 114 transition count 261
Applied a total of 1654 rules in 60 ms. Remains 114 /1533 variables (removed 1419) and now considering 261/1959 (removed 1698) transitions.
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2023-03-07 23:14:12] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2023-03-07 23:14:12] [INFO ] Invariant cache hit.
[2023-03-07 23:14:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 171 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1533 places, 261/1959 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 259
Applied a total of 4 rules in 3 ms. Remains 110 /112 variables (removed 2) and now considering 259/261 (removed 2) transitions.
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 110 cols
[2023-03-07 23:14:12] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-07 23:14:12] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2023-03-07 23:14:12] [INFO ] Invariant cache hit.
[2023-03-07 23:14:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:14:13] [INFO ] Implicit Places using invariants and state equation in 98 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 : 110/1533 places, 259/1959 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 110/1533 places, 259/1959 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-311-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-10 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X(p1)||G(p2)))))'
Support contains 3 out of 1533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1523 transition count 1949
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1523 transition count 1949
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1518 transition count 1943
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1518 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1514 transition count 1937
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1514 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1511 transition count 1933
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1510 transition count 1932
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1509 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1508 transition count 1930
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1507 transition count 1929
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1507 transition count 1929
Applied a total of 52 rules in 411 ms. Remains 1507 /1533 variables (removed 26) and now considering 1929/1959 (removed 30) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2023-03-07 23:14:13] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-07 23:14:13] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-07 23:14:13] [INFO ] Invariant cache hit.
[2023-03-07 23:14:14] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2023-03-07 23:14:14] [INFO ] Invariant cache hit.
[2023-03-07 23:14:15] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1533 places, 1929/1959 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2151 ms. Remains : 1507/1533 places, 1929/1959 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s559 1), p0:(EQ s833 1), p1:(EQ s874 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-11 finished in 2317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1866 edges and 1533 vertex of which 664 / 1533 are part of one of the 62 SCC in 1 ms
Free SCC test removed 602 places
Ensure Unique test removed 701 transitions
Reduce isomorphic transitions removed 701 transitions.
Graph (complete) has 1433 edges and 931 vertex of which 922 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 509 transitions
Trivial Post-agglo rules discarded 509 transitions
Performed 509 trivial Post agglomeration. Transition count delta: 509
Iterating post reduction 0 with 509 rules applied. Total rules applied 511 place count 921 transition count 743
Reduce places removed 509 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 535 rules applied. Total rules applied 1046 place count 412 transition count 717
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 1061 place count 399 transition count 715
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1063 place count 397 transition count 715
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1063 place count 397 transition count 665
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1163 place count 347 transition count 665
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1175 place count 335 transition count 646
Iterating global reduction 4 with 12 rules applied. Total rules applied 1187 place count 335 transition count 646
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1188 place count 335 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1189 place count 334 transition count 645
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1198 place count 325 transition count 632
Iterating global reduction 6 with 9 rules applied. Total rules applied 1207 place count 325 transition count 632
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1211 place count 325 transition count 628
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1214 place count 322 transition count 622
Iterating global reduction 7 with 3 rules applied. Total rules applied 1217 place count 322 transition count 622
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1220 place count 319 transition count 616
Iterating global reduction 7 with 3 rules applied. Total rules applied 1223 place count 319 transition count 616
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 1224 place count 319 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1225 place count 318 transition count 615
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1227 place count 316 transition count 611
Iterating global reduction 9 with 2 rules applied. Total rules applied 1229 place count 316 transition count 611
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1231 place count 314 transition count 607
Iterating global reduction 9 with 2 rules applied. Total rules applied 1233 place count 314 transition count 607
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1235 place count 312 transition count 603
Iterating global reduction 9 with 2 rules applied. Total rules applied 1237 place count 312 transition count 603
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1238 place count 311 transition count 596
Iterating global reduction 9 with 1 rules applied. Total rules applied 1239 place count 311 transition count 596
Performed 144 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 9 with 288 rules applied. Total rules applied 1527 place count 167 transition count 365
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1537 place count 167 transition count 355
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1541 place count 163 transition count 350
Iterating global reduction 10 with 4 rules applied. Total rules applied 1545 place count 163 transition count 350
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1567 place count 152 transition count 337
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1578 place count 152 transition count 326
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 11 with 44 rules applied. Total rules applied 1622 place count 130 transition count 366
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1642 place count 130 transition count 346
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1651 place count 121 transition count 328
Iterating global reduction 12 with 9 rules applied. Total rules applied 1660 place count 121 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1666 place count 121 transition count 322
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1703 place count 121 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1704 place count 120 transition count 284
Applied a total of 1704 rules in 72 ms. Remains 120 /1533 variables (removed 1413) and now considering 284/1959 (removed 1675) transitions.
[2023-03-07 23:14:15] [INFO ] Flow matrix only has 228 transitions (discarded 56 similar events)
// Phase 1: matrix 228 rows 120 cols
[2023-03-07 23:14:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-07 23:14:15] [INFO ] Flow matrix only has 228 transitions (discarded 56 similar events)
[2023-03-07 23:14:15] [INFO ] Invariant cache hit.
[2023-03-07 23:14:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 23:14:15] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [11, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 168 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1533 places, 284/1959 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 282
Applied a total of 4 rules in 3 ms. Remains 116 /118 variables (removed 2) and now considering 282/284 (removed 2) transitions.
[2023-03-07 23:14:15] [INFO ] Flow matrix only has 226 transitions (discarded 56 similar events)
// Phase 1: matrix 226 rows 116 cols
[2023-03-07 23:14:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-07 23:14:15] [INFO ] Flow matrix only has 226 transitions (discarded 56 similar events)
[2023-03-07 23:14:15] [INFO ] Invariant cache hit.
[2023-03-07 23:14:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 23:14:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1533 places, 282/1959 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 116/1533 places, 282/1959 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s9 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 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-12 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U G(p2))&&X(F(!p1)))))'
Support contains 3 out of 1533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1524 transition count 1950
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1524 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 1521 transition count 1946
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 1521 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1519 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1519 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1518 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1518 transition count 1941
Applied a total of 30 rules in 236 ms. Remains 1518 /1533 variables (removed 15) and now considering 1941/1959 (removed 18) transitions.
// Phase 1: matrix 1941 rows 1518 cols
[2023-03-07 23:14:16] [INFO ] Computed 4 place invariants in 17 ms
[2023-03-07 23:14:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-07 23:14:16] [INFO ] Invariant cache hit.
[2023-03-07 23:14:17] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-07 23:14:17] [INFO ] Invariant cache hit.
[2023-03-07 23:14:17] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1518/1533 places, 1941/1959 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1973 ms. Remains : 1518/1533 places, 1941/1959 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (OR (NOT p2) (NOT p0) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), true]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(EQ s1470 1), p0:(EQ s1076 0), p1:(NEQ s673 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-14 finished in 2188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(G((p1||(X(p2) U ((X(p2)&&G(!p0))||X(G(p2)))))))))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-311-LTLFireability-00
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 1533 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1533/1533 places, 1959/1959 transitions.
Graph (trivial) has 1862 edges and 1533 vertex of which 690 / 1533 are part of one of the 63 SCC in 1 ms
Free SCC test removed 627 places
Ensure Unique test removed 728 transitions
Reduce isomorphic transitions removed 728 transitions.
Graph (complete) has 1404 edges and 906 vertex of which 897 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 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 491 rules applied. Total rules applied 493 place count 896 transition count 734
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 512 rules applied. Total rules applied 1005 place count 405 transition count 713
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 1018 place count 395 transition count 710
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1021 place count 392 transition count 710
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1021 place count 392 transition count 663
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1115 place count 345 transition count 663
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1129 place count 331 transition count 641
Iterating global reduction 4 with 14 rules applied. Total rules applied 1143 place count 331 transition count 641
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1144 place count 331 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1145 place count 330 transition count 640
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1154 place count 321 transition count 627
Iterating global reduction 6 with 9 rules applied. Total rules applied 1163 place count 321 transition count 627
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1168 place count 321 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1170 place count 319 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1172 place count 319 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1174 place count 317 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1176 place count 317 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1178 place count 315 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1180 place count 315 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1182 place count 313 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1184 place count 313 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1186 place count 311 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1188 place count 311 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1190 place count 309 transition count 588
Iterating global reduction 7 with 2 rules applied. Total rules applied 1192 place count 309 transition count 588
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 1193 place count 309 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1194 place count 308 transition count 587
Performed 147 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 9 with 294 rules applied. Total rules applied 1488 place count 161 transition count 350
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 1499 place count 161 transition count 339
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 1501 place count 160 transition count 338
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1505 place count 156 transition count 333
Iterating global reduction 11 with 4 rules applied. Total rules applied 1509 place count 156 transition count 333
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1527 place count 147 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 1535 place count 147 transition count 315
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 12 with 36 rules applied. Total rules applied 1571 place count 129 transition count 349
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1588 place count 129 transition count 332
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1597 place count 120 transition count 314
Iterating global reduction 13 with 9 rules applied. Total rules applied 1606 place count 120 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1612 place count 120 transition count 308
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1614 place count 120 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1616 place count 120 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1617 place count 119 transition count 305
Applied a total of 1617 rules in 77 ms. Remains 119 /1533 variables (removed 1414) and now considering 305/1959 (removed 1654) transitions.
[2023-03-07 23:14:19] [INFO ] Flow matrix only has 248 transitions (discarded 57 similar events)
// Phase 1: matrix 248 rows 119 cols
[2023-03-07 23:14:19] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 23:14:19] [INFO ] Flow matrix only has 248 transitions (discarded 57 similar events)
[2023-03-07 23:14:19] [INFO ] Invariant cache hit.
[2023-03-07 23:14:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 23:14:19] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [9, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/1533 places, 305/1959 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 303
Applied a total of 4 rules in 3 ms. Remains 115 /117 variables (removed 2) and now considering 303/305 (removed 2) transitions.
[2023-03-07 23:14:19] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
// Phase 1: matrix 246 rows 115 cols
[2023-03-07 23:14:19] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-07 23:14:19] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:19] [INFO ] Invariant cache hit.
[2023-03-07 23:14:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 23:14:19] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 115/1533 places, 303/1959 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 425 ms. Remains : 115/1533 places, 303/1959 transitions.
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=true, acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=3 dest: 6}, { cond=(NOT p1), acceptance={0, 1, 2} source=3 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={2} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=6 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={2} source=6 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(NOT p2), acceptance={0, 2} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=8 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=8 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 2} source=10 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=10 dest: 11}], [{ cond=p0, acceptance={0, 2} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=11 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=11 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=11 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=11 dest: 10}, { cond=(NOT p0), acceptance={2} source=11 dest: 11}]], initial=3, aps=[p0:(AND (EQ s8 1) (EQ s78 1)), p1:(NEQ s109 1), p2:(NEQ s29 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20978 reset in 205 ms.
Product exploration explored 100000 steps with 20970 reset in 210 ms.
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 p0) p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 5080 ms. Reduced automaton from 12 states, 50 edges and 3 AP (stutter sensitive) to 12 states, 50 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1319 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 325 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 304 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 334 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 220 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 227 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 217 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 313 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-07 23:14:25] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:25] [INFO ] Invariant cache hit.
[2023-03-07 23:14:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-07 23:14:26] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-07 23:14:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 23:14:26] [INFO ] After 45ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-07 23:14:26] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-07 23:14:26] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 303/303 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 115 transition count 249
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 56 rules applied. Total rules applied 110 place count 87 transition count 220
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 1 with 22 rules applied. Total rules applied 132 place count 87 transition count 198
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 86 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 3 with 2 rules applied. Total rules applied 136 place count 85 transition count 196
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 170 place count 68 transition count 212
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 198 place count 68 transition count 184
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 210 place count 56 transition count 160
Iterating global reduction 4 with 12 rules applied. Total rules applied 222 place count 56 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 228 place count 56 transition count 154
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 234 place count 50 transition count 142
Iterating global reduction 5 with 6 rules applied. Total rules applied 240 place count 50 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 246 place count 50 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 50 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 250 place count 48 transition count 134
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 252 place count 48 transition count 134
Applied a total of 252 rules in 13 ms. Remains 48 /115 variables (removed 67) and now considering 134/303 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 48/115 places, 134/303 transitions.
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 323 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 313 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-07 23:14:26] [INFO ] Flow matrix only has 121 transitions (discarded 13 similar events)
// Phase 1: matrix 121 rows 48 cols
[2023-03-07 23:14:26] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 23:14:26] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 23:14:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-07 23:14:26] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-07 23:14:26] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-07 23:14:26] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 134/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 48/48 places, 134/134 transitions.
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1401 steps, run visited all 2 properties in 9 ms. (steps per millisecond=155 )
Probabilistic random walk after 1401 steps, saw 700 distinct states, run finished after 9 ms. (steps per millisecond=155 ) properties seen :2
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 p2 p1)), (F (NOT (AND p2 p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) p2 p1))), (F p0), (F (AND p0 (NOT p2))), (F (AND (NOT p2) p1)), (F (NOT p1)), (F (AND p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 39 factoid took 6297 ms. Reduced automaton from 12 states, 50 edges and 3 AP (stutter sensitive) to 12 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 479 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 303/303 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2023-03-07 23:14:33] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
// Phase 1: matrix 246 rows 115 cols
[2023-03-07 23:14:33] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 23:14:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 23:14:33] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:33] [INFO ] Invariant cache hit.
[2023-03-07 23:14:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 23:14:33] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-07 23:14:33] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:33] [INFO ] Invariant cache hit.
[2023-03-07 23:14:34] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 115/115 places, 303/303 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 p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 7478 ms. Reduced automaton from 12 states, 41 edges and 3 AP (stutter sensitive) to 12 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 537 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1333 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 304 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 332 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 221 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-07 23:14:42] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:42] [INFO ] Invariant cache hit.
[2023-03-07 23:14:42] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 23:14:42] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 23:14:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 23:14:42] [INFO ] After 31ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-07 23:14:42] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-07 23:14:42] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 303/303 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 115 transition count 249
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 56 rules applied. Total rules applied 110 place count 87 transition count 220
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 1 with 22 rules applied. Total rules applied 132 place count 87 transition count 198
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 86 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 3 with 2 rules applied. Total rules applied 136 place count 85 transition count 196
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 170 place count 68 transition count 212
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 198 place count 68 transition count 184
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 210 place count 56 transition count 160
Iterating global reduction 4 with 12 rules applied. Total rules applied 222 place count 56 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 228 place count 56 transition count 154
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 234 place count 50 transition count 142
Iterating global reduction 5 with 6 rules applied. Total rules applied 240 place count 50 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 246 place count 50 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 50 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 250 place count 48 transition count 134
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 252 place count 48 transition count 134
Applied a total of 252 rules in 13 ms. Remains 48 /115 variables (removed 67) and now considering 134/303 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 48/115 places, 134/303 transitions.
Incomplete random walk after 10000 steps, including 1387 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 317 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 218 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-07 23:14:42] [INFO ] Flow matrix only has 121 transitions (discarded 13 similar events)
// Phase 1: matrix 121 rows 48 cols
[2023-03-07 23:14:42] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 23:14:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:14:42] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:14:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-07 23:14:42] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:14:42] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-07 23:14:42] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 134/134 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 48 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 47 transition count 132
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 15 place count 47 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 43 transition count 116
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 43 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 43 transition count 113
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 3 with 2 rules applied. Total rules applied 28 place count 42 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 42 transition count 110
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 57 place count 42 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 39 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 39 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 66 place count 39 transition count 71
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 69 place count 36 transition count 68
Iterating global reduction 5 with 3 rules applied. Total rules applied 72 place count 36 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 75 place count 36 transition count 65
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 78 place count 36 transition count 62
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 81 place count 36 transition count 59
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1446.t1447.t1448.t1449.t1450.t1451.t1452.t1453.t1454.t1908.t1684.t1685.t1686.t1687.t1688.t1689.t1690.t1691.t1692.t1694.t1762.t1695.t1696.t1742.t1743.t1700.t1701.t1702.t1703.t1704.t1798.t1812 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 31 edges and 31 vertex of which 22 / 31 are part of one of the 8 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 6 with 6 rules applied. Total rules applied 87 place count 17 transition count 54
Drop transitions removed 22 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 117 place count 17 transition count 24
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 120 place count 14 transition count 21
Iterating global reduction 8 with 3 rules applied. Total rules applied 123 place count 14 transition count 21
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 129 place count 11 transition count 16
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 132 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 133 place count 11 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 135 place count 11 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 137 place count 9 transition count 10
Applied a total of 137 rules in 12 ms. Remains 9 /48 variables (removed 39) and now considering 10/134 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 9/48 places, 10/134 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 p2)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 23 factoid took 7952 ms. Reduced automaton from 12 states, 41 edges and 3 AP (stutter sensitive) to 12 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 408 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20897 reset in 139 ms.
Product exploration explored 100000 steps with 20937 reset in 143 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 303/303 transitions.
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 115 transition count 267
Applied a total of 36 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 267/303 (removed 36) transitions.
[2023-03-07 23:14:53] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-07 23:14:53] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 115 cols
[2023-03-07 23:14:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-07 23:14:53] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/115 places, 267/303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 115/115 places, 267/303 transitions.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 303/303 transitions.
Applied a total of 0 rules in 0 ms. Remains 115 /115 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2023-03-07 23:14:53] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
// Phase 1: matrix 246 rows 115 cols
[2023-03-07 23:14:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:14:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-07 23:14:53] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:53] [INFO ] Invariant cache hit.
[2023-03-07 23:14:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 23:14:53] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-07 23:14:53] [INFO ] Flow matrix only has 246 transitions (discarded 57 similar events)
[2023-03-07 23:14:53] [INFO ] Invariant cache hit.
[2023-03-07 23:14:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 115/115 places, 303/303 transitions.
Treatment of property CloudReconfiguration-PT-311-LTLFireability-00 finished in 35526 ms.
[2023-03-07 23:14:53] [INFO ] Flatten gal took : 51 ms
[2023-03-07 23:14:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-07 23:14:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1533 places, 1959 transitions and 4091 arcs took 13 ms.
Total runtime 115500 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CloudReconfiguration-PT-311
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678231000211

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CloudReconfiguration-PT-311-LTLFireability-00
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 3/32 CloudReconfiguration-PT-311-LTLFireability-00 154057 m, 30811 m/sec, 507565 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 5/32 CloudReconfiguration-PT-311-LTLFireability-00 293407 m, 27870 m/sec, 1042550 t fired, .

Time elapsed: 11 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 6/32 CloudReconfiguration-PT-311-LTLFireability-00 426544 m, 26627 m/sec, 1565585 t fired, .

Time elapsed: 16 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 8/32 CloudReconfiguration-PT-311-LTLFireability-00 604848 m, 35660 m/sec, 2061778 t fired, .

Time elapsed: 21 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 10/32 CloudReconfiguration-PT-311-LTLFireability-00 750850 m, 29200 m/sec, 2513511 t fired, .

Time elapsed: 26 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3599 12/32 CloudReconfiguration-PT-311-LTLFireability-00 900193 m, 29868 m/sec, 2965079 t fired, .

Time elapsed: 31 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3599 14/32 CloudReconfiguration-PT-311-LTLFireability-00 1043729 m, 28707 m/sec, 3417081 t fired, .

Time elapsed: 36 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3599 16/32 CloudReconfiguration-PT-311-LTLFireability-00 1181799 m, 27614 m/sec, 3873836 t fired, .

Time elapsed: 41 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3599 18/32 CloudReconfiguration-PT-311-LTLFireability-00 1311795 m, 25999 m/sec, 4287900 t fired, .

Time elapsed: 46 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3599 20/32 CloudReconfiguration-PT-311-LTLFireability-00 1438103 m, 25261 m/sec, 4715585 t fired, .

Time elapsed: 51 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3599 21/32 CloudReconfiguration-PT-311-LTLFireability-00 1594737 m, 31326 m/sec, 5127224 t fired, .

Time elapsed: 56 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3599 22/32 CloudReconfiguration-PT-311-LTLFireability-00 1732787 m, 27610 m/sec, 5565039 t fired, .

Time elapsed: 61 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3599 23/32 CloudReconfiguration-PT-311-LTLFireability-00 1871767 m, 27796 m/sec, 5992823 t fired, .

Time elapsed: 66 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3599 24/32 CloudReconfiguration-PT-311-LTLFireability-00 2023377 m, 30322 m/sec, 6444944 t fired, .

Time elapsed: 71 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3599 25/32 CloudReconfiguration-PT-311-LTLFireability-00 2162987 m, 27922 m/sec, 6905142 t fired, .

Time elapsed: 76 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3599 25/32 CloudReconfiguration-PT-311-LTLFireability-00 2292596 m, 25921 m/sec, 7345409 t fired, .

Time elapsed: 81 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3599 27/32 CloudReconfiguration-PT-311-LTLFireability-00 2427412 m, 26963 m/sec, 7764853 t fired, .

Time elapsed: 86 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3599 29/32 CloudReconfiguration-PT-311-LTLFireability-00 2550691 m, 24655 m/sec, 8212557 t fired, .

Time elapsed: 91 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3599 30/32 CloudReconfiguration-PT-311-LTLFireability-00 2674839 m, 24829 m/sec, 8632760 t fired, .

Time elapsed: 96 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3599 32/32 CloudReconfiguration-PT-311-LTLFireability-00 2796172 m, 24266 m/sec, 9070749 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CloudReconfiguration-PT-311-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudReconfiguration-PT-311-LTLFireability-00: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudReconfiguration-PT-311-LTLFireability-00: LTL unknown AGGR


Time elapsed: 106 secs. Pages in use: 32

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-311"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is CloudReconfiguration-PT-311, 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 r103-tall-167814477900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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