Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 11 19:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 19:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 661K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716307679973

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-317
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 16:08:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 16:08:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:08:01] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-21 16:08:01] [INFO ] Transformed 2587 places.
[2024-05-21 16:08:01] [INFO ] Transformed 3099 transitions.
[2024-05-21 16:08:01] [INFO ] Found NUPN structural information;
[2024-05-21 16:08:01] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Discarding 514 places :
Symmetric choice reduction at 0 with 514 rule applications. Total rules 514 place count 2073 transition count 2585
Iterating global reduction 0 with 514 rules applied. Total rules applied 1028 place count 2073 transition count 2585
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1056 place count 2073 transition count 2557
Discarding 238 places :
Symmetric choice reduction at 1 with 238 rule applications. Total rules 1294 place count 1835 transition count 2319
Iterating global reduction 1 with 238 rules applied. Total rules applied 1532 place count 1835 transition count 2319
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1620 place count 1747 transition count 2231
Iterating global reduction 1 with 88 rules applied. Total rules applied 1708 place count 1747 transition count 2231
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1724 place count 1747 transition count 2215
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1769 place count 1702 transition count 2170
Iterating global reduction 2 with 45 rules applied. Total rules applied 1814 place count 1702 transition count 2170
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1821 place count 1702 transition count 2163
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1857 place count 1666 transition count 2122
Iterating global reduction 3 with 36 rules applied. Total rules applied 1893 place count 1666 transition count 2122
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1920 place count 1639 transition count 2095
Iterating global reduction 3 with 27 rules applied. Total rules applied 1947 place count 1639 transition count 2095
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1972 place count 1614 transition count 2070
Iterating global reduction 3 with 25 rules applied. Total rules applied 1997 place count 1614 transition count 2070
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2022 place count 1589 transition count 2045
Iterating global reduction 3 with 25 rules applied. Total rules applied 2047 place count 1589 transition count 2045
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2069 place count 1567 transition count 2009
Iterating global reduction 3 with 22 rules applied. Total rules applied 2091 place count 1567 transition count 2009
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2098 place count 1560 transition count 1997
Iterating global reduction 3 with 7 rules applied. Total rules applied 2105 place count 1560 transition count 1997
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2110 place count 1555 transition count 1991
Iterating global reduction 3 with 5 rules applied. Total rules applied 2115 place count 1555 transition count 1991
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2117 place count 1555 transition count 1989
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2118 place count 1554 transition count 1988
Iterating global reduction 4 with 1 rules applied. Total rules applied 2119 place count 1554 transition count 1988
Applied a total of 2119 rules in 1450 ms. Remains 1554 /2587 variables (removed 1033) and now considering 1988/3099 (removed 1111) transitions.
// Phase 1: matrix 1988 rows 1554 cols
[2024-05-21 16:08:03] [INFO ] Computed 4 invariants in 35 ms
[2024-05-21 16:08:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 16:08:03] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-21 16:08:03] [INFO ] Invariant cache hit.
[2024-05-21 16:08:04] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2024-05-21 16:08:04] [INFO ] Invariant cache hit.
[2024-05-21 16:08:05] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1554/2587 places, 1988/3099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3689 ms. Remains : 1554/2587 places, 1988/3099 transitions.
Support contains 36 out of 1554 places after structural reductions.
[2024-05-21 16:08:05] [INFO ] Flatten gal took : 120 ms
[2024-05-21 16:08:05] [INFO ] Flatten gal took : 66 ms
[2024-05-21 16:08:06] [INFO ] Input system was already deterministic with 1988 transitions.
Support contains 33 out of 1554 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-21 16:08:06] [INFO ] Invariant cache hit.
[2024-05-21 16:08:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 16:08:08] [INFO ] After 1753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-21 16:08:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 16:08:11] [INFO ] After 1730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-21 16:08:13] [INFO ] After 3565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1052 ms.
[2024-05-21 16:08:14] [INFO ] After 5591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 14 properties in 206 ms.
Support contains 4 out of 1554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Graph (trivial) has 1889 edges and 1554 vertex of which 696 / 1554 are part of one of the 63 SCC in 7 ms
Free SCC test removed 633 places
Drop transitions removed 799 transitions
Reduce isomorphic transitions removed 799 transitions.
Graph (complete) has 1368 edges and 921 vertex of which 912 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 518 transitions
Trivial Post-agglo rules discarded 518 transitions
Performed 518 trivial Post agglomeration. Transition count delta: 518
Iterating post reduction 0 with 525 rules applied. Total rules applied 527 place count 912 transition count 660
Reduce places removed 518 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 578 rules applied. Total rules applied 1105 place count 394 transition count 600
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1144 place count 356 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1145 place count 355 transition count 599
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1145 place count 355 transition count 554
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1235 place count 310 transition count 554
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1248 place count 297 transition count 536
Iterating global reduction 4 with 13 rules applied. Total rules applied 1261 place count 297 transition count 536
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1263 place count 297 transition count 534
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1265 place count 295 transition count 534
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1265 place count 295 transition count 533
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1267 place count 294 transition count 533
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1273 place count 288 transition count 527
Iterating global reduction 6 with 6 rules applied. Total rules applied 1279 place count 288 transition count 527
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1285 place count 288 transition count 521
Performed 151 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 7 with 302 rules applied. Total rules applied 1587 place count 137 transition count 268
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1607 place count 137 transition count 248
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1610 place count 134 transition count 245
Iterating global reduction 8 with 3 rules applied. Total rules applied 1613 place count 134 transition count 245
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 8 with 24 rules applied. Total rules applied 1637 place count 122 transition count 231
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1652 place count 122 transition count 216
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 1654 place count 121 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1656 place count 121 transition count 213
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 1658 place count 120 transition count 212
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1659 place count 120 transition count 211
Performed 35 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 11 with 70 rules applied. Total rules applied 1729 place count 85 transition count 260
Drop transitions removed 12 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 11 with 44 rules applied. Total rules applied 1773 place count 85 transition count 216
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 1795 place count 63 transition count 180
Iterating global reduction 12 with 22 rules applied. Total rules applied 1817 place count 63 transition count 180
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1830 place count 63 transition count 167
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1836 place count 57 transition count 155
Iterating global reduction 13 with 6 rules applied. Total rules applied 1842 place count 57 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1848 place count 57 transition count 149
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 1857 place count 57 transition count 140
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1858 place count 56 transition count 137
Iterating global reduction 14 with 1 rules applied. Total rules applied 1859 place count 56 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1860 place count 56 transition count 136
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1861 place count 55 transition count 135
Iterating global reduction 15 with 1 rules applied. Total rules applied 1862 place count 55 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1864 place count 55 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1865 place count 55 transition count 132
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1869 place count 55 transition count 128
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1875 place count 51 transition count 126
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1876 place count 51 transition count 125
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1879 place count 51 transition count 125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1880 place count 51 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1881 place count 50 transition count 123
Applied a total of 1881 rules in 139 ms. Remains 50 /1554 variables (removed 1504) and now considering 123/1988 (removed 1865) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 50/1554 places, 123/1988 transitions.
Finished random walk after 239 steps, including 3 resets, run visited all 3 properties in 4 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 36 stable transitions
Graph (complete) has 2172 edges and 1554 vertex of which 1545 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.27 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1536 transition count 1968
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1536 transition count 1968
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1525 transition count 1957
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1525 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1525 transition count 1956
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 1521 transition count 1952
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 1521 transition count 1952
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 1521 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 1519 transition count 1948
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 1519 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 1517 transition count 1945
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 1517 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 1515 transition count 1942
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 1515 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 1513 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 1513 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 1513 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 1512 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 1512 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 1511 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 1511 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 1510 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 1510 transition count 1936
Applied a total of 92 rules in 430 ms. Remains 1510 /1554 variables (removed 44) and now considering 1936/1988 (removed 52) transitions.
// Phase 1: matrix 1936 rows 1510 cols
[2024-05-21 16:08:15] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 16:08:15] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 16:08:15] [INFO ] Invariant cache hit.
[2024-05-21 16:08:16] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2024-05-21 16:08:16] [INFO ] Invariant cache hit.
[2024-05-21 16:08:17] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1554 places, 1936/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2438 ms. Remains : 1510/1554 places, 1936/1988 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s512 0) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-00 finished in 2720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p2&&F(p3))||p1)&&p0))))'
Support contains 7 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1539 transition count 1972
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1539 transition count 1972
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1539 transition count 1970
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 1533 transition count 1964
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 1533 transition count 1964
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 1531 transition count 1962
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 1531 transition count 1962
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 1531 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1530 transition count 1960
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1530 transition count 1960
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1529 transition count 1958
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1529 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1528 transition count 1956
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1528 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1527 transition count 1955
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1527 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 1527 transition count 1954
Applied a total of 58 rules in 340 ms. Remains 1527 /1554 variables (removed 27) and now considering 1954/1988 (removed 34) transitions.
// Phase 1: matrix 1954 rows 1527 cols
[2024-05-21 16:08:17] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 16:08:18] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 16:08:18] [INFO ] Invariant cache hit.
[2024-05-21 16:08:18] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2024-05-21 16:08:18] [INFO ] Invariant cache hit.
[2024-05-21 16:08:19] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1527/1554 places, 1954/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2159 ms. Remains : 1527/1554 places, 1954/1988 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p3:(OR (EQ s1455 0) (EQ s28 1)), p0:(AND (EQ s193 0) (EQ s353 1) (OR (EQ s1122 0) (EQ s680 1))), p1:(OR (EQ s353 0) (EQ s193 1)), p2:(EQ s212 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-01 finished in 2510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1536 transition count 1968
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1536 transition count 1968
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1536 transition count 1966
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 1526 transition count 1956
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 1526 transition count 1956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 1526 transition count 1955
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 1522 transition count 1951
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 1522 transition count 1951
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 1522 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 1520 transition count 1947
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 1520 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 1518 transition count 1944
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 1516 transition count 1941
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 1514 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 1514 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 1513 transition count 1937
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 1512 transition count 1936
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 1511 transition count 1935
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 1511 transition count 1935
Applied a total of 92 rules in 445 ms. Remains 1511 /1554 variables (removed 43) and now considering 1935/1988 (removed 53) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 16:08:20] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 16:08:20] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 16:08:20] [INFO ] Invariant cache hit.
[2024-05-21 16:08:21] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2024-05-21 16:08:21] [INFO ] Invariant cache hit.
[2024-05-21 16:08:22] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1554 places, 1935/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2289 ms. Remains : 1511/1554 places, 1935/1988 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s198 0), p1:(AND (EQ s174 0) (EQ s483 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1165 ms.
Product exploration explored 100000 steps with 50000 reset in 1124 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2118 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-317-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-03 finished in 4868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0)||X(X(X(!p1)))) U (G((F(p0)||X(X(X(!p1)))))||((F(p0)||X(X(X(!p1))))&&G(p2))))))'
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1536 transition count 1968
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1536 transition count 1968
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1536 transition count 1966
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 1525 transition count 1955
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 1525 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 1525 transition count 1954
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 1521 transition count 1950
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 1521 transition count 1950
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 1521 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 1519 transition count 1946
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 1519 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 1517 transition count 1943
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 1513 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 1513 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 1512 transition count 1936
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 1511 transition count 1935
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 1510 transition count 1934
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 1510 transition count 1934
Applied a total of 94 rules in 419 ms. Remains 1510 /1554 variables (removed 44) and now considering 1934/1988 (removed 54) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2024-05-21 16:08:25] [INFO ] Computed 4 invariants in 19 ms
[2024-05-21 16:08:25] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 16:08:25] [INFO ] Invariant cache hit.
[2024-05-21 16:08:26] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2024-05-21 16:08:26] [INFO ] Invariant cache hit.
[2024-05-21 16:08:27] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1554 places, 1934/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2390 ms. Remains : 1510/1554 places, 1934/1988 transitions.
Stuttering acceptance computed with spot in 905 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 10}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={1} source=5 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={1} source=6 dest: 14}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=7 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=8 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=9 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=9 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=9 dest: 12}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=9 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=10 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=11 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=11 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=12 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=12 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=12 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=13 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=13 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=13 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=13 dest: 14}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=14 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=14 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=14 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={1} source=14 dest: 17}], [{ cond=(NOT p0), acceptance={0, 1} source=15 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=15 dest: 15}, { cond=(AND p2 (NOT p0)), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=16 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=16 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=16 dest: 15}, { cond=(AND p2 (NOT p0)), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=17 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=17 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=17 dest: 9}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=17 dest: 17}]], initial=0, aps=[p2:(NEQ s577 1), p0:(AND (OR (EQ s183 0) (EQ s12 1)) (EQ s577 1)), p1:(OR (EQ s183 0) (EQ s12 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1087 reset in 222 ms.
Product exploration explored 100000 steps with 1109 reset in 302 ms.
Computed a total of 30 stabilizing places and 34 stable transitions
Graph (complete) has 2117 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 30 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 390 ms. Reduced automaton from 18 states, 63 edges and 3 AP (stutter sensitive) to 18 states, 63 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1052 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 105 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:08:30] [INFO ] Invariant cache hit.
[2024-05-21 16:08:30] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 16:08:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 16:08:31] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 16:08:31] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-21 16:08:31] [INFO ] After 1040ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1934/1934 transitions.
Graph (trivial) has 1838 edges and 1510 vertex of which 693 / 1510 are part of one of the 63 SCC in 8 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1316 edges and 880 vertex of which 871 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 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 871 transition count 641
Reduce places removed 486 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 545 rules applied. Total rules applied 1040 place count 385 transition count 582
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1079 place count 347 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1080 place count 346 transition count 581
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1080 place count 346 transition count 532
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1178 place count 297 transition count 532
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1189 place count 286 transition count 516
Iterating global reduction 4 with 11 rules applied. Total rules applied 1200 place count 286 transition count 516
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 1203 place count 286 transition count 513
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1206 place count 283 transition count 513
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1213 place count 276 transition count 505
Iterating global reduction 6 with 7 rules applied. Total rules applied 1220 place count 276 transition count 505
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1226 place count 276 transition count 499
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1227 place count 275 transition count 493
Iterating global reduction 7 with 1 rules applied. Total rules applied 1228 place count 275 transition count 493
Performed 142 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1512 place count 133 transition count 257
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1526 place count 133 transition count 243
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1529 place count 130 transition count 240
Iterating global reduction 8 with 3 rules applied. Total rules applied 1532 place count 130 transition count 240
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1558 place count 117 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1573 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 9 with 2 rules applied. Total rules applied 1575 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1577 place count 116 transition count 206
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 1579 place count 115 transition count 205
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1581 place count 115 transition count 203
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1647 place count 82 transition count 247
Drop transitions removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 11 with 47 rules applied. Total rules applied 1694 place count 82 transition count 200
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1717 place count 59 transition count 170
Iterating global reduction 12 with 23 rules applied. Total rules applied 1740 place count 59 transition count 170
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1754 place count 59 transition count 156
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1760 place count 53 transition count 144
Iterating global reduction 13 with 6 rules applied. Total rules applied 1766 place count 53 transition count 144
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1772 place count 53 transition count 138
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 1792 place count 53 transition count 118
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1794 place count 51 transition count 112
Iterating global reduction 14 with 2 rules applied. Total rules applied 1796 place count 51 transition count 112
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1798 place count 49 transition count 110
Iterating global reduction 14 with 2 rules applied. Total rules applied 1800 place count 49 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1804 place count 49 transition count 106
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1806 place count 49 transition count 104
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1810 place count 49 transition count 100
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1815 place count 45 transition count 99
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1816 place count 45 transition count 98
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1818 place count 45 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1819 place count 45 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1820 place count 44 transition count 96
Applied a total of 1820 rules in 89 ms. Remains 44 /1510 variables (removed 1466) and now considering 96/1934 (removed 1838) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 44/1510 places, 96/1934 transitions.
Finished random walk after 189 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=189 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 10 factoid took 2070 ms. Reduced automaton from 18 states, 63 edges and 3 AP (stutter sensitive) to 18 states, 51 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 915 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 798 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
[2024-05-21 16:08:35] [INFO ] Invariant cache hit.
[2024-05-21 16:08:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 16:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:08:36] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2024-05-21 16:08:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:08:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 16:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:08:38] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-21 16:08:38] [INFO ] Computed and/alt/rep : 1927/2367/1927 causal constraints (skipped 6 transitions) in 88 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 16:08:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) p1)
Could not prove EG (AND (NOT p0) p1)
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1934/1934 transitions.
Applied a total of 0 rules in 35 ms. Remains 1510 /1510 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2024-05-21 16:08:52] [INFO ] Invariant cache hit.
[2024-05-21 16:08:52] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 16:08:52] [INFO ] Invariant cache hit.
[2024-05-21 16:08:53] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-05-21 16:08:53] [INFO ] Invariant cache hit.
[2024-05-21 16:08:53] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1811 ms. Remains : 1510/1510 places, 1934/1934 transitions.
Computed a total of 30 stabilizing places and 34 stable transitions
Graph (complete) has 2117 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 30 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 2469 ms. Reduced automaton from 18 states, 51 edges and 3 AP (stutter sensitive) to 18 states, 51 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 855 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2024-05-21 16:08:57] [INFO ] Invariant cache hit.
[2024-05-21 16:08:57] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:08:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 16:08:58] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:08:58] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-21 16:08:58] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1934/1934 transitions.
Graph (trivial) has 1838 edges and 1510 vertex of which 693 / 1510 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1316 edges and 880 vertex of which 871 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 871 transition count 641
Reduce places removed 486 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 545 rules applied. Total rules applied 1040 place count 385 transition count 582
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1079 place count 347 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1080 place count 346 transition count 581
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1080 place count 346 transition count 532
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1178 place count 297 transition count 532
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1189 place count 286 transition count 516
Iterating global reduction 4 with 11 rules applied. Total rules applied 1200 place count 286 transition count 516
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 1203 place count 286 transition count 513
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1206 place count 283 transition count 513
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1213 place count 276 transition count 505
Iterating global reduction 6 with 7 rules applied. Total rules applied 1220 place count 276 transition count 505
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1226 place count 276 transition count 499
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1227 place count 275 transition count 493
Iterating global reduction 7 with 1 rules applied. Total rules applied 1228 place count 275 transition count 493
Performed 142 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1512 place count 133 transition count 257
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1526 place count 133 transition count 243
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1529 place count 130 transition count 240
Iterating global reduction 8 with 3 rules applied. Total rules applied 1532 place count 130 transition count 240
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1558 place count 117 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1573 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 9 with 2 rules applied. Total rules applied 1575 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1577 place count 116 transition count 206
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 1579 place count 115 transition count 205
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1581 place count 115 transition count 203
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1647 place count 82 transition count 247
Drop transitions removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 11 with 47 rules applied. Total rules applied 1694 place count 82 transition count 200
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1717 place count 59 transition count 170
Iterating global reduction 12 with 23 rules applied. Total rules applied 1740 place count 59 transition count 170
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1754 place count 59 transition count 156
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1760 place count 53 transition count 144
Iterating global reduction 13 with 6 rules applied. Total rules applied 1766 place count 53 transition count 144
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1772 place count 53 transition count 138
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 1792 place count 53 transition count 118
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1794 place count 51 transition count 112
Iterating global reduction 14 with 2 rules applied. Total rules applied 1796 place count 51 transition count 112
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1798 place count 49 transition count 110
Iterating global reduction 14 with 2 rules applied. Total rules applied 1800 place count 49 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1804 place count 49 transition count 106
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1806 place count 49 transition count 104
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1810 place count 49 transition count 100
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1815 place count 45 transition count 99
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1816 place count 45 transition count 98
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1818 place count 45 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1819 place count 45 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1820 place count 44 transition count 96
Applied a total of 1820 rules in 58 ms. Remains 44 /1510 variables (removed 1466) and now considering 96/1934 (removed 1838) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 44/1510 places, 96/1934 transitions.
Finished random walk after 416 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=416 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0))), (F p0)]
Knowledge based reduction with 9 factoid took 2696 ms. Reduced automaton from 18 states, 51 edges and 3 AP (stutter sensitive) to 18 states, 51 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 757 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 797 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
[2024-05-21 16:09:02] [INFO ] Invariant cache hit.
[2024-05-21 16:09:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 16:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:09:04] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-21 16:09:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:09:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 16:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:09:05] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2024-05-21 16:09:05] [INFO ] Computed and/alt/rep : 1927/2367/1927 causal constraints (skipped 6 transitions) in 84 ms.
[2024-05-21 16:09:19] [INFO ] Added : 820 causal constraints over 164 iterations in 13803 ms. Result :unknown
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 760 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 1054 reset in 153 ms.
Product exploration explored 100000 steps with 1112 reset in 169 ms.
Built C files in :
/tmp/ltsmin4924915833338395455
[2024-05-21 16:09:21] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4924915833338395455
Running compilation step : cd /tmp/ltsmin4924915833338395455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4924915833338395455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4924915833338395455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1934/1934 transitions.
Applied a total of 0 rules in 40 ms. Remains 1510 /1510 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2024-05-21 16:09:24] [INFO ] Invariant cache hit.
[2024-05-21 16:09:24] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 16:09:24] [INFO ] Invariant cache hit.
[2024-05-21 16:09:25] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-21 16:09:25] [INFO ] Invariant cache hit.
[2024-05-21 16:09:25] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 1510/1510 places, 1934/1934 transitions.
Built C files in :
/tmp/ltsmin7728216242977148948
[2024-05-21 16:09:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7728216242977148948
Running compilation step : cd /tmp/ltsmin7728216242977148948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7728216242977148948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7728216242977148948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 16:09:29] [INFO ] Flatten gal took : 55 ms
[2024-05-21 16:09:29] [INFO ] Flatten gal took : 52 ms
[2024-05-21 16:09:29] [INFO ] Time to serialize gal into /tmp/LTL15838251393000604327.gal : 11 ms
[2024-05-21 16:09:29] [INFO ] Time to serialize properties into /tmp/LTL1874868933052285491.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15838251393000604327.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8660659856059281358.hoa' '-atoms' '/tmp/LTL1874868933052285491.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(((F("(((p364==0)||(p12==1))&&(p986==1))"))||(X(X(X(!("((p364==0)||(p12==1))"))))))U((G((F("(((p364==0)||(p12==1))&&(p986==1))"))|...303
Formula 0 simplified : G(F!"(p986!=1)" U (G!"(((p364==0)||(p12==1))&&(p986==1))" & XXX"((p364==0)||(p12==1))"))
Detected timeout of ITS tools.
[2024-05-21 16:09:59] [INFO ] Flatten gal took : 38 ms
[2024-05-21 16:09:59] [INFO ] Applying decomposition
[2024-05-21 16:09:59] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9391021008715512659.txt' '-o' '/tmp/graph9391021008715512659.bin' '-w' '/tmp/graph9391021008715512659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9391021008715512659.bin' '-l' '-1' '-v' '-w' '/tmp/graph9391021008715512659.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:09:59] [INFO ] Decomposing Gal with order
[2024-05-21 16:09:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:10:00] [INFO ] Removed a total of 502 redundant transitions.
[2024-05-21 16:10:00] [INFO ] Flatten gal took : 167 ms
[2024-05-21 16:10:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 44 ms.
[2024-05-21 16:10:00] [INFO ] Time to serialize gal into /tmp/LTL16333953117269335988.gal : 36 ms
[2024-05-21 16:10:00] [INFO ] Time to serialize properties into /tmp/LTL2827700533707028892.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16333953117269335988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2827700533707028892.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((F("(((i4.u70.p364==0)||(i1.i0.i6.u4.p12==1))&&(i17.i0.i0.u231.p986==1))"))||(X(X(X(!("((i4.u70.p364==0)||(i1.i0.i6.u4.p12==1))"...477
Formula 0 simplified : G(F!"(i17.i0.i0.u231.p986!=1)" U (G!"(((i4.u70.p364==0)||(i1.i0.i6.u4.p12==1))&&(i17.i0.i0.u231.p986==1))" & XXX"((i4.u70.p364==0)||...179
Reverse transition relation is NOT exact ! Due to transitions t116, t183, t212, t235, t264, t278, t283, t295, t344, t374, t660, t712, t741, t755, t760, t77...2405
Computing Next relation with stutter on 104080 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12417066550402179459
[2024-05-21 16:10:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12417066550402179459
Running compilation step : cd /tmp/ltsmin12417066550402179459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12417066550402179459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12417066550402179459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-04 finished in 113587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Graph (trivial) has 1887 edges and 1554 vertex of which 681 / 1554 are part of one of the 62 SCC in 2 ms
Free SCC test removed 619 places
Ensure Unique test removed 720 transitions
Reduce isomorphic transitions removed 720 transitions.
Graph (complete) has 1446 edges and 935 vertex of which 926 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 510 transitions
Trivial Post-agglo rules discarded 510 transitions
Performed 510 trivial Post agglomeration. Transition count delta: 510
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 925 transition count 752
Reduce places removed 510 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 534 rules applied. Total rules applied 1046 place count 415 transition count 728
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 1060 place count 403 transition count 726
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1062 place count 401 transition count 726
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1062 place count 401 transition count 681
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1152 place count 356 transition count 681
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1172 place count 336 transition count 650
Iterating global reduction 4 with 20 rules applied. Total rules applied 1192 place count 336 transition count 650
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1194 place count 336 transition count 648
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1196 place count 334 transition count 648
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1196 place count 334 transition count 646
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1200 place count 332 transition count 646
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1210 place count 322 transition count 632
Iterating global reduction 6 with 10 rules applied. Total rules applied 1220 place count 322 transition count 632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1226 place count 322 transition count 626
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 320 transition count 622
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 320 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1232 place count 318 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1234 place count 318 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1236 place count 316 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1238 place count 316 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1240 place count 314 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1242 place count 314 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1244 place count 312 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1246 place count 312 transition count 606
Performed 144 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 7 with 288 rules applied. Total rules applied 1534 place count 168 transition count 380
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1550 place count 168 transition count 364
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1556 place count 162 transition count 349
Iterating global reduction 8 with 6 rules applied. Total rules applied 1562 place count 162 transition count 349
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 8 with 26 rules applied. Total rules applied 1588 place count 149 transition count 334
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1602 place count 149 transition count 320
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1638 place count 131 transition count 367
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1655 place count 131 transition count 350
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1664 place count 122 transition count 332
Iterating global reduction 10 with 9 rules applied. Total rules applied 1673 place count 122 transition count 332
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1678 place count 122 transition count 327
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 11 with 39 rules applied. Total rules applied 1717 place count 122 transition count 288
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1720 place count 122 transition count 288
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1721 place count 122 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1722 place count 121 transition count 286
Applied a total of 1722 rules in 146 ms. Remains 121 /1554 variables (removed 1433) and now considering 286/1988 (removed 1702) transitions.
[2024-05-21 16:10:18] [INFO ] Flow matrix only has 228 transitions (discarded 58 similar events)
// Phase 1: matrix 228 rows 121 cols
[2024-05-21 16:10:18] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 16:10:18] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 16:10:18] [INFO ] Flow matrix only has 228 transitions (discarded 58 similar events)
[2024-05-21 16:10:18] [INFO ] Invariant cache hit.
[2024-05-21 16:10:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:10:18] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 261 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1554 places, 286/1988 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 119 transition count 285
Applied a total of 2 rules in 15 ms. Remains 119 /120 variables (removed 1) and now considering 285/286 (removed 1) transitions.
[2024-05-21 16:10:18] [INFO ] Flow matrix only has 227 transitions (discarded 58 similar events)
// Phase 1: matrix 227 rows 119 cols
[2024-05-21 16:10:18] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 16:10:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 16:10:18] [INFO ] Flow matrix only has 227 transitions (discarded 58 similar events)
[2024-05-21 16:10:18] [INFO ] Invariant cache hit.
[2024-05-21 16:10:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:10:19] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1554 places, 285/1988 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 775 ms. Remains : 119/1554 places, 285/1988 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s106 1)), p1:(OR (EQ s71 0) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 58 steps with 4 reset in 1 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-05 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(p0)))||G(p1))))'
Support contains 2 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1534 transition count 1966
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1534 transition count 1966
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1534 transition count 1964
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 1523 transition count 1953
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 1523 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 1523 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 1519 transition count 1948
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 1519 transition count 1948
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 1519 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 1517 transition count 1944
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 1517 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 1515 transition count 1941
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 1515 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 1513 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 1511 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 1510 transition count 1934
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 1509 transition count 1933
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 1508 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 1508 transition count 1932
Applied a total of 98 rules in 598 ms. Remains 1508 /1554 variables (removed 46) and now considering 1932/1988 (removed 56) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-21 16:10:19] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 16:10:20] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 16:10:20] [INFO ] Invariant cache hit.
[2024-05-21 16:10:21] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2024-05-21 16:10:21] [INFO ] Invariant cache hit.
[2024-05-21 16:10:21] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1554 places, 1932/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2466 ms. Remains : 1508/1554 places, 1932/1988 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1313 0) (EQ s1492 1)), p0:(OR (EQ s1492 0) (EQ s1313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25050 reset in 670 ms.
Stack based approach found an accepted trace after 67929 steps with 17000 reset with depth 55 and stack size 55 in 414 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-07 finished in 3709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1537 transition count 1969
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1537 transition count 1969
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1537 transition count 1967
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 1527 transition count 1957
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 1527 transition count 1957
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 1527 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 1524 transition count 1953
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 1524 transition count 1953
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 1524 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1522 transition count 1950
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1522 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1520 transition count 1947
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1520 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 1518 transition count 1944
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 1516 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 1515 transition count 1940
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 1514 transition count 1939
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 1513 transition count 1938
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 1513 transition count 1938
Applied a total of 87 rules in 524 ms. Remains 1513 /1554 variables (removed 41) and now considering 1938/1988 (removed 50) transitions.
// Phase 1: matrix 1938 rows 1513 cols
[2024-05-21 16:10:23] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 16:10:23] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 16:10:23] [INFO ] Invariant cache hit.
[2024-05-21 16:10:24] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2024-05-21 16:10:24] [INFO ] Invariant cache hit.
[2024-05-21 16:10:25] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1554 places, 1938/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 1513/1554 places, 1938/1988 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s338 0) (EQ s665 1)), p1:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-09 finished in 2356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Graph (trivial) has 1891 edges and 1554 vertex of which 680 / 1554 are part of one of the 62 SCC in 2 ms
Free SCC test removed 618 places
Ensure Unique test removed 714 transitions
Reduce isomorphic transitions removed 714 transitions.
Graph (complete) has 1452 edges and 936 vertex of which 927 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 515 transitions
Trivial Post-agglo rules discarded 515 transitions
Performed 515 trivial Post agglomeration. Transition count delta: 515
Iterating post reduction 0 with 515 rules applied. Total rules applied 517 place count 926 transition count 753
Reduce places removed 515 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 543 rules applied. Total rules applied 1060 place count 411 transition count 725
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1075 place count 398 transition count 723
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1078 place count 397 transition count 721
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1082 place count 396 transition count 718
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1086 place count 394 transition count 716
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1089 place count 392 transition count 715
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 45 Pre rules applied. Total rules applied 1089 place count 392 transition count 670
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 1179 place count 347 transition count 670
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1198 place count 328 transition count 641
Iterating global reduction 7 with 19 rules applied. Total rules applied 1217 place count 328 transition count 641
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1219 place count 328 transition count 639
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1221 place count 326 transition count 639
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 1221 place count 326 transition count 637
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1225 place count 324 transition count 637
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1234 place count 315 transition count 625
Iterating global reduction 9 with 9 rules applied. Total rules applied 1243 place count 315 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1249 place count 315 transition count 619
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1250 place count 314 transition count 617
Iterating global reduction 10 with 1 rules applied. Total rules applied 1251 place count 314 transition count 617
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1252 place count 313 transition count 615
Iterating global reduction 10 with 1 rules applied. Total rules applied 1253 place count 313 transition count 615
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1254 place count 312 transition count 613
Iterating global reduction 10 with 1 rules applied. Total rules applied 1255 place count 312 transition count 613
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1256 place count 311 transition count 611
Iterating global reduction 10 with 1 rules applied. Total rules applied 1257 place count 311 transition count 611
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1258 place count 310 transition count 609
Iterating global reduction 10 with 1 rules applied. Total rules applied 1259 place count 310 transition count 609
Performed 142 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 10 with 284 rules applied. Total rules applied 1543 place count 168 transition count 383
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1559 place count 168 transition count 367
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1564 place count 163 transition count 357
Iterating global reduction 11 with 5 rules applied. Total rules applied 1569 place count 163 transition count 357
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 11 with 26 rules applied. Total rules applied 1595 place count 150 transition count 342
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1608 place count 150 transition count 329
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1609 place count 149 transition count 327
Iterating global reduction 12 with 1 rules applied. Total rules applied 1610 place count 149 transition count 327
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 1648 place count 130 transition count 376
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 1670 place count 130 transition count 354
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1679 place count 121 transition count 336
Iterating global reduction 13 with 9 rules applied. Total rules applied 1688 place count 121 transition count 336
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1694 place count 121 transition count 330
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 14 with 41 rules applied. Total rules applied 1735 place count 121 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1736 place count 120 transition count 288
Applied a total of 1736 rules in 89 ms. Remains 120 /1554 variables (removed 1434) and now considering 288/1988 (removed 1700) transitions.
[2024-05-21 16:10:25] [INFO ] Flow matrix only has 228 transitions (discarded 60 similar events)
// Phase 1: matrix 228 rows 120 cols
[2024-05-21 16:10:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 16:10:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 16:10:25] [INFO ] Flow matrix only has 228 transitions (discarded 60 similar events)
[2024-05-21 16:10:25] [INFO ] Invariant cache hit.
[2024-05-21 16:10:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:10:25] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1554 places, 288/1988 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 118 transition count 287
Applied a total of 2 rules in 6 ms. Remains 118 /119 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2024-05-21 16:10:25] [INFO ] Flow matrix only has 227 transitions (discarded 60 similar events)
// Phase 1: matrix 227 rows 118 cols
[2024-05-21 16:10:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:10:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 16:10:25] [INFO ] Flow matrix only has 227 transitions (discarded 60 similar events)
[2024-05-21 16:10:25] [INFO ] Invariant cache hit.
[2024-05-21 16:10:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:10:25] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1554 places, 287/1988 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 118/1554 places, 287/1988 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s7 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 19707 steps with 2592 reset in 41 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-11 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||G(p2)))))'
Support contains 5 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1537 transition count 1970
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1537 transition count 1970
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1537 transition count 1968
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 1528 transition count 1959
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 1528 transition count 1959
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 1528 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 1525 transition count 1955
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 1525 transition count 1955
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 1525 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1524 transition count 1952
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1524 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1523 transition count 1951
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1523 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 1522 transition count 1950
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1522 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 1521 transition count 1949
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 1521 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1520 transition count 1948
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1520 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 1519 transition count 1947
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1519 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 1518 transition count 1946
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 1518 transition count 1946
Applied a total of 77 rules in 532 ms. Remains 1518 /1554 variables (removed 36) and now considering 1946/1988 (removed 42) transitions.
// Phase 1: matrix 1946 rows 1518 cols
[2024-05-21 16:10:26] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 16:10:26] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 16:10:26] [INFO ] Invariant cache hit.
[2024-05-21 16:10:27] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-05-21 16:10:27] [INFO ] Invariant cache hit.
[2024-05-21 16:10:28] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1518/1554 places, 1946/1988 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2354 ms. Remains : 1518/1554 places, 1946/1988 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s888 0) (EQ s639 1)), p1:(EQ s993 1), p2:(AND (NOT (OR (EQ s888 0) (EQ s639 1))) (NOT (OR (EQ s1213 0) (EQ s906 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-12 finished in 2593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0)||X(X(X(!p1)))) U (G((F(p0)||X(X(X(!p1)))))||((F(p0)||X(X(X(!p1))))&&G(p2))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-317-LTLCardinality-04
Stuttering acceptance computed with spot in 710 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 1554 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1554/1554 places, 1988/1988 transitions.
Graph (trivial) has 1891 edges and 1554 vertex of which 701 / 1554 are part of one of the 63 SCC in 2 ms
Free SCC test removed 638 places
Ensure Unique test removed 742 transitions
Reduce isomorphic transitions removed 742 transitions.
Graph (complete) has 1424 edges and 916 vertex of which 907 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 906 transition count 738
Reduce places removed 502 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 526 rules applied. Total rules applied 1030 place count 404 transition count 714
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1042 place count 392 transition count 714
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1042 place count 392 transition count 670
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1130 place count 348 transition count 670
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1149 place count 329 transition count 640
Iterating global reduction 3 with 19 rules applied. Total rules applied 1168 place count 329 transition count 640
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 1170 place count 329 transition count 638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1172 place count 327 transition count 638
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1172 place count 327 transition count 637
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1174 place count 326 transition count 637
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1184 place count 316 transition count 623
Iterating global reduction 5 with 10 rules applied. Total rules applied 1194 place count 316 transition count 623
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1200 place count 316 transition count 617
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1202 place count 314 transition count 613
Iterating global reduction 6 with 2 rules applied. Total rules applied 1204 place count 314 transition count 613
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1206 place count 312 transition count 609
Iterating global reduction 6 with 2 rules applied. Total rules applied 1208 place count 312 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1209 place count 311 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 1210 place count 311 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1211 place count 310 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 1212 place count 310 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1213 place count 309 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 1214 place count 309 transition count 603
Performed 141 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 6 with 282 rules applied. Total rules applied 1496 place count 168 transition count 380
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1512 place count 168 transition count 364
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1517 place count 163 transition count 354
Iterating global reduction 7 with 5 rules applied. Total rules applied 1522 place count 163 transition count 354
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1548 place count 150 transition count 339
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1561 place count 150 transition count 326
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1562 place count 149 transition count 324
Iterating global reduction 8 with 1 rules applied. Total rules applied 1563 place count 149 transition count 324
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1597 place count 132 transition count 374
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1618 place count 132 transition count 353
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1627 place count 123 transition count 335
Iterating global reduction 9 with 9 rules applied. Total rules applied 1636 place count 123 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1642 place count 123 transition count 329
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1643 place count 123 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1644 place count 123 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1645 place count 122 transition count 327
Applied a total of 1645 rules in 82 ms. Remains 122 /1554 variables (removed 1432) and now considering 327/1988 (removed 1661) transitions.
[2024-05-21 16:10:29] [INFO ] Flow matrix only has 268 transitions (discarded 59 similar events)
// Phase 1: matrix 268 rows 122 cols
[2024-05-21 16:10:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 16:10:29] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 16:10:29] [INFO ] Flow matrix only has 268 transitions (discarded 59 similar events)
[2024-05-21 16:10:29] [INFO ] Invariant cache hit.
[2024-05-21 16:10:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 16:10:29] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-21 16:10:29] [INFO ] Flow matrix only has 268 transitions (discarded 59 similar events)
[2024-05-21 16:10:29] [INFO ] Invariant cache hit.
[2024-05-21 16:10:29] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 122/1554 places, 327/1988 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 588 ms. Remains : 122/1554 places, 327/1988 transitions.
Running random walk in product with property : CloudReconfiguration-PT-317-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 10}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={1} source=5 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={1} source=6 dest: 14}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=7 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=8 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=9 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=9 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=9 dest: 12}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=9 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=10 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=11 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=11 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=12 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=12 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=12 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=13 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=13 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=13 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=13 dest: 14}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=14 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=14 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=14 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={1} source=14 dest: 17}], [{ cond=(NOT p0), acceptance={0, 1} source=15 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=15 dest: 15}, { cond=(AND p2 (NOT p0)), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=16 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=16 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=16 dest: 15}, { cond=(AND p2 (NOT p0)), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=17 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=17 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=17 dest: 9}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=17 dest: 17}]], initial=0, aps=[p2:(NEQ s44 1), p0:(AND (OR (EQ s11 0) (EQ s1 1)) (EQ s44 1)), p1:(OR (EQ s11 0) (EQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
Treatment of property CloudReconfiguration-PT-317-LTLCardinality-04 finished in 1467 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 16:10:29] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15377730126027358863
[2024-05-21 16:10:29] [INFO ] Too many transitions (1988) to apply POR reductions. Disabling POR matrices.
[2024-05-21 16:10:29] [INFO ] Applying decomposition
[2024-05-21 16:10:29] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15377730126027358863
Running compilation step : cd /tmp/ltsmin15377730126027358863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 16:10:30] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13698392525587535605.txt' '-o' '/tmp/graph13698392525587535605.bin' '-w' '/tmp/graph13698392525587535605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13698392525587535605.bin' '-l' '-1' '-v' '-w' '/tmp/graph13698392525587535605.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:10:30] [INFO ] Decomposing Gal with order
[2024-05-21 16:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:10:30] [INFO ] Removed a total of 507 redundant transitions.
[2024-05-21 16:10:30] [INFO ] Flatten gal took : 145 ms
[2024-05-21 16:10:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 31 ms.
[2024-05-21 16:10:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality18307522692089210752.gal : 14 ms
[2024-05-21 16:10:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality4544023359834833675.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18307522692089210752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4544023359834833675.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((F("(((i4.i1.i0.u76.p364==0)||(i3.i0.i4.u117.p12==1))&&(i15.i0.i4.u239.p986==1))"))||(X(X(X(!("((i4.i1.i0.u76.p364==0)||(i3.i0.i...525
Formula 0 simplified : G(F!"(i15.i0.i4.u239.p986!=1)" U (G!"(((i4.i1.i0.u76.p364==0)||(i3.i0.i4.u117.p12==1))&&(i15.i0.i4.u239.p986==1))" & XXX"((i4.i1.i0....195
Compilation finished in 3684 ms.
Running link step : cd /tmp/ltsmin15377730126027358863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15377730126027358863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((<>((LTLAPp0==true))||X(X(X(!(LTLAPp1==true))))) U ([]((<>((LTLAPp0==true))||X(X(X(!(LTLAPp1==true))))))||((<>((LTLAPp0==true))||X(X(X(!(LTLAPp1==true)))))&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t132, t183, t235, t264, t295, t324, t344, t374, t584, t585, t689, t712, t741, t772, t820, t85...2508
Computing Next relation with stutter on 109364 deadlock states
LTSmin run took 236128 ms.
FORMULA CloudReconfiguration-PT-317-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 388662 ms.

BK_STOP 1716308071008

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudReconfiguration-PT-317, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208000152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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