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.r400-tall-171690532200363.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 itstools
Input is StigmergyElection-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17M May 18 16:43 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 StigmergyElection-PT-09a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717013918218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 20:18:39] [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-29 20:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:18:40] [INFO ] Load time of PNML (sax parser for PT used): 859 ms
[2024-05-29 20:18:40] [INFO ] Transformed 128 places.
[2024-05-29 20:18:40] [INFO ] Transformed 18490 transitions.
[2024-05-29 20:18:40] [INFO ] Found NUPN structural information;
[2024-05-29 20:18:40] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1078 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyElection-PT-09a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 119 transition count 1181
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 119 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 118 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 118 transition count 1179
Applied a total of 20 rules in 42 ms. Remains 118 /128 variables (removed 10) and now considering 1179/1195 (removed 16) transitions.
[2024-05-29 20:18:40] [INFO ] Flow matrix only has 1161 transitions (discarded 18 similar events)
// Phase 1: matrix 1161 rows 118 cols
[2024-05-29 20:18:40] [INFO ] Computed 6 invariants in 31 ms
[2024-05-29 20:18:41] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-29 20:18:41] [INFO ] Flow matrix only has 1161 transitions (discarded 18 similar events)
[2024-05-29 20:18:41] [INFO ] Invariant cache hit.
[2024-05-29 20:18:41] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:18:42] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
Running 1178 sub problems to find dead transitions.
[2024-05-29 20:18:42] [INFO ] Flow matrix only has 1161 transitions (discarded 18 similar events)
[2024-05-29 20:18:42] [INFO ] Invariant cache hit.
[2024-05-29 20:18:42] [INFO ] State equation strengthened by 1066 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 11 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 2 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 0 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 2 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-29 20:19:05] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2024-05-29 20:19:06] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:19:06] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:19:06] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:19:06] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:19:06] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:07] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:19:07] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2024-05-29 20:19:07] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:19:07] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:19:07] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:19:07] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:19:08] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:19:08] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:19:08] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:19:08] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:19:08] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:19:09] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:19:09] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:19:09] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:19:09] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 4 ms to minimize.
[2024-05-29 20:19:09] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:19:09] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:13] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:19:13] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:19:13] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:19:13] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 5 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2024-05-29 20:19:18] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:19:19] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2024-05-29 20:19:19] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:19] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:19:19] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:19:19] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2024-05-29 20:19:20] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:19:25] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:19:26] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:19:27] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 118/1279 variables, and 126 constraints, problems are : Problem set: 0 solved, 1178 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1066 constraints, PredecessorRefiner: 1178/146 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 120/126 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:19:31] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:19:31] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:19:31] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:19:31] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:19:31] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:19:33] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:35] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:19:36] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:19:36] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:19:36] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:19:36] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:19:37] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:19:38] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:41] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:19:41] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-29 20:19:42] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:19:42] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:19:42] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
[2024-05-29 20:19:51] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:19:51] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:19:52] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:19:52] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 118/1279 variables, and 175 constraints, problems are : Problem set: 0 solved, 1178 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1066 constraints, PredecessorRefiner: 1032/146 constraints, Known Traps: 169/169 constraints]
After SMT, in 74754ms problems are : Problem set: 0 solved, 1178 unsolved
Search for dead transitions found 0 dead transitions in 74785ms
Starting structural reductions in LTL mode, iteration 1 : 118/128 places, 1179/1195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76456 ms. Remains : 118/128 places, 1179/1195 transitions.
Support contains 37 out of 118 places after structural reductions.
[2024-05-29 20:19:57] [INFO ] Flatten gal took : 187 ms
[2024-05-29 20:19:57] [INFO ] Flatten gal took : 103 ms
[2024-05-29 20:19:57] [INFO ] Input system was already deterministic with 1179 transitions.
Support contains 35 out of 118 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (19 resets) in 3493 ms. (11 steps per ms) remains 0/21 properties
FORMULA StigmergyElection-PT-09a-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-09a-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 116 transition count 1145
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 83 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 82 transition count 1144
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 69 place count 82 transition count 1129
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 99 place count 67 transition count 1129
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 110 place count 56 transition count 1110
Iterating global reduction 3 with 11 rules applied. Total rules applied 121 place count 56 transition count 1110
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 152 place count 56 transition count 1079
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 152 place count 56 transition count 1078
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 55 transition count 1078
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 158 place count 51 transition count 1070
Iterating global reduction 4 with 4 rules applied. Total rules applied 162 place count 51 transition count 1070
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 4 with 224 rules applied. Total rules applied 386 place count 51 transition count 846
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 400 place count 44 transition count 839
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 407 place count 44 transition count 832
Drop transitions (Redundant composition of simpler transitions.) removed 761 transitions
Redundant transition composition rules discarded 761 transitions
Iterating global reduction 6 with 761 rules applied. Total rules applied 1168 place count 44 transition count 71
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1186 place count 35 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1187 place count 35 transition count 62
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 1196 place count 26 transition count 53
Applied a total of 1196 rules in 241 ms. Remains 26 /118 variables (removed 92) and now considering 53/1179 (removed 1126) transitions.
[2024-05-29 20:19:59] [INFO ] Flow matrix only has 41 transitions (discarded 12 similar events)
// Phase 1: matrix 41 rows 26 cols
[2024-05-29 20:19:59] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 20:19:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 20:19:59] [INFO ] Flow matrix only has 41 transitions (discarded 12 similar events)
[2024-05-29 20:19:59] [INFO ] Invariant cache hit.
[2024-05-29 20:19:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 20:19:59] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-29 20:19:59] [INFO ] Flow matrix only has 41 transitions (discarded 12 similar events)
[2024-05-29 20:19:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 9/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:19:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 40/66 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/66 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/67 variables, and 91 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2380 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 9/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 20:20:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 40/66 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 27/126 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 126 constraints, problems are : Problem set: 0 solved, 27 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 70/70 constraints]
After SMT, in 3227ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 3228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/118 places, 53/1179 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3550 ms. Remains : 26/118 places, 53/1179 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-05
Product exploration explored 100000 steps with 1 reset in 173 ms.
Product exploration explored 100000 steps with 3 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (AND (NOT p1) p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-09a-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-09a-LTLCardinality-05 finished in 4189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(p1)||G(p0))))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 108 transition count 1161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 108 transition count 1161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 104 transition count 1153
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 104 transition count 1153
Applied a total of 28 rules in 20 ms. Remains 104 /118 variables (removed 14) and now considering 1153/1179 (removed 26) transitions.
[2024-05-29 20:20:03] [INFO ] Flow matrix only has 1141 transitions (discarded 12 similar events)
// Phase 1: matrix 1141 rows 104 cols
[2024-05-29 20:20:03] [INFO ] Computed 4 invariants in 10 ms
[2024-05-29 20:20:03] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-29 20:20:03] [INFO ] Flow matrix only has 1141 transitions (discarded 12 similar events)
[2024-05-29 20:20:03] [INFO ] Invariant cache hit.
[2024-05-29 20:20:03] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:20:05] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1661 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/118 places, 1153/1179 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 86 transition count 1136
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 86 transition count 1136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 78 transition count 1128
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 78 transition count 1128
Applied a total of 50 rules in 21 ms. Remains 78 /103 variables (removed 25) and now considering 1128/1153 (removed 25) transitions.
[2024-05-29 20:20:05] [INFO ] Flow matrix only has 1116 transitions (discarded 12 similar events)
// Phase 1: matrix 1116 rows 78 cols
[2024-05-29 20:20:05] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 20:20:05] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-29 20:20:05] [INFO ] Flow matrix only has 1116 transitions (discarded 12 similar events)
[2024-05-29 20:20:05] [INFO ] Invariant cache hit.
[2024-05-29 20:20:05] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:05] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 78/118 places, 1128/1179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2614 ms. Remains : 78/118 places, 1128/1179 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-09a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09a-LTLCardinality-06 finished in 2876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((G(F(p0)) U p0)) U p0))))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 107 transition count 1161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 107 transition count 1161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 105 transition count 1157
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 105 transition count 1157
Applied a total of 26 rules in 12 ms. Remains 105 /118 variables (removed 13) and now considering 1157/1179 (removed 22) transitions.
[2024-05-29 20:20:06] [INFO ] Flow matrix only has 1146 transitions (discarded 11 similar events)
// Phase 1: matrix 1146 rows 105 cols
[2024-05-29 20:20:06] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:20:06] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-29 20:20:06] [INFO ] Flow matrix only has 1146 transitions (discarded 11 similar events)
[2024-05-29 20:20:06] [INFO ] Invariant cache hit.
[2024-05-29 20:20:06] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:20:08] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2095 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/118 places, 1157/1179 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 88 transition count 1141
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 88 transition count 1141
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 79 transition count 1132
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 79 transition count 1132
Applied a total of 50 rules in 16 ms. Remains 79 /104 variables (removed 25) and now considering 1132/1157 (removed 25) transitions.
[2024-05-29 20:20:08] [INFO ] Flow matrix only has 1121 transitions (discarded 11 similar events)
// Phase 1: matrix 1121 rows 79 cols
[2024-05-29 20:20:08] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 20:20:08] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-29 20:20:08] [INFO ] Flow matrix only has 1121 transitions (discarded 11 similar events)
[2024-05-29 20:20:08] [INFO ] Invariant cache hit.
[2024-05-29 20:20:08] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:09] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 79/118 places, 1132/1179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3016 ms. Remains : 79/118 places, 1132/1179 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 187 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 7 states, 11 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-09a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-09a-LTLCardinality-07 finished in 3809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 6 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 107 transition count 1161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 107 transition count 1161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 105 transition count 1157
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 105 transition count 1157
Applied a total of 26 rules in 10 ms. Remains 105 /118 variables (removed 13) and now considering 1157/1179 (removed 22) transitions.
[2024-05-29 20:20:10] [INFO ] Flow matrix only has 1146 transitions (discarded 11 similar events)
// Phase 1: matrix 1146 rows 105 cols
[2024-05-29 20:20:10] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:20:10] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-29 20:20:10] [INFO ] Flow matrix only has 1146 transitions (discarded 11 similar events)
[2024-05-29 20:20:10] [INFO ] Invariant cache hit.
[2024-05-29 20:20:10] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:20:12] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2851 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/118 places, 1157/1179 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 90 transition count 1143
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 90 transition count 1143
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 82 transition count 1135
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 82 transition count 1135
Applied a total of 44 rules in 13 ms. Remains 82 /104 variables (removed 22) and now considering 1135/1157 (removed 22) transitions.
[2024-05-29 20:20:12] [INFO ] Flow matrix only has 1124 transitions (discarded 11 similar events)
// Phase 1: matrix 1124 rows 82 cols
[2024-05-29 20:20:12] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 20:20:13] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-29 20:20:13] [INFO ] Flow matrix only has 1124 transitions (discarded 11 similar events)
[2024-05-29 20:20:13] [INFO ] Invariant cache hit.
[2024-05-29 20:20:13] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:13] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/118 places, 1135/1179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3695 ms. Remains : 82/118 places, 1135/1179 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 440 steps with 0 reset in 13 ms.
FORMULA StigmergyElection-PT-09a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09a-LTLCardinality-08 finished in 3858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 116 transition count 1147
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 85 transition count 1145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 83 transition count 1145
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 67 place count 83 transition count 1129
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 99 place count 67 transition count 1129
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 112 place count 54 transition count 1109
Iterating global reduction 3 with 13 rules applied. Total rules applied 125 place count 54 transition count 1109
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 140 place count 54 transition count 1094
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 54 transition count 1093
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 53 transition count 1093
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 49 transition count 1085
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 49 transition count 1085
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 262 place count 49 transition count 973
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 278 place count 41 transition count 965
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 285 place count 41 transition count 958
Drop transitions (Redundant composition of simpler transitions.) removed 874 transitions
Redundant transition composition rules discarded 874 transitions
Iterating global reduction 6 with 874 rules applied. Total rules applied 1159 place count 41 transition count 84
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1177 place count 32 transition count 75
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1185 place count 24 transition count 67
Applied a total of 1185 rules in 464 ms. Remains 24 /118 variables (removed 94) and now considering 67/1179 (removed 1112) transitions.
[2024-05-29 20:20:14] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
// Phase 1: matrix 58 rows 24 cols
[2024-05-29 20:20:14] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 20:20:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 20:20:14] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-29 20:20:14] [INFO ] Invariant cache hit.
[2024-05-29 20:20:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-29 20:20:14] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-29 20:20:14] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-29 20:20:14] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-29 20:20:14] [INFO ] Invariant cache hit.
[2024-05-29 20:20:14] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:20:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:20:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 3 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 57/81 variables, 24/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 24/99 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 1/82 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:20:17] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 57/81 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 66/184 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 1/82 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 185 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 69/69 constraints]
After SMT, in 5676ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/118 places, 67/1179 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6297 ms. Remains : 24/118 places, 67/1179 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 159 ms.
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-09a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09a-LTLCardinality-09 finished in 6585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 108 transition count 1163
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 108 transition count 1163
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 105 transition count 1157
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 105 transition count 1157
Applied a total of 26 rules in 13 ms. Remains 105 /118 variables (removed 13) and now considering 1157/1179 (removed 22) transitions.
[2024-05-29 20:20:20] [INFO ] Flow matrix only has 1146 transitions (discarded 11 similar events)
// Phase 1: matrix 1146 rows 105 cols
[2024-05-29 20:20:20] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:20:20] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-29 20:20:20] [INFO ] Flow matrix only has 1146 transitions (discarded 11 similar events)
[2024-05-29 20:20:20] [INFO ] Invariant cache hit.
[2024-05-29 20:20:21] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:20:22] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1757 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/118 places, 1157/1179 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 88 transition count 1141
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 88 transition count 1141
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 80 transition count 1133
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 80 transition count 1133
Applied a total of 48 rules in 14 ms. Remains 80 /104 variables (removed 24) and now considering 1133/1157 (removed 24) transitions.
[2024-05-29 20:20:22] [INFO ] Flow matrix only has 1122 transitions (discarded 11 similar events)
// Phase 1: matrix 1122 rows 80 cols
[2024-05-29 20:20:22] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 20:20:22] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-29 20:20:22] [INFO ] Flow matrix only has 1122 transitions (discarded 11 similar events)
[2024-05-29 20:20:22] [INFO ] Invariant cache hit.
[2024-05-29 20:20:22] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:23] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 80/118 places, 1133/1179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2678 ms. Remains : 80/118 places, 1133/1179 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-09a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-09a-LTLCardinality-10 finished in 3153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 106 transition count 1159
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 106 transition count 1159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 102 transition count 1151
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 102 transition count 1151
Applied a total of 32 rules in 15 ms. Remains 102 /118 variables (removed 16) and now considering 1151/1179 (removed 28) transitions.
[2024-05-29 20:20:23] [INFO ] Flow matrix only has 1141 transitions (discarded 10 similar events)
// Phase 1: matrix 1141 rows 102 cols
[2024-05-29 20:20:23] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:20:23] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-29 20:20:23] [INFO ] Flow matrix only has 1141 transitions (discarded 10 similar events)
[2024-05-29 20:20:23] [INFO ] Invariant cache hit.
[2024-05-29 20:20:24] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:20:25] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/118 places, 1151/1179 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 85 transition count 1135
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 85 transition count 1135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 76 transition count 1126
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 76 transition count 1126
Applied a total of 50 rules in 16 ms. Remains 76 /101 variables (removed 25) and now considering 1126/1151 (removed 25) transitions.
[2024-05-29 20:20:25] [INFO ] Flow matrix only has 1116 transitions (discarded 10 similar events)
// Phase 1: matrix 1116 rows 76 cols
[2024-05-29 20:20:25] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 20:20:26] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-29 20:20:26] [INFO ] Flow matrix only has 1116 transitions (discarded 10 similar events)
[2024-05-29 20:20:26] [INFO ] Invariant cache hit.
[2024-05-29 20:20:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:26] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/118 places, 1126/1179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3183 ms. Remains : 76/118 places, 1126/1179 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 191 steps with 0 reset in 6 ms.
FORMULA StigmergyElection-PT-09a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09a-LTLCardinality-11 finished in 3333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F((!p1 U (p2||G(!p1)))))))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 116 transition count 1144
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 82 transition count 1144
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 69 place count 82 transition count 1130
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 97 place count 68 transition count 1130
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 55 transition count 1109
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 55 transition count 1109
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 138 place count 55 transition count 1094
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 55 transition count 1093
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 54 transition count 1093
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 144 place count 50 transition count 1085
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 50 transition count 1085
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 260 place count 50 transition count 973
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 278 place count 41 transition count 964
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 287 place count 41 transition count 955
Drop transitions (Redundant composition of simpler transitions.) removed 881 transitions
Redundant transition composition rules discarded 881 transitions
Iterating global reduction 5 with 881 rules applied. Total rules applied 1168 place count 41 transition count 74
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1186 place count 32 transition count 65
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1194 place count 24 transition count 57
Applied a total of 1194 rules in 119 ms. Remains 24 /118 variables (removed 94) and now considering 57/1179 (removed 1122) transitions.
[2024-05-29 20:20:27] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 24 cols
[2024-05-29 20:20:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 20:20:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 20:20:27] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-29 20:20:27] [INFO ] Invariant cache hit.
[2024-05-29 20:20:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-29 20:20:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-29 20:20:27] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-29 20:20:27] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-29 20:20:27] [INFO ] Invariant cache hit.
[2024-05-29 20:20:27] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:20:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/24 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (OVERLAPS) 47/71 variables, 24/99 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 15 (OVERLAPS) 1/72 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 120 constraints, problems are : Problem set: 0 solved, 56 unsolved in 3084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 20:20:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 47/71 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 1/72 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (OVERLAPS) 0/72 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 177 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 75/75 constraints]
After SMT, in 4995ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 4996ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/118 places, 57/1179 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5191 ms. Remains : 24/118 places, 57/1179 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-13
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-09a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09a-LTLCardinality-13 finished in 5298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 1179/1179 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 107 transition count 1161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 107 transition count 1161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 103 transition count 1153
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 103 transition count 1153
Applied a total of 30 rules in 13 ms. Remains 103 /118 variables (removed 15) and now considering 1153/1179 (removed 26) transitions.
[2024-05-29 20:20:32] [INFO ] Flow matrix only has 1143 transitions (discarded 10 similar events)
// Phase 1: matrix 1143 rows 103 cols
[2024-05-29 20:20:32] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 20:20:32] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-29 20:20:32] [INFO ] Flow matrix only has 1143 transitions (discarded 10 similar events)
[2024-05-29 20:20:32] [INFO ] Invariant cache hit.
[2024-05-29 20:20:32] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:20:34] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1935 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/118 places, 1153/1179 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 87 transition count 1138
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 87 transition count 1138
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 79 transition count 1130
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 79 transition count 1130
Applied a total of 46 rules in 13 ms. Remains 79 /102 variables (removed 23) and now considering 1130/1153 (removed 23) transitions.
[2024-05-29 20:20:34] [INFO ] Flow matrix only has 1120 transitions (discarded 10 similar events)
// Phase 1: matrix 1120 rows 79 cols
[2024-05-29 20:20:34] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 20:20:34] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 20:20:34] [INFO ] Flow matrix only has 1120 transitions (discarded 10 similar events)
[2024-05-29 20:20:34] [INFO ] Invariant cache hit.
[2024-05-29 20:20:34] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:35] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 79/118 places, 1130/1179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2814 ms. Remains : 79/118 places, 1130/1179 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-09a-LTLCardinality-14
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-09a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09a-LTLCardinality-14 finished in 2938 ms.
All properties solved by simple procedures.
Total runtime 115854 ms.

BK_STOP 1717014035251

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyElection-PT-09a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-09a, 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 r400-tall-171690532200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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