Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K Apr 29 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 29 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 14:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 14:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 661K May 10 09:33 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-319-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-319-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652691960353

Running Version 202205111006
[2022-05-16 09:06:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:06:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:06:03] [INFO ] Load time of PNML (sax parser for PT used): 486 ms
[2022-05-16 09:06:03] [INFO ] Transformed 2587 places.
[2022-05-16 09:06:03] [INFO ] Transformed 3099 transitions.
[2022-05-16 09:06:03] [INFO ] Found NUPN structural information;
[2022-05-16 09:06:03] [INFO ] Parsed PT model containing 2587 places and 3099 transitions in 747 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CloudReconfiguration-PT-319-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2071 transition count 2583
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2071 transition count 2583
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 2071 transition count 2556
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1296 place count 1834 transition count 2319
Iterating global reduction 1 with 237 rules applied. Total rules applied 1533 place count 1834 transition count 2319
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 1620 place count 1747 transition count 2232
Iterating global reduction 1 with 87 rules applied. Total rules applied 1707 place count 1747 transition count 2232
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1724 place count 1747 transition count 2215
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1770 place count 1701 transition count 2169
Iterating global reduction 2 with 46 rules applied. Total rules applied 1816 place count 1701 transition count 2169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1824 place count 1701 transition count 2161
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1861 place count 1664 transition count 2119
Iterating global reduction 3 with 37 rules applied. Total rules applied 1898 place count 1664 transition count 2119
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1924 place count 1638 transition count 2093
Iterating global reduction 3 with 26 rules applied. Total rules applied 1950 place count 1638 transition count 2093
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1974 place count 1614 transition count 2069
Iterating global reduction 3 with 24 rules applied. Total rules applied 1998 place count 1614 transition count 2069
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2022 place count 1590 transition count 2045
Iterating global reduction 3 with 24 rules applied. Total rules applied 2046 place count 1590 transition count 2045
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2067 place count 1569 transition count 2011
Iterating global reduction 3 with 21 rules applied. Total rules applied 2088 place count 1569 transition count 2011
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2094 place count 1563 transition count 2002
Iterating global reduction 3 with 6 rules applied. Total rules applied 2100 place count 1563 transition count 2002
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2105 place count 1558 transition count 1995
Iterating global reduction 3 with 5 rules applied. Total rules applied 2110 place count 1558 transition count 1995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2111 place count 1558 transition count 1994
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2113 place count 1556 transition count 1992
Iterating global reduction 4 with 2 rules applied. Total rules applied 2115 place count 1556 transition count 1992
Applied a total of 2115 rules in 2543 ms. Remains 1556 /2587 variables (removed 1031) and now considering 1992/3099 (removed 1107) transitions.
// Phase 1: matrix 1992 rows 1556 cols
[2022-05-16 09:06:06] [INFO ] Computed 4 place invariants in 86 ms
[2022-05-16 09:06:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:06:07] [INFO ] Implicit Places using invariants in 1146 ms returned []
// Phase 1: matrix 1992 rows 1556 cols
[2022-05-16 09:06:07] [INFO ] Computed 4 place invariants in 22 ms
[2022-05-16 09:06:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:06:08] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
// Phase 1: matrix 1992 rows 1556 cols
[2022-05-16 09:06:08] [INFO ] Computed 4 place invariants in 17 ms
[2022-05-16 09:06:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:06:10] [INFO ] Dead Transitions using invariants and state equation in 2102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1556/2587 places, 1992/3099 transitions.
Finished structural reductions, in 1 iterations. Remains : 1556/2587 places, 1992/3099 transitions.
Support contains 28 out of 1556 places after structural reductions.
[2022-05-16 09:06:11] [INFO ] Flatten gal took : 337 ms
[2022-05-16 09:06:11] [INFO ] Flatten gal took : 182 ms
[2022-05-16 09:06:12] [INFO ] Input system was already deterministic with 1992 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 96804 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96804 steps, saw 29412 distinct states, run finished after 3013 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 1992 rows 1556 cols
[2022-05-16 09:06:16] [INFO ] Computed 4 place invariants in 11 ms
[2022-05-16 09:06:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2022-05-16 09:06:19] [INFO ] After 1741ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:21
[2022-05-16 09:06:20] [INFO ] After 2056ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-16 09:06:20] [INFO ] After 3384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-16 09:06:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2022-05-16 09:06:26] [INFO ] After 4576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-16 09:06:31] [INFO ] After 9202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 2904 ms.
[2022-05-16 09:06:34] [INFO ] After 14034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 17 properties in 415 ms.
Support contains 8 out of 1556 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Graph (trivial) has 1878 edges and 1556 vertex of which 680 / 1556 are part of one of the 63 SCC in 27 ms
Free SCC test removed 617 places
Drop transitions removed 779 transitions
Reduce isomorphic transitions removed 779 transitions.
Graph (complete) has 1396 edges and 939 vertex of which 930 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 518 transitions
Trivial Post-agglo rules discarded 518 transitions
Performed 518 trivial Post agglomeration. Transition count delta: 518
Iterating post reduction 0 with 524 rules applied. Total rules applied 526 place count 930 transition count 685
Reduce places removed 518 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 578 rules applied. Total rules applied 1104 place count 412 transition count 625
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 43 rules applied. Total rules applied 1147 place count 373 transition count 621
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1151 place count 369 transition count 621
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1151 place count 369 transition count 573
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1247 place count 321 transition count 573
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1256 place count 312 transition count 561
Iterating global reduction 4 with 9 rules applied. Total rules applied 1265 place count 312 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 1271 place count 312 transition count 555
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1275 place count 308 transition count 555
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1282 place count 301 transition count 545
Iterating global reduction 6 with 7 rules applied. Total rules applied 1289 place count 301 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1293 place count 301 transition count 541
Performed 153 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 7 with 306 rules applied. Total rules applied 1599 place count 148 transition count 292
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1622 place count 148 transition count 269
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1628 place count 142 transition count 262
Iterating global reduction 8 with 6 rules applied. Total rules applied 1634 place count 142 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1635 place count 142 transition count 261
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1637 place count 140 transition count 259
Iterating global reduction 9 with 2 rules applied. Total rules applied 1639 place count 140 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1641 place count 140 transition count 257
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 10 with 24 rules applied. Total rules applied 1665 place count 128 transition count 243
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1679 place count 128 transition count 229
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 11 with 4 rules applied. Total rules applied 1683 place count 126 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1685 place count 126 transition count 225
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 12 with 68 rules applied. Total rules applied 1753 place count 92 transition count 270
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 12 with 28 rules applied. Total rules applied 1781 place count 92 transition count 242
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1802 place count 71 transition count 200
Iterating global reduction 13 with 21 rules applied. Total rules applied 1823 place count 71 transition count 200
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1835 place count 71 transition count 188
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 1840 place count 66 transition count 178
Iterating global reduction 14 with 5 rules applied. Total rules applied 1845 place count 66 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1850 place count 66 transition count 173
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1854 place count 66 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1856 place count 65 transition count 168
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1857 place count 65 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1858 place count 64 transition count 167
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1859 place count 64 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1862 place count 64 transition count 166
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1863 place count 64 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1864 place count 63 transition count 165
Applied a total of 1864 rules in 336 ms. Remains 63 /1556 variables (removed 1493) and now considering 165/1992 (removed 1827) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/1556 places, 165/1992 transitions.
Incomplete random walk after 10000 steps, including 1513 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 6) seen :5
Finished Best-First random walk after 7172 steps, including 255 resets, run visited all 1 properties in 22 ms. (steps per millisecond=326 )
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2178 edges and 1556 vertex of which 1547 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.50 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 2 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1545 transition count 1981
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1545 transition count 1981
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1545 transition count 1979
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 1539 transition count 1973
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 1539 transition count 1973
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 1534 transition count 1968
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 1534 transition count 1968
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 1534 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 1530 transition count 1963
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 1530 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 1530 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 1527 transition count 1959
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 1527 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 1524 transition count 1956
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 1524 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 1521 transition count 1953
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 1521 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 1518 transition count 1947
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 1515 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 1515 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 1512 transition count 1938
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 1512 transition count 1938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 1512 transition count 1936
Applied a total of 94 rules in 1523 ms. Remains 1512 /1556 variables (removed 44) and now considering 1936/1992 (removed 56) transitions.
// Phase 1: matrix 1936 rows 1512 cols
[2022-05-16 09:06:37] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 09:06:37] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 1936 rows 1512 cols
[2022-05-16 09:06:37] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:06:38] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
// Phase 1: matrix 1936 rows 1512 cols
[2022-05-16 09:06:38] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 09:06:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:06:40] [INFO ] Dead Transitions using invariants and state equation in 2312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1556 places, 1936/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1512/1556 places, 1936/1992 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} 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=[p1:(EQ s1316 1), p0:(EQ s695 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 17 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-00 finished in 5508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(X(p0)) U p1))||F(p2))))'
Support contains 4 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1546 transition count 1982
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1546 transition count 1982
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 1546 transition count 1980
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 1541 transition count 1975
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 1541 transition count 1975
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 1538 transition count 1972
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 1538 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 1538 transition count 1971
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 1536 transition count 1969
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 1536 transition count 1969
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 1536 transition count 1968
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 1535 transition count 1967
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 1535 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 1534 transition count 1966
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 1534 transition count 1966
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 1533 transition count 1965
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 1533 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 1532 transition count 1963
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 1532 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 1531 transition count 1961
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 1531 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 1530 transition count 1960
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1530 transition count 1960
Applied a total of 56 rules in 1529 ms. Remains 1530 /1556 variables (removed 26) and now considering 1960/1992 (removed 32) transitions.
// Phase 1: matrix 1960 rows 1530 cols
[2022-05-16 09:06:42] [INFO ] Computed 4 place invariants in 16 ms
[2022-05-16 09:06:43] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 1960 rows 1530 cols
[2022-05-16 09:06:43] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 09:06:44] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
// Phase 1: matrix 1960 rows 1530 cols
[2022-05-16 09:06:44] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 09:06:45] [INFO ] Dead Transitions using invariants and state equation in 1976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1530/1556 places, 1960/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1530/1556 places, 1960/1992 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s279 1) (EQ s597 1)), p1:(EQ s1112 1), p0:(AND (EQ s279 1) (EQ s1411 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-02 finished in 5078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(F(X(p0)) U p1))||G((G(p2)||p2))))'
Support contains 3 out of 1556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Graph (trivial) has 1891 edges and 1556 vertex of which 696 / 1556 are part of one of the 63 SCC in 8 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1438 edges and 923 vertex of which 914 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 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 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 503 place count 913 transition count 749
Reduce places removed 501 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 525 rules applied. Total rules applied 1028 place count 412 transition count 725
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 1042 place count 400 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1044 place count 398 transition count 723
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1044 place count 398 transition count 677
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1136 place count 352 transition count 677
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1153 place count 335 transition count 650
Iterating global reduction 4 with 17 rules applied. Total rules applied 1170 place count 335 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 1176 place count 335 transition count 644
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1180 place count 331 transition count 644
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1191 place count 320 transition count 626
Iterating global reduction 6 with 11 rules applied. Total rules applied 1202 place count 320 transition count 626
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1206 place count 320 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1208 place count 318 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1210 place count 318 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1212 place count 316 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1214 place count 316 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1216 place count 314 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1218 place count 314 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1220 place count 312 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1222 place count 312 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1224 place count 310 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1226 place count 310 transition count 602
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1227 place count 309 transition count 595
Iterating global reduction 7 with 1 rules applied. Total rules applied 1228 place count 309 transition count 595
Performed 139 Post agglomeration using F-continuation condition with reduction of 76 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 7 with 278 rules applied. Total rules applied 1506 place count 170 transition count 380
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1517 place count 170 transition count 369
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1525 place count 162 transition count 355
Iterating global reduction 8 with 8 rules applied. Total rules applied 1533 place count 162 transition count 355
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 162 transition count 354
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1536 place count 160 transition count 352
Iterating global reduction 9 with 2 rules applied. Total rules applied 1538 place count 160 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1540 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 10 with 26 rules applied. Total rules applied 1566 place count 147 transition count 335
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1581 place count 147 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1583 place count 146 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1585 place count 146 transition count 317
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1619 place count 129 transition count 363
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1636 place count 129 transition count 346
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1645 place count 120 transition count 328
Iterating global reduction 13 with 9 rules applied. Total rules applied 1654 place count 120 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1658 place count 120 transition count 324
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 14 with 38 rules applied. Total rules applied 1696 place count 120 transition count 286
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1699 place count 120 transition count 286
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1700 place count 120 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1701 place count 119 transition count 284
Applied a total of 1701 rules in 294 ms. Remains 119 /1556 variables (removed 1437) and now considering 284/1992 (removed 1708) transitions.
[2022-05-16 09:06:46] [INFO ] Flow matrix only has 225 transitions (discarded 59 similar events)
// Phase 1: matrix 225 rows 119 cols
[2022-05-16 09:06:46] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 09:06:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-16 09:06:46] [INFO ] Flow matrix only has 225 transitions (discarded 59 similar events)
// Phase 1: matrix 225 rows 119 cols
[2022-05-16 09:06:46] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 09:06:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:06:46] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 325 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1556 places, 284/1992 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 283
Applied a total of 2 rules in 14 ms. Remains 117 /118 variables (removed 1) and now considering 283/284 (removed 1) transitions.
[2022-05-16 09:06:46] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:06:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-16 09:06:47] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:47] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 09:06:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:06:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1556 places, 283/1992 transitions.
Finished structural reductions, in 2 iterations. Remains : 117/1556 places, 283/1992 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND p1 (NOT p2)), p1, (AND p1 p0), (AND (NOT p2) p1 p0), (AND p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s72 0), p1:(EQ s75 1), p0:(EQ s60 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 16203 reset in 546 ms.
Product exploration explored 100000 steps with 16010 reset in 570 ms.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1140 ms. Reduced automaton from 6 states, 26 edges and 3 AP to 5 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(AND p1 (NOT p2)), p1, (AND p1 p0), (AND (NOT p2) p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 1866 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-16 09:06:51] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:51] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:06:51] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-05-16 09:06:51] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-05-16 09:06:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:06:51] [INFO ] After 23ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2022-05-16 09:06:51] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-16 09:06:51] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 283/283 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 117 transition count 220
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 108 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 108 transition count 219
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 74 place count 107 transition count 219
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 120 place count 84 transition count 196
Drop transitions removed 6 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 137 place count 84 transition count 179
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 149 place count 72 transition count 167
Iterating global reduction 3 with 12 rules applied. Total rules applied 161 place count 72 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 167 place count 72 transition count 161
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 185 place count 63 transition count 152
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 194 place count 63 transition count 143
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 200 place count 57 transition count 137
Iterating global reduction 5 with 6 rules applied. Total rules applied 206 place count 57 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 212 place count 57 transition count 131
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 226 place count 50 transition count 133
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 236 place count 50 transition count 123
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 241 place count 45 transition count 118
Iterating global reduction 7 with 5 rules applied. Total rules applied 246 place count 45 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 251 place count 45 transition count 113
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 267 place count 45 transition count 97
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 270 place count 42 transition count 88
Iterating global reduction 8 with 3 rules applied. Total rules applied 273 place count 42 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 279 place count 42 transition count 82
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 282 place count 39 transition count 79
Iterating global reduction 9 with 3 rules applied. Total rules applied 285 place count 39 transition count 79
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 294 place count 39 transition count 70
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 296 place count 38 transition count 78
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 300 place count 38 transition count 74
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 31 edges and 33 vertex of which 21 / 33 are part of one of the 9 SCC in 1 ms
Free SCC test removed 12 places
Iterating post reduction 10 with 10 rules applied. Total rules applied 310 place count 21 transition count 70
Drop transitions removed 21 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 11 with 30 rules applied. Total rules applied 340 place count 21 transition count 40
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 343 place count 18 transition count 37
Iterating global reduction 12 with 3 rules applied. Total rules applied 346 place count 18 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 347 place count 18 transition count 36
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 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 353 place count 15 transition count 30
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 365 place count 15 transition count 18
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 367 place count 15 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 369 place count 13 transition count 16
Applied a total of 369 rules in 41 ms. Remains 13 /117 variables (removed 104) and now considering 16/283 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/117 places, 16/283 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p2) p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))]
Knowledge based reduction with 32 factoid took 1714 ms. Reduced automaton from 5 states, 19 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 283/283 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2022-05-16 09:06:53] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:06:53] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-16 09:06:53] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:06:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:06:54] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-05-16 09:06:54] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-16 09:06:54] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:54] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 09:06:54] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 283/283 transitions.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 508 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1886 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:06:55] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 117 cols
[2022-05-16 09:06:55] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 09:06:55] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:06:55] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:06:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:06:55] [INFO ] After 42ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:06:55] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-16 09:06:55] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 283/283 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 117 transition count 219
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 107 transition count 219
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 120 place count 84 transition count 196
Drop transitions removed 6 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 136 place count 84 transition count 180
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 148 place count 72 transition count 168
Iterating global reduction 3 with 12 rules applied. Total rules applied 160 place count 72 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 166 place count 72 transition count 162
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 184 place count 63 transition count 153
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 193 place count 63 transition count 144
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 199 place count 57 transition count 138
Iterating global reduction 5 with 6 rules applied. Total rules applied 205 place count 57 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 211 place count 57 transition count 132
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 225 place count 50 transition count 134
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 235 place count 50 transition count 124
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 240 place count 45 transition count 119
Iterating global reduction 7 with 5 rules applied. Total rules applied 245 place count 45 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 250 place count 45 transition count 114
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 266 place count 45 transition count 98
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 269 place count 42 transition count 89
Iterating global reduction 8 with 3 rules applied. Total rules applied 272 place count 42 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 278 place count 42 transition count 83
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 281 place count 39 transition count 80
Iterating global reduction 9 with 3 rules applied. Total rules applied 284 place count 39 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 293 place count 39 transition count 71
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 295 place count 38 transition count 79
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 299 place count 38 transition count 75
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 31 edges and 33 vertex of which 21 / 33 are part of one of the 9 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 10 with 10 rules applied. Total rules applied 309 place count 21 transition count 71
Drop transitions removed 21 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 11 with 31 rules applied. Total rules applied 340 place count 21 transition count 40
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 343 place count 18 transition count 37
Iterating global reduction 12 with 3 rules applied. Total rules applied 346 place count 18 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 347 place count 18 transition count 36
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 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 353 place count 15 transition count 30
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 365 place count 15 transition count 18
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 367 place count 15 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 369 place count 13 transition count 16
Applied a total of 369 rules in 33 ms. Remains 13 /117 variables (removed 104) and now considering 16/283 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/117 places, 16/283 transitions.
Finished random walk after 13 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 440 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p2) p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p2) p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 16019 reset in 277 ms.
Product exploration explored 100000 steps with 16229 reset in 361 ms.
Built C files in :
/tmp/ltsmin11776613828124295802
[2022-05-16 09:06:57] [INFO ] Computing symmetric may disable matrix : 283 transitions.
[2022-05-16 09:06:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:06:57] [INFO ] Computing symmetric may enable matrix : 283 transitions.
[2022-05-16 09:06:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:06:57] [INFO ] Computing Do-Not-Accords matrix : 283 transitions.
[2022-05-16 09:06:57] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:06:57] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11776613828124295802
Running compilation step : cd /tmp/ltsmin11776613828124295802;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin11776613828124295802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11776613828124295802;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12469187253905897128.hoa' '--buchi-type=spotba'
LTSmin run took 282 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-319-LTLFireability-03 finished in 12487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!F(p0))) U p1))'
Support contains 3 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1543 transition count 1979
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1543 transition count 1979
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 1543 transition count 1977
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 1535 transition count 1969
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 1535 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 1530 transition count 1964
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 1530 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 1530 transition count 1963
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 1526 transition count 1959
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 1526 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1526 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 1523 transition count 1955
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 1523 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 1520 transition count 1952
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 1520 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 1517 transition count 1949
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 1517 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 1514 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 1514 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 1511 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 1511 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 1508 transition count 1934
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 1508 transition count 1934
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 1508 transition count 1932
Applied a total of 102 rules in 1003 ms. Remains 1508 /1556 variables (removed 48) and now considering 1932/1992 (removed 60) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2022-05-16 09:06:59] [INFO ] Computed 4 place invariants in 21 ms
[2022-05-16 09:07:00] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 1932 rows 1508 cols
[2022-05-16 09:07:00] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 09:07:00] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
// Phase 1: matrix 1932 rows 1508 cols
[2022-05-16 09:07:00] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 09:07:03] [INFO ] Dead Transitions using invariants and state equation in 2193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1556 places, 1932/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1556 places, 1932/1992 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s1487 1), p1:(OR (EQ s1481 1) (EQ s868 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 4 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-05 finished in 4424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(X(p1)))&&X(F(X(p2)))))'
Support contains 3 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1544 transition count 1980
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1544 transition count 1980
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1544 transition count 1978
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 1537 transition count 1971
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 1537 transition count 1971
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 1533 transition count 1967
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 1533 transition count 1967
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 1533 transition count 1966
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 1530 transition count 1963
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 1530 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 1530 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 1528 transition count 1960
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1528 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1526 transition count 1958
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1526 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1524 transition count 1956
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1524 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1522 transition count 1952
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1522 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 1520 transition count 1948
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 1520 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 1518 transition count 1946
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 1518 transition count 1946
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 1518 transition count 1944
Applied a total of 82 rules in 1329 ms. Remains 1518 /1556 variables (removed 38) and now considering 1944/1992 (removed 48) transitions.
// Phase 1: matrix 1944 rows 1518 cols
[2022-05-16 09:07:04] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 09:07:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:07:05] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 1944 rows 1518 cols
[2022-05-16 09:07:05] [INFO ] Computed 4 place invariants in 19 ms
[2022-05-16 09:07:05] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
// Phase 1: matrix 1944 rows 1518 cols
[2022-05-16 09:07:05] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 09:07:07] [INFO ] Dead Transitions using invariants and state equation in 1557 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1518/1556 places, 1944/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1518/1556 places, 1944/1992 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) p1), p1, p1, (NOT p2), p1, true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s923 1), p1:(EQ s1387 1), p2:(EQ s1436 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-06 finished in 4506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((!X(p0)&&p1)) U X(p2)))))'
Support contains 3 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1544 transition count 1980
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1544 transition count 1980
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1544 transition count 1978
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 1536 transition count 1970
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 1536 transition count 1970
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 1531 transition count 1965
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 1531 transition count 1965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 1531 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 1527 transition count 1960
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 1527 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 1527 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 1524 transition count 1956
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 1524 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 1521 transition count 1953
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 1521 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 1518 transition count 1950
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 1518 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 1515 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 1515 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 1512 transition count 1938
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 1512 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 1509 transition count 1935
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 1509 transition count 1935
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 1509 transition count 1933
Applied a total of 100 rules in 1147 ms. Remains 1509 /1556 variables (removed 47) and now considering 1933/1992 (removed 59) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:08] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 09:07:09] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:09] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:07:09] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:09] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 09:07:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:07:12] [INFO ] Dead Transitions using invariants and state equation in 2313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1556 places, 1933/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1556 places, 1933/1992 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, false]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s1172 1), p2:(OR (NEQ s42 1) (EQ s673 1)), p0:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39814 reset in 1435 ms.
Product exploration explored 100000 steps with 39886 reset in 1329 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2116 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 877 ms. Reduced automaton from 6 states, 23 edges and 3 AP to 6 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 404 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 118 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 265189 steps, run timeout after 6001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 265189 steps, saw 78894 distinct states, run finished after 6001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:24] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:07:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2022-05-16 09:07:26] [INFO ] After 2090ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-16 09:07:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2022-05-16 09:07:29] [INFO ] After 2341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-16 09:07:31] [INFO ] After 4100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 996 ms.
[2022-05-16 09:07:32] [INFO ] After 5845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 92 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1835 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 1328 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 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 880 transition count 648
Reduce places removed 491 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 551 rules applied. Total rules applied 1051 place count 389 transition count 588
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1090 place count 350 transition count 588
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1090 place count 350 transition count 537
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1192 place count 299 transition count 537
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1201 place count 290 transition count 525
Iterating global reduction 3 with 9 rules applied. Total rules applied 1210 place count 290 transition count 525
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1212 place count 290 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1214 place count 288 transition count 523
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1221 place count 281 transition count 515
Iterating global reduction 5 with 7 rules applied. Total rules applied 1228 place count 281 transition count 515
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1234 place count 281 transition count 509
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1235 place count 280 transition count 503
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 280 transition count 503
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 6 with 296 rules applied. Total rules applied 1532 place count 132 transition count 257
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1550 place count 132 transition count 239
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1553 place count 129 transition count 236
Iterating global reduction 7 with 3 rules applied. Total rules applied 1556 place count 129 transition count 236
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 1580 place count 117 transition count 222
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1593 place count 117 transition count 209
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 8 with 2 rules applied. Total rules applied 1595 place count 116 transition count 208
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1597 place count 116 transition count 206
Performed 33 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1663 place count 83 transition count 237
Drop transitions removed 19 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 9 with 46 rules applied. Total rules applied 1709 place count 83 transition count 191
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 1733 place count 59 transition count 159
Iterating global reduction 10 with 24 rules applied. Total rules applied 1757 place count 59 transition count 159
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1771 place count 59 transition count 145
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1777 place count 53 transition count 133
Iterating global reduction 11 with 6 rules applied. Total rules applied 1783 place count 53 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1789 place count 53 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 1791 place count 52 transition count 142
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1794 place count 52 transition count 139
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 13 with 17 rules applied. Total rules applied 1811 place count 52 transition count 122
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1812 place count 51 transition count 119
Iterating global reduction 13 with 1 rules applied. Total rules applied 1813 place count 51 transition count 119
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1814 place count 50 transition count 118
Iterating global reduction 13 with 1 rules applied. Total rules applied 1815 place count 50 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1817 place count 50 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1818 place count 50 transition count 115
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1821 place count 50 transition count 112
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1825 place count 47 transition count 111
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 47 transition count 111
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 47 transition count 110
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1829 place count 46 transition count 109
Iterating global reduction 15 with 1 rules applied. Total rules applied 1830 place count 46 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1831 place count 45 transition count 108
Applied a total of 1831 rules in 99 ms. Remains 45 /1509 variables (removed 1464) and now considering 108/1933 (removed 1825) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/1509 places, 108/1933 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:07:33] [INFO ] Flow matrix only has 101 transitions (discarded 7 similar events)
// Phase 1: matrix 101 rows 45 cols
[2022-05-16 09:07:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:07:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 09:07:33] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:07:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 09:07:33] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:07:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 09:07:33] [INFO ] After 20ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:07:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-05-16 09:07:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-16 09:07:33] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2022-05-16 09:07:33] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 p1 (NOT p2))), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 17 factoid took 1116 ms. Reduced automaton from 6 states, 23 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p2 p1 p0)]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Applied a total of 0 rules in 106 ms. Remains 1509 /1509 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:35] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:07:35] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:35] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:07:36] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:36] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:07:38] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1509 places, 1933/1933 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2116 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1041 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p2 p1 p0)]
Incomplete random walk after 10000 steps, including 106 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 274563 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 274563 steps, saw 79459 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:07:47] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:07:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 20 ms returned sat
[2022-05-16 09:07:50] [INFO ] After 2276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-16 09:07:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 20 ms returned sat
[2022-05-16 09:07:53] [INFO ] After 2690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-16 09:07:55] [INFO ] After 4173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 816 ms.
[2022-05-16 09:07:56] [INFO ] After 6103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 112 ms.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1835 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 1328 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 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 880 transition count 648
Reduce places removed 491 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 551 rules applied. Total rules applied 1051 place count 389 transition count 588
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1090 place count 350 transition count 588
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1090 place count 350 transition count 537
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1192 place count 299 transition count 537
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1201 place count 290 transition count 525
Iterating global reduction 3 with 9 rules applied. Total rules applied 1210 place count 290 transition count 525
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1212 place count 290 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1214 place count 288 transition count 523
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1221 place count 281 transition count 515
Iterating global reduction 5 with 7 rules applied. Total rules applied 1228 place count 281 transition count 515
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1234 place count 281 transition count 509
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1235 place count 280 transition count 503
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 280 transition count 503
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 6 with 296 rules applied. Total rules applied 1532 place count 132 transition count 257
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1550 place count 132 transition count 239
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1553 place count 129 transition count 236
Iterating global reduction 7 with 3 rules applied. Total rules applied 1556 place count 129 transition count 236
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 1580 place count 117 transition count 222
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1593 place count 117 transition count 209
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 8 with 2 rules applied. Total rules applied 1595 place count 116 transition count 208
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1597 place count 116 transition count 206
Performed 33 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1663 place count 83 transition count 237
Drop transitions removed 19 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 9 with 46 rules applied. Total rules applied 1709 place count 83 transition count 191
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 1733 place count 59 transition count 159
Iterating global reduction 10 with 24 rules applied. Total rules applied 1757 place count 59 transition count 159
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1771 place count 59 transition count 145
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1777 place count 53 transition count 133
Iterating global reduction 11 with 6 rules applied. Total rules applied 1783 place count 53 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1789 place count 53 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 1791 place count 52 transition count 142
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1794 place count 52 transition count 139
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 13 with 17 rules applied. Total rules applied 1811 place count 52 transition count 122
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1812 place count 51 transition count 119
Iterating global reduction 13 with 1 rules applied. Total rules applied 1813 place count 51 transition count 119
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1814 place count 50 transition count 118
Iterating global reduction 13 with 1 rules applied. Total rules applied 1815 place count 50 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1817 place count 50 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1818 place count 50 transition count 115
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1821 place count 50 transition count 112
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1825 place count 47 transition count 111
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 47 transition count 111
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 47 transition count 110
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1829 place count 46 transition count 109
Iterating global reduction 15 with 1 rules applied. Total rules applied 1830 place count 46 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1831 place count 45 transition count 108
Applied a total of 1831 rules in 87 ms. Remains 45 /1509 variables (removed 1464) and now considering 108/1933 (removed 1825) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/1509 places, 108/1933 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 09:07:56] [INFO ] Flow matrix only has 101 transitions (discarded 7 similar events)
// Phase 1: matrix 101 rows 45 cols
[2022-05-16 09:07:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:07:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:07:56] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:07:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 09:07:56] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:07:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 09:07:56] [INFO ] After 31ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:07:56] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-05-16 09:07:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-16 09:07:56] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-16 09:07:56] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 18 factoid took 1225 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p2 p0)]
Product exploration explored 100000 steps with 39963 reset in 1623 ms.
Product exploration explored 100000 steps with 39920 reset in 1384 ms.
Built C files in :
/tmp/ltsmin12904101260734792818
[2022-05-16 09:08:02] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12904101260734792818
Running compilation step : cd /tmp/ltsmin12904101260734792818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12904101260734792818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12904101260734792818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Applied a total of 0 rules in 67 ms. Remains 1509 /1509 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:08:05] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:08:05] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:08:05] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:08:06] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:08:06] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 09:08:08] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1509 places, 1933/1933 transitions.
Built C files in :
/tmp/ltsmin3495214264481576643
[2022-05-16 09:08:08] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3495214264481576643
Running compilation step : cd /tmp/ltsmin3495214264481576643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3495214264481576643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3495214264481576643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 09:08:11] [INFO ] Flatten gal took : 80 ms
[2022-05-16 09:08:11] [INFO ] Flatten gal took : 67 ms
[2022-05-16 09:08:11] [INFO ] Time to serialize gal into /tmp/LTL3789071597400247978.gal : 25 ms
[2022-05-16 09:08:11] [INFO ] Time to serialize properties into /tmp/LTL11122796087482838604.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3789071597400247978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11122796087482838604.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3789071...267
Read 1 LTL properties
Checking formula 0 : !((F(G((F((!(X("(p93==1)")))&&("(p2009==1)")))U(X("((p93!=1)||(p1222==1))"))))))
Formula 0 simplified : !FG(F("(p2009==1)" & !X"(p93==1)") U X"((p93!=1)||(p1222==1))")
Detected timeout of ITS tools.
[2022-05-16 09:08:26] [INFO ] Flatten gal took : 60 ms
[2022-05-16 09:08:26] [INFO ] Applying decomposition
[2022-05-16 09:08:26] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4734986922723368668.txt' '-o' '/tmp/graph4734986922723368668.bin' '-w' '/tmp/graph4734986922723368668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4734986922723368668.bin' '-l' '-1' '-v' '-w' '/tmp/graph4734986922723368668.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:08:27] [INFO ] Decomposing Gal with order
[2022-05-16 09:08:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:08:27] [INFO ] Removed a total of 504 redundant transitions.
[2022-05-16 09:08:27] [INFO ] Flatten gal took : 306 ms
[2022-05-16 09:08:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 61 ms.
[2022-05-16 09:08:28] [INFO ] Time to serialize gal into /tmp/LTL13066107788612467216.gal : 30 ms
[2022-05-16 09:08:28] [INFO ] Time to serialize properties into /tmp/LTL14184528534861814938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13066107788612467216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14184528534861814938.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1306610...247
Read 1 LTL properties
Checking formula 0 : !((F(G((F((!(X("(i3.i0.i2.u17.p93==1)")))&&("(i28.i0.i1.u474.p2009==1)")))U(X("((i3.i0.i2.u17.p93!=1)||(i16.i0.i0.u260.p1222==1))"))))...157
Formula 0 simplified : !FG(F("(i28.i0.i1.u474.p2009==1)" & !X"(i3.i0.i2.u17.p93==1)") U X"((i3.i0.i2.u17.p93!=1)||(i16.i0.i0.u260.p1222==1))")
Reverse transition relation is NOT exact ! Due to transitions t26, t201, t284, t344, t393, t464, t673, t754, t816, t866, t990, t1184, t1236, t1267, t1345, ...2213
Computing Next relation with stutter on 89596 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12385749143490237132
[2022-05-16 09:08:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12385749143490237132
Running compilation step : cd /tmp/ltsmin12385749143490237132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12385749143490237132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12385749143490237132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CloudReconfiguration-PT-319-LTLFireability-10 finished in 98510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(X(F(X(p0))))||p1)))))'
Support contains 2 out of 1556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Graph (trivial) has 1894 edges and 1556 vertex of which 696 / 1556 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1438 edges and 923 vertex of which 914 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 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 913 transition count 747
Reduce places removed 503 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 527 rules applied. Total rules applied 1032 place count 410 transition count 723
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1045 place count 398 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1046 place count 397 transition count 722
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1046 place count 397 transition count 676
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1138 place count 351 transition count 676
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1156 place count 333 transition count 647
Iterating global reduction 4 with 18 rules applied. Total rules applied 1174 place count 333 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 7 rules applied. Total rules applied 1181 place count 333 transition count 640
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1186 place count 328 transition count 640
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1197 place count 317 transition count 622
Iterating global reduction 6 with 11 rules applied. Total rules applied 1208 place count 317 transition count 622
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1212 place count 317 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 315 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 315 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1218 place count 313 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 313 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1222 place count 311 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1224 place count 311 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1226 place count 309 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1228 place count 309 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1230 place count 307 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1232 place count 307 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1233 place count 306 transition count 591
Iterating global reduction 7 with 1 rules applied. Total rules applied 1234 place count 306 transition count 591
Performed 136 Post agglomeration using F-continuation condition with reduction of 68 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 7 with 272 rules applied. Total rules applied 1506 place count 170 transition count 387
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1522 place count 170 transition count 371
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1530 place count 162 transition count 357
Iterating global reduction 8 with 8 rules applied. Total rules applied 1538 place count 162 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1539 place count 162 transition count 356
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1541 place count 160 transition count 354
Iterating global reduction 9 with 2 rules applied. Total rules applied 1543 place count 160 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1545 place count 160 transition count 352
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1571 place count 147 transition count 336
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1584 place count 147 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1586 place count 146 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1588 place count 146 transition count 320
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 1624 place count 128 transition count 366
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 12 with 21 rules applied. Total rules applied 1645 place count 128 transition count 345
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1654 place count 119 transition count 327
Iterating global reduction 13 with 9 rules applied. Total rules applied 1663 place count 119 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1667 place count 119 transition count 323
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 14 with 38 rules applied. Total rules applied 1705 place count 119 transition count 285
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 1710 place count 119 transition count 285
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1712 place count 119 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1713 place count 118 transition count 282
Applied a total of 1713 rules in 166 ms. Remains 118 /1556 variables (removed 1438) and now considering 282/1992 (removed 1710) transitions.
[2022-05-16 09:08:46] [INFO ] Flow matrix only has 223 transitions (discarded 59 similar events)
// Phase 1: matrix 223 rows 118 cols
[2022-05-16 09:08:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:08:46] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-05-16 09:08:46] [INFO ] Flow matrix only has 223 transitions (discarded 59 similar events)
// Phase 1: matrix 223 rows 118 cols
[2022-05-16 09:08:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 09:08:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:08:46] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 440 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1556 places, 282/1992 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 281
Applied a total of 2 rules in 5 ms. Remains 116 /117 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2022-05-16 09:08:46] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
// Phase 1: matrix 222 rows 116 cols
[2022-05-16 09:08:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:08:46] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-16 09:08:46] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
// Phase 1: matrix 222 rows 116 cols
[2022-05-16 09:08:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:08:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 09:08:47] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1556 places, 281/1992 transitions.
Finished structural reductions, in 2 iterations. Remains : 116/1556 places, 281/1992 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s72 1), p0:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-11 finished in 1035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Graph (trivial) has 1894 edges and 1556 vertex of which 684 / 1556 are part of one of the 62 SCC in 2 ms
Free SCC test removed 622 places
Ensure Unique test removed 723 transitions
Reduce isomorphic transitions removed 723 transitions.
Graph (complete) has 1451 edges and 934 vertex of which 925 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 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 514 place count 924 transition count 751
Reduce places removed 512 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 536 rules applied. Total rules applied 1050 place count 412 transition count 727
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1063 place count 400 transition count 726
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1066 place count 399 transition count 724
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1069 place count 398 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1070 place count 397 transition count 722
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 47 Pre rules applied. Total rules applied 1070 place count 397 transition count 675
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 1164 place count 350 transition count 675
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1181 place count 333 transition count 648
Iterating global reduction 6 with 17 rules applied. Total rules applied 1198 place count 333 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 7 rules applied. Total rules applied 1205 place count 333 transition count 641
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1210 place count 328 transition count 641
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1220 place count 318 transition count 625
Iterating global reduction 8 with 10 rules applied. Total rules applied 1230 place count 318 transition count 625
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1234 place count 318 transition count 621
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1236 place count 316 transition count 617
Iterating global reduction 9 with 2 rules applied. Total rules applied 1238 place count 316 transition count 617
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1240 place count 314 transition count 613
Iterating global reduction 9 with 2 rules applied. Total rules applied 1242 place count 314 transition count 613
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1244 place count 312 transition count 609
Iterating global reduction 9 with 2 rules applied. Total rules applied 1246 place count 312 transition count 609
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1248 place count 310 transition count 605
Iterating global reduction 9 with 2 rules applied. Total rules applied 1250 place count 310 transition count 605
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1251 place count 309 transition count 603
Iterating global reduction 9 with 1 rules applied. Total rules applied 1252 place count 309 transition count 603
Performed 139 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 9 with 278 rules applied. Total rules applied 1530 place count 170 transition count 386
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1545 place count 170 transition count 371
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1553 place count 162 transition count 357
Iterating global reduction 10 with 8 rules applied. Total rules applied 1561 place count 162 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1562 place count 162 transition count 356
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1564 place count 160 transition count 354
Iterating global reduction 11 with 2 rules applied. Total rules applied 1566 place count 160 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1568 place count 160 transition count 352
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 12 with 28 rules applied. Total rules applied 1596 place count 146 transition count 335
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 1612 place count 146 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1614 place count 145 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1616 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 36 rules applied. Total rules applied 1652 place count 127 transition count 364
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 14 with 19 rules applied. Total rules applied 1671 place count 127 transition count 345
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1680 place count 118 transition count 327
Iterating global reduction 15 with 9 rules applied. Total rules applied 1689 place count 118 transition count 327
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1695 place count 118 transition count 321
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 16 with 37 rules applied. Total rules applied 1732 place count 118 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1733 place count 117 transition count 283
Applied a total of 1733 rules in 109 ms. Remains 117 /1556 variables (removed 1439) and now considering 283/1992 (removed 1709) transitions.
[2022-05-16 09:08:47] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
// Phase 1: matrix 225 rows 117 cols
[2022-05-16 09:08:47] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 09:08:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-16 09:08:47] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
// Phase 1: matrix 225 rows 117 cols
[2022-05-16 09:08:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:08:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 09:08:47] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 271 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1556 places, 283/1992 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 282
Applied a total of 2 rules in 5 ms. Remains 115 /116 variables (removed 1) and now considering 282/283 (removed 1) transitions.
[2022-05-16 09:08:47] [INFO ] Flow matrix only has 224 transitions (discarded 58 similar events)
// Phase 1: matrix 224 rows 115 cols
[2022-05-16 09:08:47] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 09:08:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-05-16 09:08:47] [INFO ] Flow matrix only has 224 transitions (discarded 58 similar events)
// Phase 1: matrix 224 rows 115 cols
[2022-05-16 09:08:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 09:08:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 09:08:47] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1556 places, 282/1992 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/1556 places, 282/1992 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3646 steps with 604 reset in 5 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-13 finished in 700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (X(!X(p1)) U p2)))'
Support contains 5 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1546 transition count 1982
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1546 transition count 1982
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 1546 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 1539 transition count 1973
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 1539 transition count 1973
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 1535 transition count 1969
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 1535 transition count 1969
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 1535 transition count 1968
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 1532 transition count 1965
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 1532 transition count 1965
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 1529 transition count 1962
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 1529 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 1526 transition count 1959
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 1526 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 1523 transition count 1956
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 1523 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 1520 transition count 1950
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 1520 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 1517 transition count 1944
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 1517 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 1514 transition count 1941
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 1514 transition count 1941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 1514 transition count 1939
Applied a total of 89 rules in 830 ms. Remains 1514 /1556 variables (removed 42) and now considering 1939/1992 (removed 53) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:08:48] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 09:08:49] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:08:49] [INFO ] Computed 4 place invariants in 19 ms
[2022-05-16 09:08:49] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:08:49] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 09:08:51] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1514/1556 places, 1939/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1514/1556 places, 1939/1992 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s283 1) (EQ s990 1)), p2:(EQ s555 1), p0:(AND (EQ s275 1) (EQ s823 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1172 reset in 234 ms.
Product exploration explored 100000 steps with 1220 reset in 256 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2123 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 523 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 142018 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142018 steps, saw 42659 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:08:56] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:08:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 21 ms returned sat
[2022-05-16 09:08:58] [INFO ] After 1785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 09:08:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19 ms returned sat
[2022-05-16 09:09:00] [INFO ] After 1701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 09:09:01] [INFO ] After 2365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 600 ms.
[2022-05-16 09:09:01] [INFO ] After 3556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 52 ms.
Support contains 3 out of 1514 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1839 edges and 1514 vertex of which 688 / 1514 are part of one of the 63 SCC in 1 ms
Free SCC test removed 625 places
Drop transitions removed 790 transitions
Reduce isomorphic transitions removed 790 transitions.
Graph (complete) has 1328 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 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 880 transition count 650
Reduce places removed 489 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 549 rules applied. Total rules applied 1046 place count 391 transition count 590
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 43 rules applied. Total rules applied 1089 place count 352 transition count 586
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1093 place count 348 transition count 586
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1093 place count 348 transition count 536
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 1193 place count 298 transition count 536
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1204 place count 287 transition count 520
Iterating global reduction 4 with 11 rules applied. Total rules applied 1215 place count 287 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 1218 place count 287 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1221 place count 284 transition count 517
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1229 place count 276 transition count 507
Iterating global reduction 6 with 8 rules applied. Total rules applied 1237 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1243 place count 276 transition count 501
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1244 place count 275 transition count 495
Iterating global reduction 7 with 1 rules applied. Total rules applied 1245 place count 275 transition count 495
Performed 143 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1531 place count 132 transition count 258
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1546 place count 132 transition count 243
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1550 place count 128 transition count 237
Iterating global reduction 8 with 4 rules applied. Total rules applied 1554 place count 128 transition count 237
Performed 14 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1582 place count 114 transition count 219
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1596 place count 114 transition count 205
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 1598 place count 113 transition count 204
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1664 place count 80 transition count 249
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1691 place count 80 transition count 222
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 1711 place count 60 transition count 182
Iterating global reduction 10 with 20 rules applied. Total rules applied 1731 place count 60 transition count 182
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1742 place count 60 transition count 171
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1748 place count 54 transition count 159
Iterating global reduction 11 with 6 rules applied. Total rules applied 1754 place count 54 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1760 place count 54 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1761 place count 54 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1762 place count 54 transition count 152
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1763 place count 54 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1764 place count 53 transition count 151
Applied a total of 1764 rules in 106 ms. Remains 53 /1514 variables (removed 1461) and now considering 151/1939 (removed 1788) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/1514 places, 151/1939 transitions.
Finished random walk after 3940 steps, including 683 resets, run visited all 3 properties in 50 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 866 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 3 out of 1514 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Applied a total of 0 rules in 87 ms. Remains 1514 /1514 variables (removed 0) and now considering 1939/1939 (removed 0) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:09:03] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 09:09:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:09:03] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:09:03] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 09:09:04] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:09:04] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:09:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 09:09:06] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1514/1514 places, 1939/1939 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2123 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 139572 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139572 steps, saw 40981 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1939 rows 1514 cols
[2022-05-16 09:09:10] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:09:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 22 ms returned sat
[2022-05-16 09:09:11] [INFO ] After 1807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 09:09:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2022-05-16 09:09:13] [INFO ] After 1566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 09:09:14] [INFO ] After 2186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 642 ms.
[2022-05-16 09:09:15] [INFO ] After 3214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 1514 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1839 edges and 1514 vertex of which 688 / 1514 are part of one of the 63 SCC in 2 ms
Free SCC test removed 625 places
Drop transitions removed 790 transitions
Reduce isomorphic transitions removed 790 transitions.
Graph (complete) has 1328 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 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 880 transition count 650
Reduce places removed 489 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 549 rules applied. Total rules applied 1046 place count 391 transition count 590
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 43 rules applied. Total rules applied 1089 place count 352 transition count 586
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1093 place count 348 transition count 586
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1093 place count 348 transition count 536
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 1193 place count 298 transition count 536
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1204 place count 287 transition count 520
Iterating global reduction 4 with 11 rules applied. Total rules applied 1215 place count 287 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 1218 place count 287 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1221 place count 284 transition count 517
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1229 place count 276 transition count 507
Iterating global reduction 6 with 8 rules applied. Total rules applied 1237 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1243 place count 276 transition count 501
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1244 place count 275 transition count 495
Iterating global reduction 7 with 1 rules applied. Total rules applied 1245 place count 275 transition count 495
Performed 143 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1531 place count 132 transition count 258
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1546 place count 132 transition count 243
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1550 place count 128 transition count 237
Iterating global reduction 8 with 4 rules applied. Total rules applied 1554 place count 128 transition count 237
Performed 14 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1582 place count 114 transition count 219
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1596 place count 114 transition count 205
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 1598 place count 113 transition count 204
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1664 place count 80 transition count 249
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1691 place count 80 transition count 222
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 1711 place count 60 transition count 182
Iterating global reduction 10 with 20 rules applied. Total rules applied 1731 place count 60 transition count 182
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1742 place count 60 transition count 171
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1748 place count 54 transition count 159
Iterating global reduction 11 with 6 rules applied. Total rules applied 1754 place count 54 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1760 place count 54 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1761 place count 54 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1762 place count 54 transition count 152
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1763 place count 54 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1764 place count 53 transition count 151
Applied a total of 1764 rules in 87 ms. Remains 53 /1514 variables (removed 1461) and now considering 151/1939 (removed 1788) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/1514 places, 151/1939 transitions.
Finished random walk after 1099 steps, including 195 resets, run visited all 3 properties in 26 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 1188 reset in 254 ms.
Product exploration explored 100000 steps with 1159 reset in 279 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 3 out of 1514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1839 edges and 1514 vertex of which 688 / 1514 are part of one of the 63 SCC in 1 ms
Free SCC test removed 625 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1391 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 880 transition count 1208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 492 place count 880 transition count 1196
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 492 place count 880 transition count 1210
Deduced a syphon composed of 500 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 514 place count 880 transition count 1210
Discarding 286 places :
Symmetric choice reduction at 2 with 286 rule applications. Total rules 800 place count 594 transition count 914
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 2 with 286 rules applied. Total rules applied 1086 place count 594 transition count 914
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1098 place count 582 transition count 898
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1110 place count 582 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1116 place count 582 transition count 892
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1128 place count 570 transition count 880
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1140 place count 570 transition count 880
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1142 place count 568 transition count 876
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1144 place count 568 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1146 place count 566 transition count 872
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1148 place count 566 transition count 872
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1152 place count 562 transition count 868
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1156 place count 562 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1158 place count 560 transition count 864
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1160 place count 560 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1162 place count 558 transition count 860
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1164 place count 558 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1168 place count 554 transition count 854
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1172 place count 554 transition count 854
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1175 place count 551 transition count 845
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1178 place count 551 transition count 845
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1180 place count 549 transition count 843
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1182 place count 549 transition count 843
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 318 places in 1 ms
Iterating global reduction 3 with 107 rules applied. Total rules applied 1289 place count 549 transition count 917
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1330 place count 549 transition count 876
Discarding 100 places :
Symmetric choice reduction at 4 with 100 rule applications. Total rules 1430 place count 449 transition count 764
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 4 with 100 rules applied. Total rules applied 1530 place count 449 transition count 764
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1535 place count 444 transition count 757
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 1540 place count 444 transition count 757
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1547 place count 444 transition count 757
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1551 place count 444 transition count 753
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1566 place count 429 transition count 734
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1581 place count 429 transition count 734
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1585 place count 429 transition count 730
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1589 place count 425 transition count 726
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1593 place count 425 transition count 726
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1596 place count 425 transition count 726
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1602 place count 425 transition count 720
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1605 place count 422 transition count 717
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1608 place count 422 transition count 717
Performed 72 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 287 places in 1 ms
Iterating global reduction 7 with 72 rules applied. Total rules applied 1680 place count 422 transition count 1040
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 7 with 122 rules applied. Total rules applied 1802 place count 422 transition count 918
Discarding 127 places :
Symmetric choice reduction at 8 with 127 rule applications. Total rules 1929 place count 295 transition count 587
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 8 with 127 rules applied. Total rules applied 2056 place count 295 transition count 587
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2071 place count 295 transition count 572
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2097 place count 269 transition count 519
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 9 with 26 rules applied. Total rules applied 2123 place count 269 transition count 519
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2126 place count 269 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2130 place count 269 transition count 559
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2134 place count 265 transition count 531
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2138 place count 265 transition count 531
Deduced a syphon composed of 142 places in 1 ms
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 2185 place count 265 transition count 484
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2189 place count 261 transition count 480
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2193 place count 261 transition count 480
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2196 place count 261 transition count 552
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2199 place count 258 transition count 537
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2202 place count 258 transition count 537
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 2202 rules in 673 ms. Remains 258 /1514 variables (removed 1256) and now considering 537/1939 (removed 1402) transitions.
[2022-05-16 09:09:17] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-16 09:09:17] [INFO ] Flow matrix only has 478 transitions (discarded 59 similar events)
// Phase 1: matrix 478 rows 258 cols
[2022-05-16 09:09:17] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 09:09:18] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1514 places, 537/1939 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/1514 places, 537/1939 transitions.
Product exploration explored 100000 steps with 1191 reset in 307 ms.
Product exploration explored 100000 steps with 1185 reset in 378 ms.
Built C files in :
/tmp/ltsmin2027189755361002212
[2022-05-16 09:09:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2027189755361002212
Running compilation step : cd /tmp/ltsmin2027189755361002212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2027189755361002212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2027189755361002212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1512 transition count 1937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1511 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1511 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1510 transition count 1935
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1509 transition count 1934
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1509 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 1509 transition count 1933
Applied a total of 11 rules in 368 ms. Remains 1509 /1514 variables (removed 5) and now considering 1933/1939 (removed 6) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:09:22] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:09:22] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:09:22] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:09:23] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
// Phase 1: matrix 1933 rows 1509 cols
[2022-05-16 09:09:23] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:09:25] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1514 places, 1933/1939 transitions.
Finished structural reductions, in 1 iterations. Remains : 1509/1514 places, 1933/1939 transitions.
Built C files in :
/tmp/ltsmin7345482339452778581
[2022-05-16 09:09:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7345482339452778581
Running compilation step : cd /tmp/ltsmin7345482339452778581;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7345482339452778581;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7345482339452778581;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 09:09:28] [INFO ] Flatten gal took : 57 ms
[2022-05-16 09:09:28] [INFO ] Flatten gal took : 56 ms
[2022-05-16 09:09:28] [INFO ] Time to serialize gal into /tmp/LTL411418004152447847.gal : 9 ms
[2022-05-16 09:09:28] [INFO ] Time to serialize properties into /tmp/LTL7360205708092543847.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL411418004152447847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7360205708092543847.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4114180...265
Read 1 LTL properties
Checking formula 0 : !((!(("((p564==1)&&(p1412==1))")U((X(!(X("((p572==1)&&(p1665==1))"))))U("(p941==1)")))))
Formula 0 simplified : "((p564==1)&&(p1412==1))" U (X!X"((p572==1)&&(p1665==1))" U "(p941==1)")
Detected timeout of ITS tools.
[2022-05-16 09:09:43] [INFO ] Flatten gal took : 51 ms
[2022-05-16 09:09:43] [INFO ] Applying decomposition
[2022-05-16 09:09:43] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2927524543575927628.txt' '-o' '/tmp/graph2927524543575927628.bin' '-w' '/tmp/graph2927524543575927628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2927524543575927628.bin' '-l' '-1' '-v' '-w' '/tmp/graph2927524543575927628.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:09:43] [INFO ] Decomposing Gal with order
[2022-05-16 09:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:09:43] [INFO ] Removed a total of 527 redundant transitions.
[2022-05-16 09:09:43] [INFO ] Flatten gal took : 113 ms
[2022-05-16 09:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 27 ms.
[2022-05-16 09:09:43] [INFO ] Time to serialize gal into /tmp/LTL9108111085536023531.gal : 19 ms
[2022-05-16 09:09:43] [INFO ] Time to serialize properties into /tmp/LTL9458901861530116988.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9108111085536023531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9458901861530116988.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9108111...245
Read 1 LTL properties
Checking formula 0 : !((!(("((i1.u102.p564==1)&&(i23.u329.p1412==1))")U((X(!(X("((i20.i0.i0.u72.p572==1)&&(i28.i2.i3.u398.p1665==1))"))))U("(i17.i0.i3.u218...170
Formula 0 simplified : "((i1.u102.p564==1)&&(i23.u329.p1412==1))" U (X!X"((i20.i0.i0.u72.p572==1)&&(i28.i2.i3.u398.p1665==1))" U "(i17.i0.i3.u218.p941==1)"...156
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t201, t284, t344, t393, t464, t515, t673, t702, t754, t785, t866, t990, t1184, t123...2044
Computing Next relation with stutter on 93988 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13044313071686197621
[2022-05-16 09:09:59] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13044313071686197621
Running compilation step : cd /tmp/ltsmin13044313071686197621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13044313071686197621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13044313071686197621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CloudReconfiguration-PT-319-LTLFireability-14 finished in 74144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&G(X(p2))))'
Support contains 4 out of 1556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1544 transition count 1980
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1544 transition count 1980
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1544 transition count 1978
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 1537 transition count 1971
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 1537 transition count 1971
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 1533 transition count 1967
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 1533 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 1529 transition count 1963
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 1529 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 1529 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 1526 transition count 1959
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 1526 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 1523 transition count 1956
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 1523 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 1520 transition count 1953
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 1520 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 1517 transition count 1947
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 1517 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 1514 transition count 1941
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 1514 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 1511 transition count 1938
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 1511 transition count 1938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 1511 transition count 1936
Applied a total of 95 rules in 822 ms. Remains 1511 /1556 variables (removed 45) and now considering 1936/1992 (removed 56) transitions.
// Phase 1: matrix 1936 rows 1511 cols
[2022-05-16 09:10:02] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 09:10:03] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 1936 rows 1511 cols
[2022-05-16 09:10:03] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 09:10:03] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
// Phase 1: matrix 1936 rows 1511 cols
[2022-05-16 09:10:03] [INFO ] Computed 4 place invariants in 18 ms
[2022-05-16 09:10:05] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1556 places, 1936/1992 transitions.
Finished structural reductions, in 1 iterations. Remains : 1511/1556 places, 1936/1992 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s282 1) (EQ s411 1)), p0:(EQ s208 1), p2:(AND (EQ s282 1) (EQ s411 1) (EQ s964 0))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLFireability-15 finished in 3287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((!X(p0)&&p1)) U X(p2)))))'
Found a CL insensitive property : CloudReconfiguration-PT-319-LTLFireability-10
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, false]
Support contains 3 out of 1556 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1556/1556 places, 1992/1992 transitions.
Graph (trivial) has 1891 edges and 1556 vertex of which 686 / 1556 are part of one of the 63 SCC in 0 ms
Free SCC test removed 623 places
Ensure Unique test removed 723 transitions
Reduce isomorphic transitions removed 723 transitions.
Graph (complete) has 1451 edges and 933 vertex of which 924 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 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 923 transition count 755
Reduce places removed 508 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 532 rules applied. Total rules applied 1042 place count 415 transition count 731
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1054 place count 403 transition count 731
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1054 place count 403 transition count 684
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1148 place count 356 transition count 684
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1164 place count 340 transition count 659
Iterating global reduction 3 with 16 rules applied. Total rules applied 1180 place count 340 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 1186 place count 340 transition count 653
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1190 place count 336 transition count 653
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1200 place count 326 transition count 637
Iterating global reduction 5 with 10 rules applied. Total rules applied 1210 place count 326 transition count 637
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1214 place count 326 transition count 633
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1216 place count 324 transition count 629
Iterating global reduction 6 with 2 rules applied. Total rules applied 1218 place count 324 transition count 629
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1220 place count 322 transition count 625
Iterating global reduction 6 with 2 rules applied. Total rules applied 1222 place count 322 transition count 625
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1224 place count 320 transition count 621
Iterating global reduction 6 with 2 rules applied. Total rules applied 1226 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1228 place count 318 transition count 617
Iterating global reduction 6 with 2 rules applied. Total rules applied 1230 place count 318 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1231 place count 317 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1232 place count 317 transition count 615
Performed 142 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 6 with 284 rules applied. Total rules applied 1516 place count 175 transition count 394
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1531 place count 175 transition count 379
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1539 place count 167 transition count 365
Iterating global reduction 7 with 8 rules applied. Total rules applied 1547 place count 167 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1548 place count 167 transition count 364
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1550 place count 165 transition count 362
Iterating global reduction 8 with 2 rules applied. Total rules applied 1552 place count 165 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1554 place count 165 transition count 360
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 1580 place count 152 transition count 345
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1595 place count 152 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1597 place count 151 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1599 place count 151 transition count 327
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1635 place count 133 transition count 362
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1654 place count 133 transition count 343
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1663 place count 124 transition count 325
Iterating global reduction 12 with 9 rules applied. Total rules applied 1672 place count 124 transition count 325
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1678 place count 124 transition count 319
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1679 place count 124 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1680 place count 124 transition count 318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1681 place count 123 transition count 317
Applied a total of 1681 rules in 118 ms. Remains 123 /1556 variables (removed 1433) and now considering 317/1992 (removed 1675) transitions.
[2022-05-16 09:10:06] [INFO ] Flow matrix only has 260 transitions (discarded 57 similar events)
// Phase 1: matrix 260 rows 123 cols
[2022-05-16 09:10:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-16 09:10:06] [INFO ] Flow matrix only has 260 transitions (discarded 57 similar events)
// Phase 1: matrix 260 rows 123 cols
[2022-05-16 09:10:06] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 09:10:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 09:10:06] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 321 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 122/1556 places, 317/1992 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 316
Applied a total of 2 rules in 5 ms. Remains 121 /122 variables (removed 1) and now considering 316/317 (removed 1) transitions.
[2022-05-16 09:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-16 09:10:06] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 09:10:06] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 121/1556 places, 316/1992 transitions.
Finished structural reductions, in 2 iterations. Remains : 121/1556 places, 316/1992 transitions.
Running random walk in product with property : CloudReconfiguration-PT-319-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s88 1), p2:(OR (NEQ s5 1) (EQ s44 1)), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40363 reset in 370 ms.
Product exploration explored 100000 steps with 40448 reset in 381 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 777 ms. Reduced automaton from 6 states, 23 edges and 3 AP to 6 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 1852 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 530 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 526 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-16 09:10:09] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:09] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 09:10:10] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 09:10:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 09:10:10] [INFO ] After 99ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-16 09:10:10] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-16 09:10:10] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 121/121 places, 316/316 transitions.
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 121 transition count 260
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 114 place count 92 transition count 231
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 138 place count 92 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 91 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 91 transition count 205
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 2 with 2 rules applied. Total rules applied 142 place count 90 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 145 place count 90 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 3 with 2 rules applied. Total rules applied 147 place count 89 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 89 transition count 198
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 4 with 2 rules applied. Total rules applied 151 place count 88 transition count 197
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 156 place count 88 transition count 192
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 86 transition count 190
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 86 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 86 transition count 188
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 200 place count 67 transition count 227
Drop transitions removed 12 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 235 place count 67 transition count 192
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 247 place count 55 transition count 176
Iterating global reduction 7 with 12 rules applied. Total rules applied 259 place count 55 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 265 place count 55 transition count 170
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 271 place count 49 transition count 158
Iterating global reduction 8 with 6 rules applied. Total rules applied 277 place count 49 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 283 place count 49 transition count 152
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 297 place count 49 transition count 138
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 298 place count 48 transition count 135
Iterating global reduction 9 with 1 rules applied. Total rules applied 299 place count 48 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 300 place count 48 transition count 134
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 301 place count 47 transition count 133
Iterating global reduction 10 with 1 rules applied. Total rules applied 302 place count 47 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 305 place count 47 transition count 130
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 306 place count 47 transition count 129
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 309 place count 47 transition count 126
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 313 place count 44 transition count 125
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 315 place count 44 transition count 125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 316 place count 44 transition count 124
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 317 place count 43 transition count 123
Iterating global reduction 12 with 1 rules applied. Total rules applied 318 place count 43 transition count 123
Applied a total of 318 rules in 58 ms. Remains 43 /121 variables (removed 78) and now considering 123/316 (removed 193) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/121 places, 123/316 transitions.
Incomplete random walk after 10000 steps, including 310 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:10:10] [INFO ] Flow matrix only has 114 transitions (discarded 9 similar events)
// Phase 1: matrix 114 rows 43 cols
[2022-05-16 09:10:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 09:10:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 09:10:11] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:10:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 09:10:11] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:10:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 09:10:11] [INFO ] After 22ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:10:11] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2022-05-16 09:10:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-16 09:10:11] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2022-05-16 09:10:11] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 p1 (NOT p2))), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 17 factoid took 1234 ms. Reduced automaton from 6 states, 23 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p2 p1 p0)]
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 316/316 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2022-05-16 09:10:12] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-16 09:10:12] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 09:10:13] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2022-05-16 09:10:13] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:13] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 316/316 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 787 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p2 p1 p0)]
Incomplete random walk after 10000 steps, including 1852 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 531 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 521 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-16 09:10:15] [INFO ] Flow matrix only has 259 transitions (discarded 57 similar events)
// Phase 1: matrix 259 rows 121 cols
[2022-05-16 09:10:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 09:10:15] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 09:10:15] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 09:10:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 09:10:15] [INFO ] After 61ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 09:10:15] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-16 09:10:16] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 121/121 places, 316/316 transitions.
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 121 transition count 260
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 114 place count 92 transition count 231
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 138 place count 92 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 91 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 91 transition count 205
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 2 with 2 rules applied. Total rules applied 142 place count 90 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 145 place count 90 transition count 201
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 3 with 2 rules applied. Total rules applied 147 place count 89 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 89 transition count 198
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 4 with 2 rules applied. Total rules applied 151 place count 88 transition count 197
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 156 place count 88 transition count 192
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 86 transition count 190
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 86 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 86 transition count 188
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 200 place count 67 transition count 227
Drop transitions removed 12 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 235 place count 67 transition count 192
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 247 place count 55 transition count 176
Iterating global reduction 7 with 12 rules applied. Total rules applied 259 place count 55 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 265 place count 55 transition count 170
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 271 place count 49 transition count 158
Iterating global reduction 8 with 6 rules applied. Total rules applied 277 place count 49 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 283 place count 49 transition count 152
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 297 place count 49 transition count 138
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 298 place count 48 transition count 135
Iterating global reduction 9 with 1 rules applied. Total rules applied 299 place count 48 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 300 place count 48 transition count 134
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 301 place count 47 transition count 133
Iterating global reduction 10 with 1 rules applied. Total rules applied 302 place count 47 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 305 place count 47 transition count 130
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 306 place count 47 transition count 129
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 309 place count 47 transition count 126
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 313 place count 44 transition count 125
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 315 place count 44 transition count 125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 316 place count 44 transition count 124
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 317 place count 43 transition count 123
Iterating global reduction 12 with 1 rules applied. Total rules applied 318 place count 43 transition count 123
Applied a total of 318 rules in 28 ms. Remains 43 /121 variables (removed 78) and now considering 123/316 (removed 193) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/121 places, 123/316 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-16 09:10:16] [INFO ] Flow matrix only has 114 transitions (discarded 9 similar events)
// Phase 1: matrix 114 rows 43 cols
[2022-05-16 09:10:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 09:10:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 09:10:16] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:10:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 09:10:16] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:10:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 09:10:16] [INFO ] After 11ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:10:16] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-16 09:10:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-16 09:10:16] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-16 09:10:16] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 18 factoid took 1103 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (AND p0 p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p2 p0)]
Product exploration explored 100000 steps with 40424 reset in 356 ms.
Product exploration explored 100000 steps with 40517 reset in 359 ms.
Built C files in :
/tmp/ltsmin12213100061001876756
[2022-05-16 09:10:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12213100061001876756
Running compilation step : cd /tmp/ltsmin12213100061001876756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 635 ms.
Running link step : cd /tmp/ltsmin12213100061001876756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12213100061001876756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11818727965956311002.hoa' '--buchi-type=spotba'
LTSmin run took 299 ms.
Treatment of property CloudReconfiguration-PT-319-LTLFireability-10 finished in 15270 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (X(!X(p1)) U p2)))'
[2022-05-16 09:10:20] [INFO ] Flatten gal took : 76 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11627910646093111799
[2022-05-16 09:10:20] [INFO ] Too many transitions (1992) to apply POR reductions. Disabling POR matrices.
[2022-05-16 09:10:20] [INFO ] Applying decomposition
[2022-05-16 09:10:20] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11627910646093111799
Running compilation step : cd /tmp/ltsmin11627910646093111799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 09:10:21] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph24886011569494913.txt' '-o' '/tmp/graph24886011569494913.bin' '-w' '/tmp/graph24886011569494913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph24886011569494913.bin' '-l' '-1' '-v' '-w' '/tmp/graph24886011569494913.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:10:21] [INFO ] Decomposing Gal with order
[2022-05-16 09:10:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:10:21] [INFO ] Removed a total of 549 redundant transitions.
[2022-05-16 09:10:21] [INFO ] Flatten gal took : 112 ms
[2022-05-16 09:10:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 58 ms.
[2022-05-16 09:10:21] [INFO ] Time to serialize gal into /tmp/LTLFireability8040790335181436538.gal : 19 ms
[2022-05-16 09:10:21] [INFO ] Time to serialize properties into /tmp/LTLFireability4019730451394590986.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8040790335181436538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4019730451394590986.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((F(G((F((!(X("(i8.u17.p93==1)")))&&("(i30.i0.i3.u488.p2009==1)")))U(X("((i8.u17.p93!=1)||(i18.i3.i5.u269.p1222==1))"))))))
Formula 0 simplified : !FG(F("(i30.i0.i3.u488.p2009==1)" & !X"(i8.u17.p93==1)") U X"((i8.u17.p93!=1)||(i18.i3.i5.u269.p1222==1))")
Compilation finished in 6611 ms.
Running link step : cd /tmp/ltsmin11627910646093111799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11627910646093111799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((!X((LTLAPp0==true))&&(LTLAPp1==true))) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t26, t201, t284, t315, t344, t393, t464, t754, t769, t773, t785, t816, t841, t866, t990, t118...2084
Computing Next relation with stutter on 102476 deadlock states
LTSmin run took 23407 ms.
FORMULA CloudReconfiguration-PT-319-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11627910646093111799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!((LTLAPp3==true) U (X(!X((LTLAPp4==true))) U (LTLAPp5==true)))' '--buchi-type=spotba'
103 unique states visited
103 strongly connected components in search stack
104 transitions explored
103 items max in DFS search stack
1997 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,20.2731,513880,1,0,889649,10388,23171,3.1765e+06,538,122307,1675800
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !((!(("((i9.u104.p564==1)&&(i22.u343.p1412==1))")U((X(!(X("((i9.u106.p572==1)&&(i24.i0.i0.u411.p1665==1))"))))U("(i17.i0.i3.u222.p941=...164
Formula 1 simplified : "((i9.u104.p564==1)&&(i22.u343.p1412==1))" U (X!X"((i9.u106.p572==1)&&(i24.i0.i0.u411.p1665==1))" U "(i17.i0.i3.u222.p941==1)")
Computing Next relation with stutter on 102476 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1405 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,34.323,854408,1,0,1.49411e+06,11372,23310,5.07105e+06,539,142557,2895120
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-319-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 344526 ms.

BK_STOP 1652692307470

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-319"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-319, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095600356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-319.tgz
mv CloudReconfiguration-PT-319 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;