About the Execution of ITS-Tools for StigmergyCommit-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12728.123 | 843808.00 | 974762.00 | 2090.40 | TFTTTTFTFFFFTFFF | normal |
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-171690531800188.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 StigmergyCommit-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 StigmergyCommit-PT-08a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-08a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716992276319
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 14:17:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:17:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:17:58] [INFO ] Load time of PNML (sax parser for PT used): 878 ms
[2024-05-29 14:17:58] [INFO ] Transformed 328 places.
[2024-05-29 14:17:58] [INFO ] Transformed 18744 transitions.
[2024-05-29 14:17:58] [INFO ] Found NUPN structural information;
[2024-05-29 14:17:58] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyCommit-PT-08a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 256 transition count 1368
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 256 transition count 1368
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 153 place count 256 transition count 1359
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 190 place count 219 transition count 1313
Iterating global reduction 1 with 37 rules applied. Total rules applied 227 place count 219 transition count 1313
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 236 place count 219 transition count 1304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 245 place count 210 transition count 1295
Iterating global reduction 2 with 9 rules applied. Total rules applied 254 place count 210 transition count 1295
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 263 place count 201 transition count 1286
Iterating global reduction 2 with 9 rules applied. Total rules applied 272 place count 201 transition count 1286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 281 place count 192 transition count 1277
Iterating global reduction 2 with 9 rules applied. Total rules applied 290 place count 192 transition count 1277
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 299 place count 183 transition count 1268
Iterating global reduction 2 with 9 rules applied. Total rules applied 308 place count 183 transition count 1268
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 317 place count 183 transition count 1259
Applied a total of 317 rules in 203 ms. Remains 183 /328 variables (removed 145) and now considering 1259/1449 (removed 190) transitions.
[2024-05-29 14:17:59] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:17:59] [INFO ] Computed 2 invariants in 45 ms
[2024-05-29 14:17:59] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 14:17:59] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:17:59] [INFO ] Invariant cache hit.
[2024-05-29 14:17:59] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3517 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/328 places, 1259/1449 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 50 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:18:02] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:18:02] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 14:18:02] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:18:02] [INFO ] Invariant cache hit.
[2024-05-29 14:18:02] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/328 places, 1180/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4170 ms. Remains : 112/328 places, 1180/1449 transitions.
Support contains 9 out of 112 places after structural reductions.
[2024-05-29 14:18:03] [INFO ] Flatten gal took : 289 ms
[2024-05-29 14:18:03] [INFO ] Flatten gal took : 163 ms
[2024-05-29 14:18:04] [INFO ] Input system was already deterministic with 1180 transitions.
Reduction of identical properties reduced properties to check from 10 to 4
RANDOM walk for 40000 steps (9 resets) in 4793 ms. (8 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2024-05-29 14:18:05] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:18:05] [INFO ] Invariant cache hit.
[2024-05-29 14:18:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/112 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1169/1281 variables, 112/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 1029/1142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 0/1142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1282 variables, 1/1143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1282 variables, 0/1143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1282 variables, 0/1143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1282/1282 variables, and 1143 constraints, problems are : Problem set: 1 solved, 1 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 112/1282 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1127ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyCommit-PT-08a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 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' '!(X(F((G(p1)||G(p2)||p0))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:18:07] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:18:07] [INFO ] Invariant cache hit.
[2024-05-29 14:18:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 14:18:07] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:18:07] [INFO ] Invariant cache hit.
[2024-05-29 14:18:07] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:18:07] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:18:07] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:18:07] [INFO ] Invariant cache hit.
[2024-05-29 14:18:07] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:18:30] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 9 ms to minimize.
[2024-05-29 14:18:31] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 3 ms to minimize.
[2024-05-29 14:18:31] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:18:31] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 2 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:18:32] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 2 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 0 ms to minimize.
[2024-05-29 14:18:33] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2024-05-29 14:18:34] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 4 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 0 ms to minimize.
[2024-05-29 14:18:35] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 0 ms to minimize.
[2024-05-29 14:18:36] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 3 ms to minimize.
[2024-05-29 14:18:36] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:18:36] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:18:36] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 14:18:37] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2024-05-29 14:18:37] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2024-05-29 14:18:37] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:18:37] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:18:37] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:18:38] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 14:18:38] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 2 ms to minimize.
[2024-05-29 14:18:38] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:18:38] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 2 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 4 ms to minimize.
[2024-05-29 14:18:39] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:18:40] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2024-05-29 14:18:40] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:18:40] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:18:40] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:18:43] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:18:44] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 2 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:18:45] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:18:46] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:18:47] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:18:47] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:18:47] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:18:47] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:18:47] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:18:47] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:18:48] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:18:49] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:18:50] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:18:50] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:18:50] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:18:50] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:18:50] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:18:51] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:18:51] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:18:51] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1282 variables, and 89 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1179/147 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:18:58] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:18:58] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:18:58] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:18:58] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:18:58] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:18:59] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:19:00] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:19:00] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:19:00] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:19:00] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 14:19:00] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:19:00] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:19:01] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:19:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:19:02] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:19:08] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:19:08] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:19:10] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
SMT process timed out in 77222ms, After SMT, problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 77242ms
Finished structural reductions in LTL mode , in 1 iterations and 77681 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 32 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-08a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08a-LTLFireability-00 finished in 78633 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((X(p1)&&p0))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:19:26] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:19:26] [INFO ] Invariant cache hit.
[2024-05-29 14:19:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 14:19:26] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:19:26] [INFO ] Invariant cache hit.
[2024-05-29 14:19:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:19:26] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:19:26] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:19:26] [INFO ] Invariant cache hit.
[2024-05-29 14:19:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:19:47] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:19:48] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2024-05-29 14:19:49] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 1 ms to minimize.
[2024-05-29 14:19:51] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:19:52] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 0 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:19:54] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:19:55] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 0 ms to minimize.
[2024-05-29 14:19:55] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:19:55] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 2 ms to minimize.
[2024-05-29 14:19:55] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:19:55] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:19:56] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:19:56] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:19:56] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:19:56] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 0 ms to minimize.
[2024-05-29 14:19:57] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2024-05-29 14:19:57] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:19:57] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:00] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:20:00] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:20:00] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:20:00] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:20:01] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1282 variables, and 91 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1179/147 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:20:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:20:18] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:20:18] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:24] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:20:25] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:20:25] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:32] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:20:38] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:20:40] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 112/1282 variables, and 109 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/147 constraints, Known Traps: 108/108 constraints]
After SMT, in 76014ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 76043ms
Finished structural reductions in LTL mode , in 1 iterations and 76481 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-01
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLFireability-01 finished in 76665 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(p1))||p0)))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:20:42] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:20:42] [INFO ] Invariant cache hit.
[2024-05-29 14:20:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 14:20:42] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:20:42] [INFO ] Invariant cache hit.
[2024-05-29 14:20:42] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:20:43] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:20:43] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:20:43] [INFO ] Invariant cache hit.
[2024-05-29 14:20:43] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:03] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2024-05-29 14:21:04] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:21:05] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 0 ms to minimize.
[2024-05-29 14:21:06] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 4 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 0 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 1 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 1 ms to minimize.
[2024-05-29 14:21:07] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:21:08] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2024-05-29 14:21:09] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 0 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 2 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2024-05-29 14:21:13] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2024-05-29 14:21:13] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 2 ms to minimize.
[2024-05-29 14:21:13] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:16] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:21:16] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:21:16] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:21:28] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
SMT process timed out in 45189ms, After SMT, problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 45205ms
Finished structural reductions in LTL mode , in 1 iterations and 45569 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-08a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08a-LTLFireability-02 finished in 46052 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)))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:21:28] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:21:28] [INFO ] Invariant cache hit.
[2024-05-29 14:21:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 14:21:28] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:21:28] [INFO ] Invariant cache hit.
[2024-05-29 14:21:29] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:21:29] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:21:29] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:21:29] [INFO ] Invariant cache hit.
[2024-05-29 14:21:29] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:21:51] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-05-29 14:21:52] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 14:21:52] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 0 ms to minimize.
[2024-05-29 14:21:52] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 0 ms to minimize.
[2024-05-29 14:21:53] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:21:53] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2024-05-29 14:21:53] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:21:53] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 0 ms to minimize.
[2024-05-29 14:21:54] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:21:54] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
[2024-05-29 14:21:54] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 0 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 0 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 1 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:21:55] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 14:21:56] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:21:57] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:21:58] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:21:59] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2024-05-29 14:22:00] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 0 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2024-05-29 14:22:01] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:04] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:22:04] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:22:04] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:22:04] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:22:04] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:22:05] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:22:05] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:22:05] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:22:05] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:22:05] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:22:05] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:22:06] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:22:06] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:22:06] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:22:06] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:22:06] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:22:06] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:22:07] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:22:08] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 0 ms to minimize.
[2024-05-29 14:22:09] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:22:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:22:11] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:22:15] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1282 variables, and 91 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1179/147 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:22:20] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:22:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 14:22:21] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:22:21] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:22:21] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:22:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:22:21] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 14:22:22] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:22:22] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:28] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:22:29] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:36] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:22:42] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:22:43] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 112/1282 variables, and 109 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/147 constraints, Known Traps: 108/108 constraints]
After SMT, in 76928ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 76942ms
Finished structural reductions in LTL mode , in 1 iterations and 77333 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, p0]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-08a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08a-LTLFireability-04 finished in 77754 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' '!(F(G(p0)))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 111 transition count 1151
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 83 transition count 1151
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 56 place count 83 transition count 1142
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 74 transition count 1142
Performed 28 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 130 place count 46 transition count 1104
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 2 with 511 rules applied. Total rules applied 641 place count 46 transition count 593
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 657 place count 38 transition count 585
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 665 place count 38 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 674 place count 38 transition count 568
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 692 place count 29 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 28 transition count 558
Applied a total of 693 rules in 447 ms. Remains 28 /112 variables (removed 84) and now considering 558/1180 (removed 622) transitions.
[2024-05-29 14:22:46] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
// Phase 1: matrix 548 rows 28 cols
[2024-05-29 14:22:46] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 14:22:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 14:22:46] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:22:46] [INFO ] Invariant cache hit.
[2024-05-29 14:22:47] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:22:47] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-29 14:22:47] [INFO ] Redundant transitions in 46 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-29 14:22:47] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:22:47] [INFO ] Invariant cache hit.
[2024-05-29 14:22:47] [INFO ] State equation strengthened by 529 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:22:55] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:22:56] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:22:57] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 14:22:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:22:59] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 14:22:59] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:22:59] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:22:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:23:00] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:23:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:23:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:23:02] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:23:02] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:03] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:23:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:23:05] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:23:05] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:23:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 14:23:05] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 11 (OVERLAPS) 547/575 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 528/614 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/576 variables, and 614 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:23:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:23:26] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:23:26] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:23:26] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:23:26] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:23:27] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:23:27] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (OVERLAPS) 547/575 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 528/627 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 549/1176 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/576 variables, and 1176 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 70/70 constraints]
After SMT, in 67293ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 67299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/112 places, 558/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68008 ms. Remains : 28/112 places, 558/1180 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-06
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLFireability-06 finished in 68077 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' '!(F(p0))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 111 transition count 1151
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 83 transition count 1151
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 56 place count 83 transition count 1142
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 74 transition count 1142
Performed 28 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 130 place count 46 transition count 1104
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 2 with 511 rules applied. Total rules applied 641 place count 46 transition count 593
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 3 with 16 rules applied. Total rules applied 657 place count 38 transition count 585
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 665 place count 38 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 674 place count 38 transition count 568
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 692 place count 29 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 28 transition count 558
Applied a total of 693 rules in 361 ms. Remains 28 /112 variables (removed 84) and now considering 558/1180 (removed 622) transitions.
[2024-05-29 14:23:54] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:23:54] [INFO ] Invariant cache hit.
[2024-05-29 14:23:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 14:23:54] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:23:54] [INFO ] Invariant cache hit.
[2024-05-29 14:23:55] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:23:55] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-29 14:23:55] [INFO ] Redundant transitions in 22 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-29 14:23:55] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:23:55] [INFO ] Invariant cache hit.
[2024-05-29 14:23:55] [INFO ] State equation strengthened by 529 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:24:03] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:24:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:24:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:24:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:08] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:24:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:24:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:24:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:24:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:24:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 14:24:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 11 (OVERLAPS) 547/575 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 528/614 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/576 variables, and 614 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:32] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:24:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:24:35] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:24:35] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (OVERLAPS) 547/575 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 528/627 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 549/1176 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/576 variables, and 1176 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 70/70 constraints]
After SMT, in 66797ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 66802ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/112 places, 558/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67413 ms. Remains : 28/112 places, 558/1180 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-07
Product exploration explored 100000 steps with 10000 reset in 1326 ms.
Product exploration explored 100000 steps with 10000 reset in 1255 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 14:25:04] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:25:04] [INFO ] Invariant cache hit.
[2024-05-29 14:25:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 14:25:05] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-29 14:25:05] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:25:05] [INFO ] [Real]Added 529 Read/Feed constraints in 57 ms returned sat
[2024-05-29 14:25:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:25:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 14:25:05] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-29 14:25:05] [INFO ] [Nat]Added 529 Read/Feed constraints in 65 ms returned sat
[2024-05-29 14:25:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 539 transitions) in 88 ms.
[2024-05-29 14:25:06] [INFO ] Added : 0 causal constraints over 0 iterations in 178 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 558/558 transitions.
Applied a total of 0 rules in 68 ms. Remains 28 /28 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-29 14:25:06] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:25:06] [INFO ] Invariant cache hit.
[2024-05-29 14:25:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 14:25:06] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:25:06] [INFO ] Invariant cache hit.
[2024-05-29 14:25:06] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:25:06] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-29 14:25:06] [INFO ] Redundant transitions in 19 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-29 14:25:06] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:25:06] [INFO ] Invariant cache hit.
[2024-05-29 14:25:06] [INFO ] State equation strengthened by 529 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 14:25:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:25:15] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 14:25:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:25:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:25:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:25:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 14:25:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:25:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:20] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:25:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:25:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:25:21] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:25:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:25:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:25:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:25:25] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:25:25] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 14:25:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 11 (OVERLAPS) 547/575 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 528/614 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/576 variables, and 614 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:25:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 14:25:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:25:44] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:25:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:25:45] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:25:45] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:25:45] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:25:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:25:45] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:25:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:25:46] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:25:46] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (OVERLAPS) 547/575 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 528/627 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 549/1176 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/576 variables, and 1176 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 70/70 constraints]
After SMT, in 67362ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 67369ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67657 ms. Remains : 28/28 places, 558/558 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 36 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-29 14:26:14] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:26:14] [INFO ] Invariant cache hit.
[2024-05-29 14:26:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 14:26:14] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-29 14:26:14] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:26:14] [INFO ] [Real]Added 529 Read/Feed constraints in 53 ms returned sat
[2024-05-29 14:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:26:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 14:26:14] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-29 14:26:14] [INFO ] [Nat]Added 529 Read/Feed constraints in 64 ms returned sat
[2024-05-29 14:26:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 539 transitions) in 164 ms.
[2024-05-29 14:26:15] [INFO ] Added : 0 causal constraints over 0 iterations in 236 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10000 reset in 1249 ms.
Product exploration explored 100000 steps with 10000 reset in 1258 ms.
Built C files in :
/tmp/ltsmin9220390130084819924
[2024-05-29 14:26:17] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-29 14:26:17] [INFO ] Computation of Complete disable matrix. took 94 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:26:17] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-29 14:26:17] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:26:17] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-29 14:26:17] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:26:18] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9220390130084819924
Running compilation step : cd /tmp/ltsmin9220390130084819924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2934 ms.
Running link step : cd /tmp/ltsmin9220390130084819924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9220390130084819924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1139726386449151185.hoa' '--buchi-type=spotba'
LTSmin run took 2176 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-08a-LTLFireability-07 finished in 148671 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((G(!p0)||X(F(p1)))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 111 transition count 1151
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 83 transition count 1151
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 56 place count 83 transition count 1142
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 74 transition count 1142
Performed 28 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 130 place count 46 transition count 1104
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 2 with 511 rules applied. Total rules applied 641 place count 46 transition count 593
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 3 with 16 rules applied. Total rules applied 657 place count 38 transition count 585
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 665 place count 38 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 674 place count 38 transition count 568
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 4 with 18 rules applied. Total rules applied 692 place count 29 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 28 transition count 558
Applied a total of 693 rules in 206 ms. Remains 28 /112 variables (removed 84) and now considering 558/1180 (removed 622) transitions.
[2024-05-29 14:26:23] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:26:23] [INFO ] Invariant cache hit.
[2024-05-29 14:26:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 14:26:23] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:26:23] [INFO ] Invariant cache hit.
[2024-05-29 14:26:23] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:26:23] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-29 14:26:23] [INFO ] Redundant transitions in 20 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-29 14:26:23] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:26:23] [INFO ] Invariant cache hit.
[2024-05-29 14:26:23] [INFO ] State equation strengthened by 529 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:26:32] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:26:32] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:26:32] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:26:32] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:26:32] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:26:33] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:26:35] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:26:35] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:26:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:26:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:26:36] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:26:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 14:26:36] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:26:36] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:37] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:38] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:26:38] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:26:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:26:39] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 14:26:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:40] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:41] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:26:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:26:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:26:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:26:42] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:26:42] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:26:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 11 (OVERLAPS) 547/575 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 528/614 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/576 variables, and 614 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:27:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:27:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:04] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:27:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (OVERLAPS) 547/575 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 528/627 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 549/1176 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/576 variables, and 1176 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 70/70 constraints]
After SMT, in 67644ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 67650ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/112 places, 558/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68072 ms. Remains : 28/112 places, 558/1180 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLFireability-08 finished in 68191 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(G(p0))&&F(p1))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 111 transition count 1151
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 83 transition count 1151
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 56 place count 83 transition count 1142
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 74 transition count 1142
Performed 28 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 130 place count 46 transition count 1104
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 2 with 511 rules applied. Total rules applied 641 place count 46 transition count 593
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 3 with 16 rules applied. Total rules applied 657 place count 38 transition count 585
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 665 place count 38 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 674 place count 38 transition count 568
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 692 place count 29 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 28 transition count 558
Applied a total of 693 rules in 215 ms. Remains 28 /112 variables (removed 84) and now considering 558/1180 (removed 622) transitions.
[2024-05-29 14:27:31] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:27:31] [INFO ] Invariant cache hit.
[2024-05-29 14:27:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 14:27:31] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:27:31] [INFO ] Invariant cache hit.
[2024-05-29 14:27:31] [INFO ] State equation strengthened by 529 read => feed constraints.
[2024-05-29 14:27:31] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-29 14:27:31] [INFO ] Redundant transitions in 30 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-29 14:27:31] [INFO ] Flow matrix only has 548 transitions (discarded 10 similar events)
[2024-05-29 14:27:31] [INFO ] Invariant cache hit.
[2024-05-29 14:27:31] [INFO ] State equation strengthened by 529 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:39] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:27:40] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 14:27:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:27:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 14:27:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:27:44] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:27:44] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 14:27:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:27:44] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:27:46] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:27:46] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:27:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:27:46] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:48] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:27:49] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 14:27:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 11 (OVERLAPS) 547/575 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 528/614 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/576 variables, and 614 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:28:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:28:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:28:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-29 14:28:11] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:28:12] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (OVERLAPS) 547/575 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 528/627 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 549/1176 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/576 variables, and 1176 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 528/529 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 70/70 constraints]
After SMT, in 66995ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 67001ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/112 places, 558/1180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67466 ms. Remains : 28/112 places, 558/1180 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLFireability-10 finished in 67604 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(p1)||p0))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:28:39] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:28:39] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 14:28:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 14:28:39] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:28:39] [INFO ] Invariant cache hit.
[2024-05-29 14:28:39] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:28:39] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:28:39] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:28:39] [INFO ] Invariant cache hit.
[2024-05-29 14:28:39] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:01] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:29:01] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:29:01] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 0 ms to minimize.
[2024-05-29 14:29:02] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 1 ms to minimize.
[2024-05-29 14:29:02] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2024-05-29 14:29:02] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2024-05-29 14:29:02] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:29:03] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:29:03] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:29:03] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2024-05-29 14:29:03] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-05-29 14:29:04] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 0 ms to minimize.
[2024-05-29 14:29:04] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2024-05-29 14:29:04] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2024-05-29 14:29:05] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:29:05] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 0 ms to minimize.
[2024-05-29 14:29:05] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 0 ms to minimize.
[2024-05-29 14:29:05] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:29:06] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:29:06] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:06] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:29:07] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2024-05-29 14:29:07] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:29:07] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:29:07] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:29:07] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:29:08] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:29:08] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2024-05-29 14:29:08] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2024-05-29 14:29:08] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:29:08] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:29:09] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:29:09] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:29:09] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2024-05-29 14:29:09] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:29:09] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 14:29:10] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:29:10] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-05-29 14:29:10] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:29:10] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:13] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2024-05-29 14:29:13] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:29:14] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:29:14] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 0 ms to minimize.
[2024-05-29 14:29:14] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:29:14] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:29:14] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:29:14] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:29:15] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:29:15] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:29:15] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 0 ms to minimize.
[2024-05-29 14:29:15] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:29:15] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:29:15] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:29:16] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:29:16] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:29:16] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:29:16] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:29:16] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:29:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:29:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-05-29 14:29:18] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:29:19] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:29:19] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:29:19] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:29:19] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:29:19] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:29:20] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:29:21] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 14:29:25] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:29:25] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1282 variables, and 91 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1179/147 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:29:30] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:29:31] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:29:31] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:37] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:29:38] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:29:38] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:29:39] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:46] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:29:52] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:29:54] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 timeout
0)
(s78 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 112/1282 variables, and 109 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/147 constraints, Known Traps: 108/108 constraints]
After SMT, in 76169ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 76183ms
Finished structural reductions in LTL mode , in 1 iterations and 76596 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-08a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08a-LTLFireability-12 finished in 77011 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 U (G(p0)||((F(!p0)||X(G(!p2)))&&p1)))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:29:56] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:29:56] [INFO ] Invariant cache hit.
[2024-05-29 14:29:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 14:29:56] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:29:56] [INFO ] Invariant cache hit.
[2024-05-29 14:29:56] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:29:56] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:29:56] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:29:56] [INFO ] Invariant cache hit.
[2024-05-29 14:29:56] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:30:17] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 14:30:17] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 14:30:18] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 0 ms to minimize.
[2024-05-29 14:30:18] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 0 ms to minimize.
[2024-05-29 14:30:18] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:30:18] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:30:19] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2024-05-29 14:30:19] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2024-05-29 14:30:19] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 0 ms to minimize.
[2024-05-29 14:30:19] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-05-29 14:30:20] [INFO ] Deduced a trap composed of 13 places in 338 ms of which 1 ms to minimize.
[2024-05-29 14:30:20] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 0 ms to minimize.
[2024-05-29 14:30:20] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 1 ms to minimize.
[2024-05-29 14:30:21] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 2 ms to minimize.
[2024-05-29 14:30:21] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 1 ms to minimize.
[2024-05-29 14:30:21] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:30:22] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 14:30:22] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:30:22] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 0 ms to minimize.
[2024-05-29 14:30:22] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:30:23] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2024-05-29 14:30:23] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 0 ms to minimize.
[2024-05-29 14:30:23] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:30:23] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2024-05-29 14:30:24] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:30:24] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:30:24] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-05-29 14:30:24] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:30:24] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:30:25] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:30:25] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:30:25] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:30:25] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:30:25] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:30:26] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:30:26] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 14:30:26] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:30:26] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
[2024-05-29 14:30:27] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:30:27] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:30:30] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:30:30] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:30:30] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:30:30] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:30:30] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:30:30] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:30:31] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:30:31] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:30:31] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:30:31] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:30:31] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 0 ms to minimize.
[2024-05-29 14:30:31] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:30:32] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:30:33] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:30:33] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:30:33] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:30:33] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:30:33] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:30:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:30:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:30:35] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:30:36] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:30:36] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:30:36] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:30:36] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:30:37] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:30:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:30:37] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:30:37] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:30:41] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:30:41] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
SMT process timed out in 45459ms, After SMT, problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 45474ms
Finished structural reductions in LTL mode , in 1 iterations and 45857 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLFireability-14 finished in 45990 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(G(p0)))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 1180/1180 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
[2024-05-29 14:30:42] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:30:42] [INFO ] Invariant cache hit.
[2024-05-29 14:30:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 14:30:42] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:30:42] [INFO ] Invariant cache hit.
[2024-05-29 14:30:42] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:30:42] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2024-05-29 14:30:42] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:30:42] [INFO ] Invariant cache hit.
[2024-05-29 14:30:42] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:05] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2024-05-29 14:31:05] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 14:31:06] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 14:31:06] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
[2024-05-29 14:31:06] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:31:06] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 0 ms to minimize.
[2024-05-29 14:31:07] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 0 ms to minimize.
[2024-05-29 14:31:07] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:31:07] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 0 ms to minimize.
[2024-05-29 14:31:07] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2024-05-29 14:31:08] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 1 ms to minimize.
[2024-05-29 14:31:08] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:31:08] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 1 ms to minimize.
[2024-05-29 14:31:09] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 1 ms to minimize.
[2024-05-29 14:31:09] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:31:09] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
[2024-05-29 14:31:09] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:31:10] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:31:10] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:31:10] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:11] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:31:11] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:31:11] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2024-05-29 14:31:11] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:31:11] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:31:12] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:31:12] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:31:12] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:31:12] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 0 ms to minimize.
[2024-05-29 14:31:12] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 0 ms to minimize.
[2024-05-29 14:31:13] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:31:13] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:31:13] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:31:13] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:31:13] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2024-05-29 14:31:14] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:31:14] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 1 ms to minimize.
[2024-05-29 14:31:14] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:31:14] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:31:15] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:31:18] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:31:19] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:31:19] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:31:19] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:31:19] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2024-05-29 14:31:19] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2024-05-29 14:31:19] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:31:20] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:21] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:31:21] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:31:21] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:31:21] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:31:21] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:31:21] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:31:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:31:25] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:31:25] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-29 14:31:29] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:31:29] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1282 variables, and 91 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1179/147 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:31:35] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:31:35] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:31:35] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 14:31:36] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:31:36] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:42] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:31:42] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:31:42] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:31:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:49] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:31:55] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
[2024-05-29 14:31:57] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 112/1282 variables, and 109 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/147 constraints, Known Traps: 108/108 constraints]
After SMT, in 77479ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 77494ms
Finished structural reductions in LTL mode , in 1 iterations and 77872 ms. Remains : 112/112 places, 1180/1180 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLFireability-15 finished in 78006 ms.
All properties solved by simple procedures.
Total runtime 842626 ms.
BK_STOP 1716993120127
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="StigmergyCommit-PT-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-08a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;