Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 19:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716306762907

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-311
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 15:52:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:52:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:52:44] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-21 15:52:44] [INFO ] Transformed 2585 places.
[2024-05-21 15:52:44] [INFO ] Transformed 3095 transitions.
[2024-05-21 15:52:44] [INFO ] Found NUPN structural information;
[2024-05-21 15:52:44] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2069 transition count 2579
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2069 transition count 2579
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 1059 place count 2069 transition count 2552
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1298 place count 1830 transition count 2313
Iterating global reduction 1 with 239 rules applied. Total rules applied 1537 place count 1830 transition count 2313
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1625 place count 1742 transition count 2225
Iterating global reduction 1 with 88 rules applied. Total rules applied 1713 place count 1742 transition count 2225
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1729 place count 1742 transition count 2209
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1778 place count 1693 transition count 2160
Iterating global reduction 2 with 49 rules applied. Total rules applied 1827 place count 1693 transition count 2160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1836 place count 1693 transition count 2151
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1874 place count 1655 transition count 2108
Iterating global reduction 3 with 38 rules applied. Total rules applied 1912 place count 1655 transition count 2108
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1939 place count 1628 transition count 2081
Iterating global reduction 3 with 27 rules applied. Total rules applied 1966 place count 1628 transition count 2081
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1990 place count 1604 transition count 2057
Iterating global reduction 3 with 24 rules applied. Total rules applied 2014 place count 1604 transition count 2057
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2038 place count 1580 transition count 2033
Iterating global reduction 3 with 24 rules applied. Total rules applied 2062 place count 1580 transition count 2033
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2083 place count 1559 transition count 1999
Iterating global reduction 3 with 21 rules applied. Total rules applied 2104 place count 1559 transition count 1999
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2110 place count 1553 transition count 1988
Iterating global reduction 3 with 6 rules applied. Total rules applied 2116 place count 1553 transition count 1988
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2122 place count 1547 transition count 1979
Iterating global reduction 3 with 6 rules applied. Total rules applied 2128 place count 1547 transition count 1979
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2130 place count 1547 transition count 1977
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2133 place count 1544 transition count 1974
Iterating global reduction 4 with 3 rules applied. Total rules applied 2136 place count 1544 transition count 1974
Applied a total of 2136 rules in 1664 ms. Remains 1544 /2585 variables (removed 1041) and now considering 1974/3095 (removed 1121) transitions.
// Phase 1: matrix 1974 rows 1544 cols
[2024-05-21 15:52:46] [INFO ] Computed 4 invariants in 31 ms
[2024-05-21 15:52:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 15:52:47] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-21 15:52:47] [INFO ] Invariant cache hit.
[2024-05-21 15:52:47] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2024-05-21 15:52:47] [INFO ] Invariant cache hit.
[2024-05-21 15:52:48] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1544/2585 places, 1974/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3986 ms. Remains : 1544/2585 places, 1974/3095 transitions.
Support contains 35 out of 1544 places after structural reductions.
[2024-05-21 15:52:49] [INFO ] Flatten gal took : 124 ms
[2024-05-21 15:52:49] [INFO ] Flatten gal took : 65 ms
[2024-05-21 15:52:49] [INFO ] Input system was already deterministic with 1974 transitions.
Support contains 29 out of 1544 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-21 15:52:49] [INFO ] Invariant cache hit.
[2024-05-21 15:52:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:52:51] [INFO ] After 1318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-21 15:52:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 17 ms returned sat
[2024-05-21 15:52:54] [INFO ] After 1789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-21 15:52:55] [INFO ] After 3635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 987 ms.
[2024-05-21 15:52:56] [INFO ] After 5645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 8 properties in 243 ms.
Support contains 13 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1860 edges and 1544 vertex of which 664 / 1544 are part of one of the 60 SCC in 7 ms
Free SCC test removed 604 places
Drop transitions removed 761 transitions
Reduce isomorphic transitions removed 761 transitions.
Graph (complete) has 1385 edges and 940 vertex of which 931 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 519 rules applied. Total rules applied 521 place count 931 transition count 690
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 569 rules applied. Total rules applied 1090 place count 419 transition count 633
Reduce places removed 36 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 40 rules applied. Total rules applied 1130 place count 383 transition count 629
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1134 place count 379 transition count 629
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1134 place count 379 transition count 578
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1236 place count 328 transition count 578
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1244 place count 320 transition count 568
Iterating global reduction 4 with 8 rules applied. Total rules applied 1252 place count 320 transition count 568
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 1253 place count 320 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1254 place count 319 transition count 567
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1260 place count 313 transition count 561
Iterating global reduction 6 with 6 rules applied. Total rules applied 1266 place count 313 transition count 561
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1272 place count 313 transition count 555
Performed 164 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 164 places in 1 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 7 with 328 rules applied. Total rules applied 1600 place count 149 transition count 289
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1622 place count 149 transition count 267
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1625 place count 146 transition count 264
Iterating global reduction 8 with 3 rules applied. Total rules applied 1628 place count 146 transition count 264
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1652 place count 134 transition count 250
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1666 place count 134 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 133 transition count 235
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1669 place count 133 transition count 234
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1735 place count 100 transition count 265
Drop transitions removed 10 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 1770 place count 100 transition count 230
Discarding 19 places :
Symmetric choice reduction at 11 with 19 rule applications. Total rules 1789 place count 81 transition count 199
Iterating global reduction 11 with 19 rules applied. Total rules applied 1808 place count 81 transition count 199
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1818 place count 81 transition count 189
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1820 place count 79 transition count 185
Iterating global reduction 12 with 2 rules applied. Total rules applied 1822 place count 79 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1823 place count 79 transition count 184
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 13 with 16 rules applied. Total rules applied 1839 place count 79 transition count 168
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1841 place count 77 transition count 164
Iterating global reduction 13 with 2 rules applied. Total rules applied 1843 place count 77 transition count 164
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1844 place count 76 transition count 163
Iterating global reduction 13 with 1 rules applied. Total rules applied 1845 place count 76 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1846 place count 76 transition count 162
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1847 place count 76 transition count 161
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 1852 place count 76 transition count 156
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1858 place count 71 transition count 155
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1859 place count 71 transition count 154
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 1864 place count 71 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1865 place count 71 transition count 153
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1866 place count 71 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1867 place count 70 transition count 152
Applied a total of 1867 rules in 180 ms. Remains 70 /1544 variables (removed 1474) and now considering 152/1974 (removed 1822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 70/1544 places, 152/1974 transitions.
Finished random walk after 3775 steps, including 39 resets, run visited all 9 properties in 44 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2151 edges and 1544 vertex of which 1535 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U G((G(p2) U p3))))'
Support contains 5 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1877 edges and 1544 vertex of which 694 / 1544 are part of one of the 62 SCC in 3 ms
Free SCC test removed 632 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1412 edges and 912 vertex of which 903 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 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 902 transition count 741
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 521 rules applied. Total rules applied 1017 place count 408 transition count 714
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 1032 place count 395 transition count 712
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1034 place count 393 transition count 712
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1034 place count 393 transition count 664
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1130 place count 345 transition count 664
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1144 place count 331 transition count 642
Iterating global reduction 4 with 14 rules applied. Total rules applied 1158 place count 331 transition count 642
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 1159 place count 331 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1160 place count 330 transition count 641
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1169 place count 321 transition count 629
Iterating global reduction 6 with 9 rules applied. Total rules applied 1178 place count 321 transition count 629
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1184 place count 321 transition count 623
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1186 place count 319 transition count 619
Iterating global reduction 7 with 2 rules applied. Total rules applied 1188 place count 319 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1190 place count 317 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1192 place count 317 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 315 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 313 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 313 transition count 607
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1201 place count 312 transition count 605
Iterating global reduction 7 with 1 rules applied. Total rules applied 1202 place count 312 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1203 place count 311 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 1204 place count 311 transition count 598
Performed 143 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1490 place count 168 transition count 375
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1506 place count 168 transition count 359
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1511 place count 163 transition count 352
Iterating global reduction 8 with 5 rules applied. Total rules applied 1516 place count 163 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1517 place count 163 transition count 351
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1541 place count 151 transition count 337
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1554 place count 151 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1590 place count 133 transition count 360
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1608 place count 133 transition count 342
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1617 place count 124 transition count 324
Iterating global reduction 11 with 9 rules applied. Total rules applied 1626 place count 124 transition count 324
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1632 place count 124 transition count 318
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 12 with 38 rules applied. Total rules applied 1670 place count 124 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1671 place count 124 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1672 place count 123 transition count 279
Applied a total of 1672 rules in 144 ms. Remains 123 /1544 variables (removed 1421) and now considering 279/1974 (removed 1695) transitions.
[2024-05-21 15:52:57] [INFO ] Flow matrix only has 222 transitions (discarded 57 similar events)
// Phase 1: matrix 222 rows 123 cols
[2024-05-21 15:52:57] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 15:52:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 15:52:57] [INFO ] Flow matrix only has 222 transitions (discarded 57 similar events)
[2024-05-21 15:52:57] [INFO ] Invariant cache hit.
[2024-05-21 15:52:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:52:57] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [14, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/1544 places, 279/1974 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 119 transition count 277
Applied a total of 4 rules in 8 ms. Remains 119 /121 variables (removed 2) and now considering 277/279 (removed 2) transitions.
[2024-05-21 15:52:57] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
// Phase 1: matrix 220 rows 119 cols
[2024-05-21 15:52:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:52:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:52:58] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
[2024-05-21 15:52:58] [INFO ] Invariant cache hit.
[2024-05-21 15:52:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:52:58] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1544 places, 277/1974 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 503 ms. Remains : 119/1544 places, 277/1974 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 574 ms :[(NOT p3), true, (NOT p1), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p1) (AND p3 p0) (AND p2 p1) (AND p2 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=0 dest: 6}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={1} source=0 dest: 7}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={0, 1} source=0 dest: 8}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 2}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={0} source=7 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 p2 p1) (AND p3 p2 p0)), acceptance={} source=7 dest: 7}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={1} source=7 dest: 7}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={1} source=8 dest: 7}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p3 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(OR (EQ s62 1) (EQ s10 0) (EQ s28 1)), p1:(AND (OR (EQ s10 0) (EQ s28 1)) (OR (EQ s113 0) (EQ s9 1))), p0:(EQ s62 1), p2:(OR (EQ s113 0) (EQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11285 steps with 1427 reset in 56 ms.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-01 finished in 1193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(F(p2))))))'
Support contains 5 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1530 transition count 1960
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1530 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1530 transition count 1958
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 1522 transition count 1950
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 1522 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1522 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 1519 transition count 1945
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 1519 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1519 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 1518 transition count 1943
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 1517 transition count 1942
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 1516 transition count 1941
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 1515 transition count 1939
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 1514 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1513 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1513 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 1513 transition count 1935
Applied a total of 67 rules in 444 ms. Remains 1513 /1544 variables (removed 31) and now considering 1935/1974 (removed 39) transitions.
// Phase 1: matrix 1935 rows 1513 cols
[2024-05-21 15:52:59] [INFO ] Computed 4 invariants in 22 ms
[2024-05-21 15:52:59] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 15:52:59] [INFO ] Invariant cache hit.
[2024-05-21 15:53:00] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2024-05-21 15:53:00] [INFO ] Invariant cache hit.
[2024-05-21 15:53:01] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1544 places, 1935/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2222 ms. Remains : 1513/1544 places, 1935/1974 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1053 0) (EQ s1194 1)), p1:(OR (EQ s311 0) (EQ s1143 1)), p2:(AND (EQ s1126 1) (OR (EQ s1053 0) (EQ s1194 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1037 ms.
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-311-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-03 finished in 4459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1530 transition count 1960
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1530 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1530 transition count 1959
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1521 transition count 1950
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1521 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1521 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 1517 transition count 1944
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 1517 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 1515 transition count 1941
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 1515 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 1513 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 1511 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 1511 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 1509 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 1509 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 1508 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 1507 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 1507 transition count 1930
Applied a total of 78 rules in 453 ms. Remains 1507 /1544 variables (removed 37) and now considering 1930/1974 (removed 44) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 15:53:03] [INFO ] Computed 4 invariants in 19 ms
[2024-05-21 15:53:03] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 15:53:03] [INFO ] Invariant cache hit.
[2024-05-21 15:53:04] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2024-05-21 15:53:04] [INFO ] Invariant cache hit.
[2024-05-21 15:53:05] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1544 places, 1930/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2329 ms. Remains : 1507/1544 places, 1930/1974 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1173 0) (EQ s839 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 786 ms.
Product exploration explored 100000 steps with 50000 reset in 789 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-311-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-05 finished in 4056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))&&X((G(p0)||F(G(p2)))))))'
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1879 edges and 1544 vertex of which 700 / 1544 are part of one of the 62 SCC in 5 ms
Free SCC test removed 638 places
Ensure Unique test removed 742 transitions
Reduce isomorphic transitions removed 742 transitions.
Graph (complete) has 1403 edges and 906 vertex of which 897 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 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 735
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 516 rules applied. Total rules applied 1009 place count 405 transition count 710
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1021 place count 393 transition count 710
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1021 place count 393 transition count 662
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1117 place count 345 transition count 662
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1131 place count 331 transition count 640
Iterating global reduction 3 with 14 rules applied. Total rules applied 1145 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 1146 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 1147 place count 330 transition count 639
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1157 place count 320 transition count 625
Iterating global reduction 5 with 10 rules applied. Total rules applied 1167 place count 320 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1173 place count 320 transition count 619
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1175 place count 318 transition count 615
Iterating global reduction 6 with 2 rules applied. Total rules applied 1177 place count 318 transition count 615
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1179 place count 316 transition count 611
Iterating global reduction 6 with 2 rules applied. Total rules applied 1181 place count 316 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1183 place count 314 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1185 place count 314 transition count 607
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1187 place count 312 transition count 603
Iterating global reduction 6 with 2 rules applied. Total rules applied 1189 place count 312 transition count 603
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1191 place count 310 transition count 599
Iterating global reduction 6 with 2 rules applied. Total rules applied 1193 place count 310 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1194 place count 309 transition count 592
Iterating global reduction 6 with 1 rules applied. Total rules applied 1195 place count 309 transition count 592
Performed 144 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1483 place count 165 transition count 364
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1495 place count 165 transition count 352
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1499 place count 161 transition count 347
Iterating global reduction 7 with 4 rules applied. Total rules applied 1503 place count 161 transition count 347
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 7 with 24 rules applied. Total rules applied 1527 place count 149 transition count 333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1540 place count 149 transition count 320
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1578 place count 130 transition count 354
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1596 place count 130 transition count 336
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1605 place count 121 transition count 318
Iterating global reduction 9 with 9 rules applied. Total rules applied 1614 place count 121 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1620 place count 121 transition count 312
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 1657 place count 121 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1658 place count 120 transition count 274
Applied a total of 1658 rules in 89 ms. Remains 120 /1544 variables (removed 1424) and now considering 274/1974 (removed 1700) transitions.
[2024-05-21 15:53:07] [INFO ] Flow matrix only has 218 transitions (discarded 56 similar events)
// Phase 1: matrix 218 rows 120 cols
[2024-05-21 15:53:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:53:07] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 15:53:07] [INFO ] Flow matrix only has 218 transitions (discarded 56 similar events)
[2024-05-21 15:53:07] [INFO ] Invariant cache hit.
[2024-05-21 15:53:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:53:07] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [11, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 304 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1544 places, 274/1974 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 116 transition count 272
Applied a total of 4 rules in 6 ms. Remains 116 /118 variables (removed 2) and now considering 272/274 (removed 2) transitions.
[2024-05-21 15:53:07] [INFO ] Flow matrix only has 216 transitions (discarded 56 similar events)
// Phase 1: matrix 216 rows 116 cols
[2024-05-21 15:53:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:53:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 15:53:07] [INFO ] Flow matrix only has 216 transitions (discarded 56 similar events)
[2024-05-21 15:53:07] [INFO ] Invariant cache hit.
[2024-05-21 15:53:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:53:07] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1544 places, 272/1974 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 615 ms. Remains : 116/1544 places, 272/1974 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={1, 2} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={1, 2} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=3 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1, 2} source=3 dest: 5}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={1} source=4 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={1, 2} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=4 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={1} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={1, 2} source=5 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=5 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s40 1), p0:(EQ s98 1), p2:(OR (EQ s8 0) (EQ s91 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-06 finished in 1005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(X(X(p2))))))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1531 transition count 1961
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1531 transition count 1959
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 1523 transition count 1951
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 1523 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1523 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 1519 transition count 1945
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 1519 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 1517 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 1513 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 1510 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 1509 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 1509 transition count 1931
Applied a total of 75 rules in 423 ms. Remains 1509 /1544 variables (removed 35) and now considering 1931/1974 (removed 43) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 15:53:08] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 15:53:08] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 15:53:08] [INFO ] Invariant cache hit.
[2024-05-21 15:53:09] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2024-05-21 15:53:09] [INFO ] Invariant cache hit.
[2024-05-21 15:53:10] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1544 places, 1931/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2327 ms. Remains : 1509/1544 places, 1931/1974 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={1} source=2 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1015 1) (EQ s558 0) (EQ s210 1)), p1:(EQ s1015 0), p2:(EQ s1015 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 996 reset in 213 ms.
Product exploration explored 100000 steps with 1015 reset in 279 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 102 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 301954 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301954 steps, saw 77943 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 15:53:15] [INFO ] Invariant cache hit.
[2024-05-21 15:53:15] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 15:53:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 15:53:16] [INFO ] After 957ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 15:53:17] [INFO ] After 1353ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 227 ms.
[2024-05-21 15:53:17] [INFO ] After 1974ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=116 )
Parikh walk visited 3 properties in 7 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Graph (trivial) has 1837 edges and 1509 vertex of which 683 / 1509 are part of one of the 63 SCC in 2 ms
Free SCC test removed 620 places
Drop transitions removed 783 transitions
Reduce isomorphic transitions removed 783 transitions.
Graph (complete) has 1320 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 880 transition count 645
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 552 rules applied. Total rules applied 1053 place count 388 transition count 585
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1093 place count 349 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1094 place count 348 transition count 584
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1094 place count 348 transition count 534
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 1194 place count 298 transition count 534
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1204 place count 288 transition count 520
Iterating global reduction 4 with 10 rules applied. Total rules applied 1214 place count 288 transition count 520
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1217 place count 288 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1220 place count 285 transition count 517
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1227 place count 278 transition count 509
Iterating global reduction 6 with 7 rules applied. Total rules applied 1234 place count 278 transition count 509
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1240 place count 278 transition count 503
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1241 place count 277 transition count 497
Iterating global reduction 7 with 1 rules applied. Total rules applied 1242 place count 277 transition count 497
Performed 148 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 1538 place count 129 transition count 251
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1555 place count 129 transition count 234
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1558 place count 126 transition count 231
Iterating global reduction 8 with 3 rules applied. Total rules applied 1561 place count 126 transition count 231
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1587 place count 113 transition count 215
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1601 place count 113 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1603 place count 112 transition count 200
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1605 place count 112 transition count 198
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 10 with 64 rules applied. Total rules applied 1669 place count 80 transition count 229
Drop transitions removed 20 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 1713 place count 80 transition count 185
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 1734 place count 59 transition count 157
Iterating global reduction 11 with 21 rules applied. Total rules applied 1755 place count 59 transition count 157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1768 place count 59 transition count 144
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1773 place count 54 transition count 134
Iterating global reduction 12 with 5 rules applied. Total rules applied 1778 place count 54 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1783 place count 54 transition count 129
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1803 place count 54 transition count 109
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1805 place count 52 transition count 103
Iterating global reduction 13 with 2 rules applied. Total rules applied 1807 place count 52 transition count 103
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1809 place count 50 transition count 101
Iterating global reduction 13 with 2 rules applied. Total rules applied 1811 place count 50 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1813 place count 50 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1815 place count 50 transition count 97
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1819 place count 50 transition count 93
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1825 place count 46 transition count 91
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1827 place count 46 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1828 place count 46 transition count 90
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1829 place count 45 transition count 89
Iterating global reduction 15 with 1 rules applied. Total rules applied 1830 place count 45 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1831 place count 44 transition count 88
Applied a total of 1831 rules in 67 ms. Remains 44 /1509 variables (removed 1465) and now considering 88/1931 (removed 1843) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 44/1509 places, 88/1931 transitions.
Finished random walk after 135 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 390 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 43 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 15:53:18] [INFO ] Invariant cache hit.
[2024-05-21 15:53:18] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 15:53:18] [INFO ] Invariant cache hit.
[2024-05-21 15:53:19] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-21 15:53:19] [INFO ] Invariant cache hit.
[2024-05-21 15:53:20] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1892 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 163 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 102 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 302489 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302489 steps, saw 78344 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 15:53:23] [INFO ] Invariant cache hit.
[2024-05-21 15:53:24] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 15:53:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 15:53:25] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 15:53:25] [INFO ] After 1385ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 225 ms.
[2024-05-21 15:53:26] [INFO ] After 2005ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
Parikh walk visited 3 properties in 4 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Graph (trivial) has 1837 edges and 1509 vertex of which 683 / 1509 are part of one of the 63 SCC in 2 ms
Free SCC test removed 620 places
Drop transitions removed 783 transitions
Reduce isomorphic transitions removed 783 transitions.
Graph (complete) has 1320 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 880 transition count 645
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 552 rules applied. Total rules applied 1053 place count 388 transition count 585
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1093 place count 349 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1094 place count 348 transition count 584
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1094 place count 348 transition count 534
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 1194 place count 298 transition count 534
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1204 place count 288 transition count 520
Iterating global reduction 4 with 10 rules applied. Total rules applied 1214 place count 288 transition count 520
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1217 place count 288 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1220 place count 285 transition count 517
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1227 place count 278 transition count 509
Iterating global reduction 6 with 7 rules applied. Total rules applied 1234 place count 278 transition count 509
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1240 place count 278 transition count 503
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1241 place count 277 transition count 497
Iterating global reduction 7 with 1 rules applied. Total rules applied 1242 place count 277 transition count 497
Performed 148 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 1538 place count 129 transition count 251
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1555 place count 129 transition count 234
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1558 place count 126 transition count 231
Iterating global reduction 8 with 3 rules applied. Total rules applied 1561 place count 126 transition count 231
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1587 place count 113 transition count 215
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1601 place count 113 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1603 place count 112 transition count 200
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1605 place count 112 transition count 198
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 10 with 64 rules applied. Total rules applied 1669 place count 80 transition count 229
Drop transitions removed 20 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 1713 place count 80 transition count 185
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 1734 place count 59 transition count 157
Iterating global reduction 11 with 21 rules applied. Total rules applied 1755 place count 59 transition count 157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1768 place count 59 transition count 144
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1773 place count 54 transition count 134
Iterating global reduction 12 with 5 rules applied. Total rules applied 1778 place count 54 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1783 place count 54 transition count 129
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1803 place count 54 transition count 109
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1805 place count 52 transition count 103
Iterating global reduction 13 with 2 rules applied. Total rules applied 1807 place count 52 transition count 103
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1809 place count 50 transition count 101
Iterating global reduction 13 with 2 rules applied. Total rules applied 1811 place count 50 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1813 place count 50 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1815 place count 50 transition count 97
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1819 place count 50 transition count 93
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1825 place count 46 transition count 91
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1827 place count 46 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1828 place count 46 transition count 90
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1829 place count 45 transition count 89
Iterating global reduction 15 with 1 rules applied. Total rules applied 1830 place count 45 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1831 place count 44 transition count 88
Applied a total of 1831 rules in 49 ms. Remains 44 /1509 variables (removed 1465) and now considering 88/1931 (removed 1843) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 44/1509 places, 88/1931 transitions.
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1038 reset in 157 ms.
Product exploration explored 100000 steps with 989 reset in 159 ms.
Built C files in :
/tmp/ltsmin13060253615651943223
[2024-05-21 15:53:27] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13060253615651943223
Running compilation step : cd /tmp/ltsmin13060253615651943223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13060253615651943223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13060253615651943223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 47 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 15:53:30] [INFO ] Invariant cache hit.
[2024-05-21 15:53:30] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 15:53:30] [INFO ] Invariant cache hit.
[2024-05-21 15:53:31] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2024-05-21 15:53:31] [INFO ] Invariant cache hit.
[2024-05-21 15:53:32] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1953 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Built C files in :
/tmp/ltsmin8837045806013599467
[2024-05-21 15:53:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8837045806013599467
Running compilation step : cd /tmp/ltsmin8837045806013599467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8837045806013599467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8837045806013599467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 15:53:35] [INFO ] Flatten gal took : 55 ms
[2024-05-21 15:53:35] [INFO ] Flatten gal took : 50 ms
[2024-05-21 15:53:35] [INFO ] Time to serialize gal into /tmp/LTL7942747245781027210.gal : 11 ms
[2024-05-21 15:53:35] [INFO ] Time to serialize properties into /tmp/LTL3579469890367369442.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7942747245781027210.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18360871609855705173.hoa' '-atoms' '/tmp/LTL3579469890367369442.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3579469890367369442.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18360871609855705173.hoa
Detected timeout of ITS tools.
[2024-05-21 15:53:51] [INFO ] Flatten gal took : 47 ms
[2024-05-21 15:53:51] [INFO ] Flatten gal took : 43 ms
[2024-05-21 15:53:51] [INFO ] Time to serialize gal into /tmp/LTL13285200639316829849.gal : 7 ms
[2024-05-21 15:53:51] [INFO ] Time to serialize properties into /tmp/LTL13747349405260547414.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13285200639316829849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13747349405260547414.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p1721==1)||(p954==0))||(p451==1))"))||(G(("(p1721==0)")||(X(X(X("(p1721==1)")))))))))
Formula 0 simplified : G(F!"(((p1721==1)||(p954==0))||(p451==1))" & F(!"(p1721==0)" & XXX!"(p1721==1)"))
Detected timeout of ITS tools.
[2024-05-21 15:54:06] [INFO ] Flatten gal took : 39 ms
[2024-05-21 15:54:06] [INFO ] Applying decomposition
[2024-05-21 15:54:06] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15622284828882870469.txt' '-o' '/tmp/graph15622284828882870469.bin' '-w' '/tmp/graph15622284828882870469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15622284828882870469.bin' '-l' '-1' '-v' '-w' '/tmp/graph15622284828882870469.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:54:06] [INFO ] Decomposing Gal with order
[2024-05-21 15:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:54:06] [INFO ] Removed a total of 517 redundant transitions.
[2024-05-21 15:54:06] [INFO ] Flatten gal took : 290 ms
[2024-05-21 15:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 59 ms.
[2024-05-21 15:54:07] [INFO ] Time to serialize gal into /tmp/LTL11853294821423084014.gal : 37 ms
[2024-05-21 15:54:07] [INFO ] Time to serialize properties into /tmp/LTL16051088376929610937.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11853294821423084014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16051088376929610937.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i20.i0.i2.u414.p1721==1)||(i17.i1.i2.u223.p954==0))||(i5.u80.p451==1))"))||(G(("(i20.i0.i2.u414.p1721==0)")||(X(X(X("(i20....185
Formula 0 simplified : G(F!"(((i20.i0.i2.u414.p1721==1)||(i17.i1.i2.u223.p954==0))||(i5.u80.p451==1))" & F(!"(i20.i0.i2.u414.p1721==0)" & XXX!"(i20.i0.i2.u...171
Reverse transition relation is NOT exact ! Due to transitions t26, t185, t214, t268, t328, t377, t450, t502, t666, t695, t747, t778, t807, t856, t1171, t12...2050
Computing Next relation with stutter on 62480 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15045339850384657744
[2024-05-21 15:54:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15045339850384657744
Running compilation step : cd /tmp/ltsmin15045339850384657744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15045339850384657744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15045339850384657744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-07 finished in 76846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X(X(p1))))||((p0||X(X(p1)))&&X(F(p0))))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1529 transition count 1959
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1529 transition count 1959
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1529 transition count 1957
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 1520 transition count 1948
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1520 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 1516 transition count 1942
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1514 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1512 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1510 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 1508 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 1507 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 1506 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 1506 transition count 1928
Applied a total of 81 rules in 478 ms. Remains 1506 /1544 variables (removed 38) and now considering 1928/1974 (removed 46) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 15:54:25] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 15:54:25] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 15:54:25] [INFO ] Invariant cache hit.
[2024-05-21 15:54:26] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-05-21 15:54:26] [INFO ] Invariant cache hit.
[2024-05-21 15:54:27] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1544 places, 1928/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2348 ms. Remains : 1506/1544 places, 1928/1974 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}]], initial=0, aps=[p0:(EQ s957 1), p1:(NEQ s672 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20006 reset in 434 ms.
Product exploration explored 100000 steps with 20053 reset in 481 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 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), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 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 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 295641 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295641 steps, saw 73811 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 15:54:32] [INFO ] Invariant cache hit.
[2024-05-21 15:54:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 15:54:33] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:54:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:54:34] [INFO ] After 896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 15:54:35] [INFO ] After 1308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 236 ms.
[2024-05-21 15:54:35] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 137 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 202 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 687 / 1506 are part of one of the 63 SCC in 2 ms
Free SCC test removed 624 places
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Graph (complete) has 1375 edges and 882 vertex of which 873 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 474 place count 872 transition count 726
Reduce places removed 472 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 496 rules applied. Total rules applied 970 place count 400 transition count 702
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 984 place count 388 transition count 700
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 986 place count 386 transition count 700
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 986 place count 386 transition count 652
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1082 place count 338 transition count 652
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1098 place count 322 transition count 626
Iterating global reduction 4 with 16 rules applied. Total rules applied 1114 place count 322 transition count 626
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1117 place count 322 transition count 623
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1120 place count 319 transition count 623
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1130 place count 309 transition count 609
Iterating global reduction 6 with 10 rules applied. Total rules applied 1140 place count 309 transition count 609
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1146 place count 309 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 307 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 305 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1156 place count 303 transition count 591
Iterating global reduction 7 with 2 rules applied. Total rules applied 1158 place count 303 transition count 591
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1160 place count 301 transition count 587
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 301 transition count 587
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1164 place count 299 transition count 583
Iterating global reduction 7 with 2 rules applied. Total rules applied 1166 place count 299 transition count 583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1168 place count 297 transition count 569
Iterating global reduction 7 with 2 rules applied. Total rules applied 1170 place count 297 transition count 569
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 1171 place count 297 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1172 place count 296 transition count 568
Performed 136 Post agglomeration using F-continuation condition with reduction of 76 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 9 with 272 rules applied. Total rules applied 1444 place count 160 transition count 356
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 12 rules applied. Total rules applied 1456 place count 160 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1458 place count 159 transition count 343
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1462 place count 155 transition count 338
Iterating global reduction 11 with 4 rules applied. Total rules applied 1466 place count 155 transition count 338
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 11 with 22 rules applied. Total rules applied 1488 place count 144 transition count 325
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1500 place count 144 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1502 place count 143 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1503 place count 143 transition count 311
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 1537 place count 126 transition count 345
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 1553 place count 126 transition count 329
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1562 place count 117 transition count 311
Iterating global reduction 14 with 9 rules applied. Total rules applied 1571 place count 117 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1576 place count 117 transition count 306
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 15 with 38 rules applied. Total rules applied 1614 place count 117 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1615 place count 117 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1616 place count 116 transition count 267
Applied a total of 1616 rules in 87 ms. Remains 116 /1506 variables (removed 1390) and now considering 267/1928 (removed 1661) transitions.
[2024-05-21 15:54:36] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-05-21 15:54:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 15:54:36] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 15:54:36] [INFO ] Invariant cache hit.
[2024-05-21 15:54:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [8, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 195 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1506 places, 267/1928 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 112 transition count 265
Applied a total of 4 rules in 4 ms. Remains 112 /114 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 15:54:36] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 112 cols
[2024-05-21 15:54:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 15:54:36] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 15:54:36] [INFO ] Invariant cache hit.
[2024-05-21 15:54:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1506 places, 265/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 433 ms. Remains : 112/1506 places, 265/1928 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 p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 1483 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 348 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:54:36] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 15:54:36] [INFO ] Invariant cache hit.
[2024-05-21 15:54:36] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:54:36] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:54:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:54:36] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:54:36] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 15:54:36] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 265/265 transitions.
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 112 transition count 202
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 104 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 71 place count 104 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 103 transition count 201
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 119 place count 80 transition count 178
Drop transitions removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 134 place count 80 transition count 163
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 146 place count 68 transition count 151
Iterating global reduction 3 with 12 rules applied. Total rules applied 158 place count 68 transition count 151
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 165 place count 68 transition count 144
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 183 place count 59 transition count 135
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 192 place count 59 transition count 126
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 198 place count 53 transition count 120
Iterating global reduction 5 with 6 rules applied. Total rules applied 204 place count 53 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 210 place count 53 transition count 114
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 222 place count 47 transition count 115
Drop transitions removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 232 place count 47 transition count 105
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 237 place count 42 transition count 100
Iterating global reduction 7 with 5 rules applied. Total rules applied 242 place count 42 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 247 place count 42 transition count 95
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 262 place count 42 transition count 80
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 265 place count 39 transition count 71
Iterating global reduction 8 with 3 rules applied. Total rules applied 268 place count 39 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 271 place count 39 transition count 68
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 274 place count 36 transition count 65
Iterating global reduction 9 with 3 rules applied. Total rules applied 277 place count 36 transition count 65
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 283 place count 36 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 285 place count 35 transition count 67
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 289 place count 35 transition count 63
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1454.t1455.t1456.t1457.t1458.t1459.t1460.t1461.t1462.t1899.t1701.t1702.t1703.t1704.t1705.t1706.t1707.t1708.t1709.t1711.t1777.t1712.t1713.t1714.t1716.t1758.t1717.t1718.t1719.t1813.t1827 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 29 edges and 29 vertex of which 19 / 29 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 7 rules applied. Total rules applied 296 place count 18 transition count 57
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 11 with 28 rules applied. Total rules applied 324 place count 17 transition count 30
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 327 place count 14 transition count 27
Iterating global reduction 12 with 3 rules applied. Total rules applied 330 place count 14 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 331 place count 14 transition count 26
Performed 3 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 337 place count 11 transition count 16
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 340 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 341 place count 11 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 343 place count 11 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 345 place count 9 transition count 10
Applied a total of 345 rules in 25 ms. Remains 9 /112 variables (removed 103) and now considering 10/265 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 9/112 places, 10/265 transitions.
Finished random walk after 10 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 282 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 1336 steps with 161 reset in 12 ms.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-09 finished in 12659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U !p0)))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1529 transition count 1959
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1529 transition count 1959
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1529 transition count 1957
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 1520 transition count 1948
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1520 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 1516 transition count 1942
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1514 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1512 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1510 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 1508 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 1507 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 1506 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 1506 transition count 1928
Applied a total of 81 rules in 428 ms. Remains 1506 /1544 variables (removed 38) and now considering 1928/1974 (removed 46) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 15:54:38] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 15:54:38] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 15:54:38] [INFO ] Invariant cache hit.
[2024-05-21 15:54:39] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2024-05-21 15:54:39] [INFO ] Invariant cache hit.
[2024-05-21 15:54:40] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1544 places, 1928/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2224 ms. Remains : 1506/1544 places, 1928/1974 transitions.
Stuttering acceptance computed with spot in 161 ms :[p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1358 0) (EQ s1059 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][false, false, false, false]]
Product exploration explored 100000 steps with 990 reset in 193 ms.
Product exploration explored 100000 steps with 1023 reset in 194 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469770 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469770 steps, saw 125886 distinct states, run finished after 3003 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:54:43] [INFO ] Invariant cache hit.
[2024-05-21 15:54:44] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:54:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:54:45] [INFO ] After 747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:54:45] [INFO ] After 848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-21 15:54:45] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[p0, (NOT p0), (NOT p0)]
[2024-05-21 15:54:45] [INFO ] Invariant cache hit.
[2024-05-21 15:54:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 15:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:54:46] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-05-21 15:54:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:54:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 15:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:54:48] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2024-05-21 15:54:48] [INFO ] Computed and/alt/rep : 1921/2350/1921 causal constraints (skipped 6 transitions) in 84 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 15:55:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 687 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 624 places
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Graph (complete) has 1375 edges and 882 vertex of which 873 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 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 872 transition count 727
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 495 rules applied. Total rules applied 968 place count 401 transition count 703
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 982 place count 389 transition count 701
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 984 place count 387 transition count 701
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 984 place count 387 transition count 653
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1080 place count 339 transition count 653
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1096 place count 323 transition count 627
Iterating global reduction 4 with 16 rules applied. Total rules applied 1112 place count 323 transition count 627
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1115 place count 323 transition count 624
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1118 place count 320 transition count 624
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1128 place count 310 transition count 610
Iterating global reduction 6 with 10 rules applied. Total rules applied 1138 place count 310 transition count 610
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1144 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1146 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1148 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1150 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1152 place count 306 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1154 place count 304 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1156 place count 304 transition count 592
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1158 place count 302 transition count 588
Iterating global reduction 7 with 2 rules applied. Total rules applied 1160 place count 302 transition count 588
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1162 place count 300 transition count 584
Iterating global reduction 7 with 2 rules applied. Total rules applied 1164 place count 300 transition count 584
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1166 place count 298 transition count 570
Iterating global reduction 7 with 2 rules applied. Total rules applied 1168 place count 298 transition count 570
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 1169 place count 298 transition count 569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1170 place count 297 transition count 569
Performed 137 Post agglomeration using F-continuation condition with reduction of 74 identical transitions.
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 9 with 274 rules applied. Total rules applied 1444 place count 160 transition count 358
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 1457 place count 160 transition count 345
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 1459 place count 159 transition count 344
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1463 place count 155 transition count 339
Iterating global reduction 11 with 4 rules applied. Total rules applied 1467 place count 155 transition count 339
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 11 with 22 rules applied. Total rules applied 1489 place count 144 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1501 place count 144 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1503 place count 143 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1505 place count 143 transition count 311
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 1539 place count 126 transition count 345
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1556 place count 126 transition count 328
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1565 place count 117 transition count 310
Iterating global reduction 14 with 9 rules applied. Total rules applied 1574 place count 117 transition count 310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1579 place count 117 transition count 305
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 15 with 37 rules applied. Total rules applied 1616 place count 117 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1617 place count 116 transition count 267
Applied a total of 1617 rules in 79 ms. Remains 116 /1506 variables (removed 1390) and now considering 267/1928 (removed 1661) transitions.
[2024-05-21 15:55:02] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-05-21 15:55:02] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:55:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 15:55:02] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 15:55:02] [INFO ] Invariant cache hit.
[2024-05-21 15:55:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:55:02] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 164 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1506 places, 267/1928 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 112 transition count 265
Applied a total of 4 rules in 6 ms. Remains 112 /114 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 15:55:02] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 112 cols
[2024-05-21 15:55:02] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:55:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 15:55:02] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 15:55:02] [INFO ] Invariant cache hit.
[2024-05-21 15:55:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:55:02] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1506 places, 265/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 112/1506 places, 265/1928 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, (NOT p0), (NOT p0)]
Finished random walk after 105 steps, including 13 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[p0, (NOT p0), (NOT p0)]
[2024-05-21 15:55:02] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 15:55:02] [INFO ] Invariant cache hit.
[2024-05-21 15:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:55:02] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 15:55:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:55:03] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 15:55:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:55:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2024-05-21 15:55:03] [INFO ] Computed and/alt/rep : 153/249/153 causal constraints (skipped 50 transitions) in 14 ms.
[2024-05-21 15:55:03] [INFO ] Added : 3 causal constraints over 1 iterations in 37 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 119 ms :[p0, (NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-10 finished in 25425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1530 transition count 1960
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1530 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1530 transition count 1958
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 1521 transition count 1949
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 1521 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 1521 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 1517 transition count 1943
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 1517 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 1513 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 1509 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 1507 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 1507 transition count 1929
Applied a total of 79 rules in 429 ms. Remains 1507 /1544 variables (removed 37) and now considering 1929/1974 (removed 45) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 15:55:03] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 15:55:03] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 15:55:03] [INFO ] Invariant cache hit.
[2024-05-21 15:55:04] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2024-05-21 15:55:04] [INFO ] Invariant cache hit.
[2024-05-21 15:55:05] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1544 places, 1929/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2289 ms. Remains : 1507/1544 places, 1929/1974 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s1095 0) (NEQ s867 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-12 finished in 2448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1531 transition count 1961
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1531 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1531 transition count 1960
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 1522 transition count 1951
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 1522 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1522 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 1518 transition count 1945
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 1518 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 1516 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 1514 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 1512 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 1510 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1509 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 1508 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 1508 transition count 1931
Applied a total of 76 rules in 415 ms. Remains 1508 /1544 variables (removed 36) and now considering 1931/1974 (removed 43) transitions.
// Phase 1: matrix 1931 rows 1508 cols
[2024-05-21 15:55:06] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 15:55:06] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 15:55:06] [INFO ] Invariant cache hit.
[2024-05-21 15:55:07] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2024-05-21 15:55:07] [INFO ] Invariant cache hit.
[2024-05-21 15:55:08] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1544 places, 1931/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2344 ms. Remains : 1508/1544 places, 1931/1974 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s222 0) (EQ s1270 1)), p1:(OR (EQ s270 0) (EQ s1314 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 995 reset in 161 ms.
Product exploration explored 100000 steps with 1028 reset in 173 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 316723 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316723 steps, saw 86736 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 15:55:12] [INFO ] Invariant cache hit.
[2024-05-21 15:55:12] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:55:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:55:13] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 15:55:14] [INFO ] After 1483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-21 15:55:14] [INFO ] After 2054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 112 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=37 )
Parikh walk visited 4 properties in 10 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 193 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1931/1931 transitions.
Applied a total of 0 rules in 38 ms. Remains 1508 /1508 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 15:55:14] [INFO ] Invariant cache hit.
[2024-05-21 15:55:15] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 15:55:15] [INFO ] Invariant cache hit.
[2024-05-21 15:55:15] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2024-05-21 15:55:15] [INFO ] Invariant cache hit.
[2024-05-21 15:55:16] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1898 ms. Remains : 1508/1508 places, 1931/1931 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 328892 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328892 steps, saw 89335 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 15:55:20] [INFO ] Invariant cache hit.
[2024-05-21 15:55:20] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:55:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 15:55:21] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 15:55:22] [INFO ] After 1420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 246 ms.
[2024-05-21 15:55:22] [INFO ] After 1967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 112 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 4 properties in 12 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1017 reset in 143 ms.
Product exploration explored 100000 steps with 1017 reset in 150 ms.
Built C files in :
/tmp/ltsmin11547475630598910394
[2024-05-21 15:55:23] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11547475630598910394
Running compilation step : cd /tmp/ltsmin11547475630598910394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11547475630598910394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11547475630598910394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1931/1931 transitions.
Applied a total of 0 rules in 42 ms. Remains 1508 /1508 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 15:55:26] [INFO ] Invariant cache hit.
[2024-05-21 15:55:26] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 15:55:26] [INFO ] Invariant cache hit.
[2024-05-21 15:55:27] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2024-05-21 15:55:27] [INFO ] Invariant cache hit.
[2024-05-21 15:55:28] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1829 ms. Remains : 1508/1508 places, 1931/1931 transitions.
Built C files in :
/tmp/ltsmin7000552373929240444
[2024-05-21 15:55:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7000552373929240444
Running compilation step : cd /tmp/ltsmin7000552373929240444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000552373929240444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000552373929240444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 15:55:31] [INFO ] Flatten gal took : 33 ms
[2024-05-21 15:55:31] [INFO ] Flatten gal took : 33 ms
[2024-05-21 15:55:31] [INFO ] Time to serialize gal into /tmp/LTL251385740780196330.gal : 10 ms
[2024-05-21 15:55:31] [INFO ] Time to serialize properties into /tmp/LTL9953050508087356723.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL251385740780196330.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5428319793677303858.hoa' '-atoms' '/tmp/LTL9953050508087356723.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9953050508087356723.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5428319793677303858.hoa
Detected timeout of ITS tools.
[2024-05-21 15:55:46] [INFO ] Flatten gal took : 42 ms
[2024-05-21 15:55:46] [INFO ] Flatten gal took : 33 ms
[2024-05-21 15:55:46] [INFO ] Time to serialize gal into /tmp/LTL16682308450598649165.gal : 6 ms
[2024-05-21 15:55:46] [INFO ] Time to serialize properties into /tmp/LTL5698251545730569944.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16682308450598649165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5698251545730569944.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((p470==0)||(p2151==1))")||(X("((p548==0)||(p2216==1))")))))
Formula 0 simplified : F(!"((p470==0)||(p2151==1))" & X!"((p548==0)||(p2216==1))")
Detected timeout of ITS tools.
[2024-05-21 15:56:01] [INFO ] Flatten gal took : 33 ms
[2024-05-21 15:56:01] [INFO ] Applying decomposition
[2024-05-21 15:56:01] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2770736422937844147.txt' '-o' '/tmp/graph2770736422937844147.bin' '-w' '/tmp/graph2770736422937844147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2770736422937844147.bin' '-l' '-1' '-v' '-w' '/tmp/graph2770736422937844147.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:56:01] [INFO ] Decomposing Gal with order
[2024-05-21 15:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:56:01] [INFO ] Removed a total of 511 redundant transitions.
[2024-05-21 15:56:02] [INFO ] Flatten gal took : 78 ms
[2024-05-21 15:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 23 ms.
[2024-05-21 15:56:02] [INFO ] Time to serialize gal into /tmp/LTL2474168857898425916.gal : 18 ms
[2024-05-21 15:56:02] [INFO ] Time to serialize properties into /tmp/LTL10438847386904065602.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2474168857898425916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10438847386904065602.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.i1.i0.u82.p470==0)||(i31.i0.i2.u516.p2151==1))")||(X("((i5.i1.i1.u101.p548==0)||(i36.i0.i2.u537.p2216==1))")))))
Formula 0 simplified : F(!"((i5.i1.i0.u82.p470==0)||(i31.i0.i2.u516.p2151==1))" & X!"((i5.i1.i1.u101.p548==0)||(i36.i0.i2.u537.p2216==1))")
Reverse transition relation is NOT exact ! Due to transitions t26, t185, t214, t268, t299, t377, t450, t695, t747, t778, t856, t1171, t1223, t1254, t1332, ...2083
Computing Next relation with stutter on 62480 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10654933548699725538
[2024-05-21 15:56:17] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10654933548699725538
Running compilation step : cd /tmp/ltsmin10654933548699725538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10654933548699725538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10654933548699725538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-14 finished in 74475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(X(X(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-311-LTLCardinality-14
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1878 edges and 1544 vertex of which 685 / 1544 are part of one of the 61 SCC in 3 ms
Free SCC test removed 624 places
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Graph (complete) has 1421 edges and 920 vertex of which 911 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 910 transition count 744
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 527 rules applied. Total rules applied 1029 place count 410 transition count 717
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1043 place count 397 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1044 place count 396 transition count 716
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1044 place count 396 transition count 667
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1142 place count 347 transition count 667
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1157 place count 332 transition count 643
Iterating global reduction 4 with 15 rules applied. Total rules applied 1172 place count 332 transition count 643
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 1173 place count 332 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1174 place count 331 transition count 642
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1184 place count 321 transition count 628
Iterating global reduction 6 with 10 rules applied. Total rules applied 1194 place count 321 transition count 628
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1200 place count 321 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 319 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 319 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 317 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 317 transition count 614
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1209 place count 316 transition count 612
Iterating global reduction 7 with 1 rules applied. Total rules applied 1210 place count 316 transition count 612
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1211 place count 315 transition count 610
Iterating global reduction 7 with 1 rules applied. Total rules applied 1212 place count 315 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1213 place count 314 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 1214 place count 314 transition count 608
Performed 147 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1508 place count 167 transition count 378
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1521 place count 167 transition count 365
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1527 place count 161 transition count 356
Iterating global reduction 8 with 6 rules applied. Total rules applied 1533 place count 161 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1534 place count 161 transition count 355
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1535 place count 160 transition count 350
Iterating global reduction 9 with 1 rules applied. Total rules applied 1536 place count 160 transition count 350
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1562 place count 147 transition count 335
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1575 place count 147 transition count 322
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1576 place count 146 transition count 320
Iterating global reduction 10 with 1 rules applied. Total rules applied 1577 place count 146 transition count 320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1611 place count 129 transition count 360
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1634 place count 129 transition count 337
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1643 place count 120 transition count 319
Iterating global reduction 11 with 9 rules applied. Total rules applied 1652 place count 120 transition count 319
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1658 place count 120 transition count 313
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1659 place count 120 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1660 place count 120 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1661 place count 119 transition count 311
Applied a total of 1661 rules in 76 ms. Remains 119 /1544 variables (removed 1425) and now considering 311/1974 (removed 1663) transitions.
[2024-05-21 15:56:23] [INFO ] Flow matrix only has 256 transitions (discarded 55 similar events)
// Phase 1: matrix 256 rows 119 cols
[2024-05-21 15:56:23] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 15:56:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:56:23] [INFO ] Flow matrix only has 256 transitions (discarded 55 similar events)
[2024-05-21 15:56:23] [INFO ] Invariant cache hit.
[2024-05-21 15:56:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:56:23] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [13, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 157 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/1544 places, 311/1974 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 309
Applied a total of 4 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 309/311 (removed 2) transitions.
[2024-05-21 15:56:23] [INFO ] Flow matrix only has 254 transitions (discarded 55 similar events)
// Phase 1: matrix 254 rows 115 cols
[2024-05-21 15:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:56:23] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 15:56:23] [INFO ] Flow matrix only has 254 transitions (discarded 55 similar events)
[2024-05-21 15:56:23] [INFO ] Invariant cache hit.
[2024-05-21 15:56:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:56:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 115/1544 places, 309/1974 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 386 ms. Remains : 115/1544 places, 309/1974 transitions.
Running random walk in product with property : CloudReconfiguration-PT-311-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s97 1)), p1:(OR (EQ s11 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12448 reset in 118 ms.
Product exploration explored 100000 steps with 12670 reset in 121 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 p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 4613 steps, including 699 resets, run visited all 4 properties in 60 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 309/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-05-21 15:56:24] [INFO ] Flow matrix only has 254 transitions (discarded 55 similar events)
[2024-05-21 15:56:24] [INFO ] Invariant cache hit.
[2024-05-21 15:56:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 15:56:24] [INFO ] Flow matrix only has 254 transitions (discarded 55 similar events)
[2024-05-21 15:56:24] [INFO ] Invariant cache hit.
[2024-05-21 15:56:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:56:24] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 15:56:24] [INFO ] Flow matrix only has 254 transitions (discarded 55 similar events)
[2024-05-21 15:56:24] [INFO ] Invariant cache hit.
[2024-05-21 15:56:24] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 115/115 places, 309/309 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 95 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1416 steps, including 198 resets, run visited all 4 properties in 25 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 12524 reset in 127 ms.
Product exploration explored 100000 steps with 12588 reset in 124 ms.
Built C files in :
/tmp/ltsmin6833933779218149538
[2024-05-21 15:56:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6833933779218149538
Running compilation step : cd /tmp/ltsmin6833933779218149538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin6833933779218149538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6833933779218149538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17057967820826001556.hoa' '--buchi-type=spotba'
LTSmin run took 5032 ms.
Treatment of property CloudReconfiguration-PT-311-LTLCardinality-14 finished in 8275 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7389460501638737168
[2024-05-21 15:56:31] [INFO ] Too many transitions (1974) to apply POR reductions. Disabling POR matrices.
[2024-05-21 15:56:31] [INFO ] Applying decomposition
[2024-05-21 15:56:31] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7389460501638737168
Running compilation step : cd /tmp/ltsmin7389460501638737168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4112167746814021854.txt' '-o' '/tmp/graph4112167746814021854.bin' '-w' '/tmp/graph4112167746814021854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4112167746814021854.bin' '-l' '-1' '-v' '-w' '/tmp/graph4112167746814021854.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:56:31] [INFO ] Decomposing Gal with order
[2024-05-21 15:56:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:56:31] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 59 ms
[2024-05-21 15:56:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 16 ms.
[2024-05-21 15:56:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality711381140615772758.gal : 14 ms
[2024-05-21 15:56:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality12392035218488986158.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality711381140615772758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12392035218488986158.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F((G("(((i27.u426.p1721==1)||(i16.i1.i1.u224.p954==0))||(i5.u80.p451==1))"))||(G(("(i27.u426.p1721==0)")||(X(X(X("(i27.u426.p1721==...167
Formula 0 simplified : G(F!"(((i27.u426.p1721==1)||(i16.i1.i1.u224.p954==0))||(i5.u80.p451==1))" & F(!"(i27.u426.p1721==0)" & XXX!"(i27.u426.p1721==1)"))
Compilation finished in 3631 ms.
Running link step : cd /tmp/ltsmin7389460501638737168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Reverse transition relation is NOT exact ! Due to transitions t26, t214, t268, t299, t377, t450, t502, t695, t747, t778, t856, t1171, t1223, t1254, t1283, ...2194
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7389460501638737168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](((LTLAPp1==true)||X(X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
Computing Next relation with stutter on 62480 deadlock states
169 unique states visited
39 strongly connected components in search stack
175 transitions explored
169 items max in DFS search stack
3301 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.1911,705352,1,0,1.42492e+06,13388,22713,4.24266e+06,651,84509,1793939
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("((i6.i0.i0.u86.p470==0)||(i32.i1.i1.u528.p2151==1))")||(X("((i6.i0.i2.u104.p548==0)||(i36.i0.i2.u557.p2216==1))")))))
Formula 1 simplified : F(!"((i6.i0.i0.u86.p470==0)||(i32.i1.i1.u528.p2151==1))" & X!"((i6.i0.i2.u104.p548==0)||(i36.i0.i2.u557.p2216==1))")
Computing Next relation with stutter on 62480 deadlock states
102 unique states visited
0 strongly connected components in search stack
204 transitions explored
102 items max in DFS search stack
2291 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,56.0968,1342036,1,0,2.8191e+06,14167,22845,7.64437e+06,653,92750,2957775
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-311-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 374253 ms.

BK_STOP 1716307139519

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-311"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudReconfiguration-PT-311, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624207900122"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;