MCC'2024- Execution of r536-tall-171690531800187

About the Execution of LTSMin+red for StigmergyCommit-PT-08a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3856.972	925359.00	2441557.00	1158.00	TTFFTFFFTTFFFFFT	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.r536-tall-171690531800187.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 ltsminxred
Input is StigmergyCommit-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531800187
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717233420263

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:17:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:17:02] [INFO ] Load time of PNML (sax parser for PT used): 841 ms
[2024-06-01 09:17:02] [INFO ] Transformed 328 places.
[2024-06-01 09:17:02] [INFO ] Transformed 18744 transitions.
[2024-06-01 09:17:02] [INFO ] Found NUPN structural information;
[2024-06-01 09:17:02] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1042 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 265 transition count 1377
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 265 transition count 1377
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 133 place count 265 transition count 1370
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 159 place count 239 transition count 1337
Iterating global reduction 1 with 26 rules applied. Total rules applied 185 place count 239 transition count 1337
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 191 place count 239 transition count 1331
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 235 transition count 1327
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 235 transition count 1327
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 231 transition count 1323
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 231 transition count 1323
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 227 transition count 1319
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 227 transition count 1319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 223 transition count 1315
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 223 transition count 1315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 227 place count 223 transition count 1311
Applied a total of 227 rules in 96 ms. Remains 223 /328 variables (removed 105) and now considering 1311/1449 (removed 138) transitions.
[2024-06-01 09:17:02] [INFO ] Flow matrix only has 1299 transitions (discarded 12 similar events)
// Phase 1: matrix 1299 rows 223 cols
[2024-06-01 09:17:02] [INFO ] Computed 4 invariants in 30 ms
[2024-06-01 09:17:03] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-06-01 09:17:03] [INFO ] Flow matrix only has 1299 transitions (discarded 12 similar events)
[2024-06-01 09:17:03] [INFO ] Invariant cache hit.
[2024-06-01 09:17:03] [INFO ] State equation strengthened by 1120 read => feed constraints.
[2024-06-01 09:17:06] [INFO ] Implicit Places using invariants and state equation in 2573 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3301 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/328 places, 1311/1449 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 204 transition count 1293
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 204 transition count 1293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 204 transition count 1287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 197 transition count 1280
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 197 transition count 1280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 193 transition count 1276
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 193 transition count 1276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 190 transition count 1273
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 190 transition count 1273
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 187 transition count 1270
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 187 transition count 1270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 184 transition count 1267
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 184 transition count 1267
Applied a total of 82 rules in 55 ms. Remains 184 /222 variables (removed 38) and now considering 1267/1311 (removed 44) transitions.
[2024-06-01 09:17:06] [INFO ] Flow matrix only has 1255 transitions (discarded 12 similar events)
// Phase 1: matrix 1255 rows 184 cols
[2024-06-01 09:17:06] [INFO ] Computed 3 invariants in 13 ms
[2024-06-01 09:17:06] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-01 09:17:06] [INFO ] Flow matrix only has 1255 transitions (discarded 12 similar events)
[2024-06-01 09:17:06] [INFO ] Invariant cache hit.
[2024-06-01 09:17:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:17:07] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/328 places, 1267/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4597 ms. Remains : 184/328 places, 1267/1449 transitions.
Support contains 40 out of 184 places after structural reductions.
[2024-06-01 09:17:07] [INFO ] Flatten gal took : 196 ms
[2024-06-01 09:17:07] [INFO ] Flatten gal took : 103 ms
[2024-06-01 09:17:08] [INFO ] Input system was already deterministic with 1267 transitions.
RANDOM walk for 40000 steps (10 resets) in 3499 ms. (11 steps per ms) remains 8/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
[2024-06-01 09:17:09] [INFO ] Flow matrix only has 1255 transitions (discarded 12 similar events)
[2024-06-01 09:17:09] [INFO ] Invariant cache hit.
[2024-06-01 09:17:09] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 165/184 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1254/1438 variables, 184/187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1438 variables, 1029/1216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1438 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/1439 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1439 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1439 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1439/1439 variables, and 1217 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 184/184 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 165/184 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 14 ms to minimize.
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 2 ms to minimize.
[2024-06-01 09:17:11] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 1 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 1 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 1 ms to minimize.
[2024-06-01 09:17:12] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-06-01 09:17:13] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 2 ms to minimize.
[2024-06-01 09:17:13] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 4 ms to minimize.
[2024-06-01 09:17:13] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 2 ms to minimize.
[2024-06-01 09:17:14] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2024-06-01 09:17:14] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 2 ms to minimize.
[2024-06-01 09:17:14] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2024-06-01 09:17:14] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-01 09:17:15] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
SMT process timed out in 6266ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Graph (complete) has 474 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 183 transition count 1162
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 98 transition count 1142
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 220 place count 91 transition count 1139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 223 place count 90 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 89 transition count 1137
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 224 place count 89 transition count 1131
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 236 place count 83 transition count 1131
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 249 place count 70 transition count 1117
Iterating global reduction 5 with 13 rules applied. Total rules applied 262 place count 70 transition count 1117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 270 place count 70 transition count 1109
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 274 place count 66 transition count 1105
Iterating global reduction 6 with 4 rules applied. Total rules applied 278 place count 66 transition count 1105
Performed 28 Post agglomeration using F-continuation condition with reduction of 964 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 334 place count 38 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 6 with 64 rules applied. Total rules applied 398 place count 38 transition count 49
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 402 place count 36 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 405 place count 36 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 409 place count 36 transition count 39
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 412 place count 36 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 415 place count 33 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 416 place count 33 transition count 36
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 417 place count 33 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 418 place count 32 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 419 place count 31 transition count 34
Applied a total of 419 rules in 129 ms. Remains 31 /184 variables (removed 153) and now considering 34/1267 (removed 1233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 31/184 places, 34/1267 transitions.
RANDOM walk for 40000 steps (1864 resets) in 291 ms. (136 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (506 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
// Phase 1: matrix 34 rows 31 cols
[2024-06-01 09:17:16] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 09:17:16] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/35 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/36 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/39 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/58 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/65 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/65 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/65 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/65 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 47 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:16] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 15/65 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 4/8 constraints, State Equation: 0/31 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 99ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 30 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' '!(G((p0||X(F(p1))||G(p2))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 183 transition count 1180
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 99 rules applied. Total rules applied 185 place count 97 transition count 1167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 191 place count 95 transition count 1163
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 195 place count 93 transition count 1161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 92 transition count 1161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 196 place count 92 transition count 1152
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 214 place count 83 transition count 1152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 218 place count 79 transition count 1147
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 79 transition count 1147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 79 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 225 place count 79 transition count 1143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 78 transition count 1143
Performed 30 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 287 place count 48 transition count 1102
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 6 with 133 rules applied. Total rules applied 420 place count 48 transition count 969
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 426 place count 45 transition count 966
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 429 place count 45 transition count 963
Drop transitions (Redundant composition of simpler transitions.) removed 895 transitions
Redundant transition composition rules discarded 895 transitions
Iterating global reduction 8 with 895 rules applied. Total rules applied 1324 place count 45 transition count 68
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 8 with 18 rules applied. Total rules applied 1342 place count 36 transition count 59
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1347 place count 31 transition count 54
Applied a total of 1347 rules in 266 ms. Remains 31 /184 variables (removed 153) and now considering 54/1267 (removed 1213) transitions.
[2024-06-01 09:17:16] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
// Phase 1: matrix 45 rows 31 cols
[2024-06-01 09:17:16] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 09:17:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 09:17:16] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:16] [INFO ] Invariant cache hit.
[2024-06-01 09:17:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 09:17:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-01 09:17:16] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 09:17:16] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:16] [INFO ] Invariant cache hit.
[2024-06-01 09:17:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 44/75 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1/76 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 44/75 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 53/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/76 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 172 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 74/74 constraints]
After SMT, in 5051ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5052ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/184 places, 54/1267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5421 ms. Remains : 31/184 places, 54/1267 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-00
Product exploration explored 100000 steps with 33238 reset in 241 ms.
Product exploration explored 100000 steps with 33219 reset in 172 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (2557 resets) in 209 ms. (190 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (374 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (362 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
[2024-06-01 09:17:23] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:23] [INFO ] Invariant cache hit.
[2024-06-01 09:17:23] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 75/76 variables, and 32 constraints, problems are : Problem set: 2 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 40ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (G (OR (NOT p2) p1 (NOT p0))), (G (OR p2 p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p2 (NOT p0)))), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 13 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 09:17:23] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:23] [INFO ] Invariant cache hit.
[2024-06-01 09:17:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 09:17:23] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:23] [INFO ] Invariant cache hit.
[2024-06-01 09:17:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 09:17:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 09:17:23] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 09:17:23] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:23] [INFO ] Invariant cache hit.
[2024-06-01 09:17:23] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:17:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 44/75 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1/76 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 44/75 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 53/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/76 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 172 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 74/74 constraints]
After SMT, in 4777ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 4778ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4874 ms. Remains : 31/31 places, 54/54 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 459 steps (31 resets) in 5 ms. (76 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 1 reset in 92 ms.
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 54/54 transitions.
Applied a total of 0 rules in 17 ms. Remains 31 /31 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 09:17:29] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:29] [INFO ] Invariant cache hit.
[2024-06-01 09:17:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 09:17:29] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:29] [INFO ] Invariant cache hit.
[2024-06-01 09:17:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 09:17:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 09:17:29] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 09:17:29] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-06-01 09:17:29] [INFO ] Invariant cache hit.
[2024-06-01 09:17:29] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 44/75 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1/76 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/76 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 44/75 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 53/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/76 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 172 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 74/74 constraints]
After SMT, in 4923ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 4923ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5063 ms. Remains : 31/31 places, 54/54 transitions.
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-00 finished in 18040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 183 transition count 1170
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 111 rules applied. Total rules applied 207 place count 87 transition count 1155
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 213 place count 85 transition count 1151
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 217 place count 83 transition count 1149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 217 place count 83 transition count 1140
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 235 place count 74 transition count 1140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 240 place count 69 transition count 1133
Iterating global reduction 4 with 5 rules applied. Total rules applied 245 place count 69 transition count 1133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 252 place count 69 transition count 1126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 252 place count 69 transition count 1125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 68 transition count 1125
Performed 29 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 312 place count 39 transition count 1085
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 568 place count 39 transition count 829
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 574 place count 36 transition count 826
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 577 place count 36 transition count 823
Drop transitions (Redundant composition of simpler transitions.) removed 757 transitions
Redundant transition composition rules discarded 757 transitions
Iterating global reduction 7 with 757 rules applied. Total rules applied 1334 place count 36 transition count 66
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 7 with 18 rules applied. Total rules applied 1352 place count 27 transition count 57
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1358 place count 21 transition count 51
Applied a total of 1358 rules in 152 ms. Remains 21 /184 variables (removed 163) and now considering 51/1267 (removed 1216) transitions.
[2024-06-01 09:17:34] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
// Phase 1: matrix 42 rows 21 cols
[2024-06-01 09:17:34] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 09:17:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:17:34] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
[2024-06-01 09:17:34] [INFO ] Invariant cache hit.
[2024-06-01 09:17:34] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 09:17:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 09:17:34] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 09:17:34] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
[2024-06-01 09:17:34] [INFO ] Invariant cache hit.
[2024-06-01 09:17:34] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 41/62 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 1/63 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/63 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (OVERLAPS) 0/63 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 102 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 41/62 variables, 21/91 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 18/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 50/159 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 1/63 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 160 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 69/69 constraints]
After SMT, in 3817ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 3818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/184 places, 51/1267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4065 ms. Remains : 21/184 places, 51/1267 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-02
Product exploration explored 100000 steps with 2 reset in 149 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-02 finished in 4332 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((F(p1)&&p0))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 1243
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 1243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 162 transition count 1238
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 149 transition count 1225
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 149 transition count 1225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 149 transition count 1223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 140 transition count 1214
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 140 transition count 1214
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 104 place count 131 transition count 1205
Iterating global reduction 2 with 9 rules applied. Total rules applied 113 place count 131 transition count 1205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 125 transition count 1199
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 125 transition count 1199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 125 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 122 transition count 1194
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 122 transition count 1194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 122 transition count 1192
Applied a total of 135 rules in 36 ms. Remains 122 /184 variables (removed 62) and now considering 1192/1267 (removed 75) transitions.
[2024-06-01 09:17:38] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
// Phase 1: matrix 1182 rows 122 cols
[2024-06-01 09:17:38] [INFO ] Computed 1 invariants in 15 ms
[2024-06-01 09:17:39] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 09:17:39] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-06-01 09:17:39] [INFO ] Invariant cache hit.
[2024-06-01 09:17:39] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:17:39] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 1191 sub problems to find dead transitions.
[2024-06-01 09:17:39] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-06-01 09:17:39] [INFO ] Invariant cache hit.
[2024-06-01 09:17:39] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:00] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2024-06-01 09:18:01] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 1 ms to minimize.
[2024-06-01 09:18:01] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2024-06-01 09:18:01] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:18:08] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:11] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2024-06-01 09:18:11] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2024-06-01 09:18:11] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:18:11] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:18:11] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:18:12] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-06-01 09:18:12] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-06-01 09:18:12] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-01 09:18:12] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:18:12] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-06-01 09:18:12] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:18:16] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:18:16] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:18:16] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 3 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-06-01 09:18:20] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-06-01 09:18:20] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:18:20] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-06-01 09:18:20] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2024-06-01 09:18:20] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:21] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:18:21] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:18:21] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:18:21] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-06-01 09:18:21] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2024-06-01 09:18:22] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:18:22] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-06-01 09:18:22] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2024-06-01 09:18:22] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2024-06-01 09:18:22] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:18:24] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:18:24] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 122/1304 variables, and 101 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/122 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1191/159 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:18:33] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:18:34] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-06-01 09:18:34] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:18:34] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-06-01 09:18:34] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:18:34] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-06-01 09:18:35] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:18:36] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:18:36] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:18:46] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 122/1304 variables, and 116 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/122 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/159 constraints, Known Traps: 115/115 constraints]
After SMT, in 75157ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 75174ms
Starting structural reductions in LTL mode, iteration 1 : 122/184 places, 1192/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76173 ms. Remains : 122/184 places, 1192/1267 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-03 finished in 76338 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||F(G(p1)))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 1242
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 1242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 1236
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 148 transition count 1223
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 148 transition count 1223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 148 transition count 1222
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 137 transition count 1211
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 137 transition count 1211
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 111 place count 127 transition count 1201
Iterating global reduction 2 with 10 rules applied. Total rules applied 121 place count 127 transition count 1201
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 120 transition count 1194
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 120 transition count 1194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 138 place count 120 transition count 1191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 117 transition count 1188
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 117 transition count 1188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 117 transition count 1187
Applied a total of 145 rules in 29 ms. Remains 117 /184 variables (removed 67) and now considering 1187/1267 (removed 80) transitions.
[2024-06-01 09:18:55] [INFO ] Flow matrix only has 1177 transitions (discarded 10 similar events)
// Phase 1: matrix 1177 rows 117 cols
[2024-06-01 09:18:55] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 09:18:55] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-06-01 09:18:55] [INFO ] Flow matrix only has 1177 transitions (discarded 10 similar events)
[2024-06-01 09:18:55] [INFO ] Invariant cache hit.
[2024-06-01 09:18:55] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:18:56] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1186 sub problems to find dead transitions.
[2024-06-01 09:18:56] [INFO ] Flow matrix only has 1177 transitions (discarded 10 similar events)
[2024-06-01 09:18:56] [INFO ] Invariant cache hit.
[2024-06-01 09:18:56] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-06-01 09:19:17] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:19:18] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:19:18] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:19:18] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 0 ms to minimize.
[2024-06-01 09:19:18] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:19:19] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2024-06-01 09:19:19] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2024-06-01 09:19:19] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-06-01 09:19:19] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2024-06-01 09:19:19] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:19:20] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:19:20] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:19:20] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:19:20] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2024-06-01 09:19:20] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2024-06-01 09:19:21] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-06-01 09:19:21] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-06-01 09:19:21] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2024-06-01 09:19:21] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2024-06-01 09:19:22] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-06-01 09:19:22] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2024-06-01 09:19:22] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2024-06-01 09:19:22] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-06-01 09:19:28] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:19:28] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:19:28] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-06-01 09:19:28] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-06-01 09:19:28] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:19:28] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2024-06-01 09:19:29] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 0 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 0 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-06-01 09:19:34] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2024-06-01 09:19:34] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-06-01 09:19:34] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-06-01 09:19:34] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:19:34] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:19:35] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-06-01 09:19:35] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 20 ms to minimize.
[2024-06-01 09:19:35] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2024-06-01 09:19:35] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-06-01 09:19:35] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-06-01 09:19:35] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 0 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 0 ms to minimize.
[2024-06-01 09:19:37] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2024-06-01 09:19:37] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2024-06-01 09:19:37] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2024-06-01 09:19:37] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2024-06-01 09:19:37] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
[2024-06-01 09:19:41] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 0 ms to minimize.
[2024-06-01 09:19:41] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:19:41] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:19:42] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2024-06-01 09:19:42] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
SMT process timed out in 45830ms, After SMT, problems are : Problem set: 0 solved, 1186 unsolved
Search for dead transitions found 0 dead transitions in 45843ms
Starting structural reductions in LTL mode, iteration 1 : 117/184 places, 1187/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47032 ms. Remains : 117/184 places, 1187/1267 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 353 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 (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
RANDOM walk for 31824 steps (8 resets) in 1931 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Support contains 2 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 1187/1187 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 116 transition count 1158
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 88 transition count 1158
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 56 place count 88 transition count 1151
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 81 transition count 1151
Performed 37 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 144 place count 44 transition count 1105
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 280 place count 44 transition count 969
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 296 place count 36 transition count 961
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 304 place count 36 transition count 953
Drop transitions (Redundant composition of simpler transitions.) removed 895 transitions
Redundant transition composition rules discarded 895 transitions
Iterating global reduction 4 with 895 rules applied. Total rules applied 1199 place count 36 transition count 58
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 1217 place count 27 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1219 place count 27 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1220 place count 26 transition count 48
Applied a total of 1220 rules in 147 ms. Remains 26 /117 variables (removed 91) and now considering 48/1187 (removed 1139) transitions.
[2024-06-01 09:19:43] [INFO ] Flow matrix only has 38 transitions (discarded 10 similar events)
// Phase 1: matrix 38 rows 26 cols
[2024-06-01 09:19:44] [INFO ] Computed 1 invariants in 13 ms
[2024-06-01 09:19:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 09:19:44] [INFO ] Flow matrix only has 38 transitions (discarded 10 similar events)
[2024-06-01 09:19:44] [INFO ] Invariant cache hit.
[2024-06-01 09:19:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 09:19:44] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 09:19:44] [INFO ] Flow matrix only has 38 transitions (discarded 10 similar events)
[2024-06-01 09:19:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 9/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 9/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 37/63 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/63 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 120 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 67/67 constraints]
After SMT, in 2855ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 2855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/117 places, 48/1187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3097 ms. Remains : 26/117 places, 48/1187 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 : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
RANDOM walk for 281 steps (29 resets) in 6 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 78 ms.
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 23 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 12 place count 23 transition count 39
Applied a total of 12 rules in 3 ms. Remains 23 /26 variables (removed 3) and now considering 39/48 (removed 9) transitions.
[2024-06-01 09:19:47] [INFO ] Flow matrix only has 29 transitions (discarded 10 similar events)
// Phase 1: matrix 29 rows 23 cols
[2024-06-01 09:19:47] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 09:19:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:19:47] [INFO ] Flow matrix only has 29 transitions (discarded 10 similar events)
[2024-06-01 09:19:47] [INFO ] Invariant cache hit.
[2024-06-01 09:19:47] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 09:19:47] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 09:19:47] [INFO ] Flow matrix only has 29 transitions (discarded 10 similar events)
[2024-06-01 09:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 9/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 28/51 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/51 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/51 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/52 variables, and 83 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 9/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 28/51 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/51 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 119 constraints, problems are : Problem set: 0 solved, 23 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 72/72 constraints]
After SMT, in 3025ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 3025ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/26 places, 39/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3131 ms. Remains : 23/26 places, 39/48 transitions.
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-05 finished in 55687 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 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 1242
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 1242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 1236
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 148 transition count 1223
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 148 transition count 1223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 148 transition count 1221
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 139 transition count 1212
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 139 transition count 1212
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 106 place count 131 transition count 1204
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 131 transition count 1204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 126 transition count 1199
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 126 transition count 1199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 126 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 123 transition count 1194
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 123 transition count 1194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 123 transition count 1193
Applied a total of 133 rules in 26 ms. Remains 123 /184 variables (removed 61) and now considering 1193/1267 (removed 74) transitions.
[2024-06-01 09:19:50] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
// Phase 1: matrix 1183 rows 123 cols
[2024-06-01 09:19:50] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 09:19:51] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-01 09:19:51] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
[2024-06-01 09:19:51] [INFO ] Invariant cache hit.
[2024-06-01 09:19:51] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:19:52] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 1192 sub problems to find dead transitions.
[2024-06-01 09:19:52] [INFO ] Flow matrix only has 1183 transitions (discarded 10 similar events)
[2024-06-01 09:19:52] [INFO ] Invariant cache hit.
[2024-06-01 09:19:52] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:13] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:20:14] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 1 ms to minimize.
[2024-06-01 09:20:14] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-06-01 09:20:14] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:20:20] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-06-01 09:20:20] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:20:20] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:20:20] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-06-01 09:20:20] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-06-01 09:20:20] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:20:21] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:20:21] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
[2024-06-01 09:20:21] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2024-06-01 09:20:21] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:24] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-06-01 09:20:25] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2024-06-01 09:20:25] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2024-06-01 09:20:25] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:20:25] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:20:26] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:20:26] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2024-06-01 09:20:26] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:20:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:20:30] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:20:30] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:20:30] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2024-06-01 09:20:30] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:20:30] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:20:31] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-06-01 09:20:31] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-06-01 09:20:31] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:20:31] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-06-01 09:20:31] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:20:31] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:32] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-06-01 09:20:32] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
[2024-06-01 09:20:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:20:32] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:20:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:20:33] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/1306 variables, and 74 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/123 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1192/160 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:40] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:20:41] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:20:42] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:20:43] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:20:43] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:20:43] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-06-01 09:20:43] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:20:43] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:20:43] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:44] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:20:44] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:20:45] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
[2024-06-01 09:20:51] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 7 (OVERLAPS) 1182/1305 variables, 123/221 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
SMT process timed out in 75212ms, After SMT, problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 75226ms
Starting structural reductions in LTL mode, iteration 1 : 123/184 places, 1193/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76392 ms. Remains : 123/184 places, 1193/1267 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 196 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 : [p0, (X p0), (X (X 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-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-09 finished in 76977 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)&&X((p1 U X(G(!p1))))))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 160 transition count 1242
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 160 transition count 1242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 160 transition count 1236
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 146 transition count 1222
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 146 transition count 1222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 146 transition count 1220
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 135 transition count 1209
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 135 transition count 1209
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 116 place count 125 transition count 1199
Iterating global reduction 2 with 10 rules applied. Total rules applied 126 place count 125 transition count 1199
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 133 place count 118 transition count 1192
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 118 transition count 1192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 143 place count 118 transition count 1189
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 114 transition count 1185
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 114 transition count 1185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 114 transition count 1183
Applied a total of 153 rules in 34 ms. Remains 114 /184 variables (removed 70) and now considering 1183/1267 (removed 84) transitions.
[2024-06-01 09:21:07] [INFO ] Flow matrix only has 1173 transitions (discarded 10 similar events)
// Phase 1: matrix 1173 rows 114 cols
[2024-06-01 09:21:07] [INFO ] Computed 1 invariants in 14 ms
[2024-06-01 09:21:08] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 09:21:08] [INFO ] Flow matrix only has 1173 transitions (discarded 10 similar events)
[2024-06-01 09:21:08] [INFO ] Invariant cache hit.
[2024-06-01 09:21:08] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:21:08] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Running 1182 sub problems to find dead transitions.
[2024-06-01 09:21:08] [INFO ] Flow matrix only has 1173 transitions (discarded 10 similar events)
[2024-06-01 09:21:08] [INFO ] Invariant cache hit.
[2024-06-01 09:21:08] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:21:31] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2024-06-01 09:21:31] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:21:32] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-06-01 09:21:32] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-06-01 09:21:32] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2024-06-01 09:21:32] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-06-01 09:21:33] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2024-06-01 09:21:33] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-06-01 09:21:33] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:21:33] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2024-06-01 09:21:33] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:21:34] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 0 ms to minimize.
[2024-06-01 09:21:34] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-06-01 09:21:34] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2024-06-01 09:21:34] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:21:34] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:21:34] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2024-06-01 09:21:35] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-06-01 09:21:35] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-06-01 09:21:35] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:21:36] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-06-01 09:21:36] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2024-06-01 09:21:36] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-06-01 09:21:36] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:21:36] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2024-06-01 09:21:37] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-06-01 09:21:37] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:21:37] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-06-01 09:21:37] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-06-01 09:21:37] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:21:37] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2024-06-01 09:21:38] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2024-06-01 09:21:38] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 1 ms to minimize.
[2024-06-01 09:21:38] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:21:38] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2024-06-01 09:21:38] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2024-06-01 09:21:39] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-06-01 09:21:39] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:21:39] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-06-01 09:21:39] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:21:42] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-06-01 09:21:42] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2024-06-01 09:21:42] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-06-01 09:21:42] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2024-06-01 09:21:43] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-06-01 09:21:43] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:21:43] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-06-01 09:21:43] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:21:43] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:21:43] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:21:44] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
[2024-06-01 09:21:44] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2024-06-01 09:21:44] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:21:44] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2024-06-01 09:21:45] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2024-06-01 09:21:45] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:21:45] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:21:45] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:21:46] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 0 ms to minimize.
[2024-06-01 09:21:46] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:21:46] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:21:46] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-06-01 09:21:46] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:21:47] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:21:48] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:21:48] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:21:48] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2024-06-01 09:21:48] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2024-06-01 09:21:48] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2024-06-01 09:21:49] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-06-01 09:21:49] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2024-06-01 09:21:49] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-06-01 09:21:49] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-06-01 09:21:49] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:21:50] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:21:50] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2024-06-01 09:21:50] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2024-06-01 09:21:50] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-06-01 09:21:50] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-06-01 09:21:51] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:21:52] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:21:52] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 114/1287 variables, and 96 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/114 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1182/150 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:22:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-06-01 09:22:01] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:22:02] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:22:03] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:22:03] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:22:03] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:22:03] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 3 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:22:22] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-06-01 09:22:24] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 114/1287 variables, and 128 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/114 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/150 constraints, Known Traps: 127/127 constraints]
After SMT, in 77123ms problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 77137ms
Starting structural reductions in LTL mode, iteration 1 : 114/184 places, 1183/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78172 ms. Remains : 114/184 places, 1183/1267 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, true]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-10
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-10 finished in 78412 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) U (p1&&F(p2))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 183 transition count 1181
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 181 place count 98 transition count 1170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 97 transition count 1168
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 187 place count 96 transition count 1166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 94 transition count 1164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 93 transition count 1162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 196 place count 92 transition count 1161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 196 place count 92 transition count 1151
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 216 place count 82 transition count 1151
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 222 place count 76 transition count 1143
Iterating global reduction 7 with 6 rules applied. Total rules applied 228 place count 76 transition count 1143
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 243 place count 76 transition count 1128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 243 place count 76 transition count 1126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 247 place count 74 transition count 1126
Performed 27 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 301 place count 47 transition count 1091
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Iterating post reduction 8 with 505 rules applied. Total rules applied 806 place count 47 transition count 586
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 812 place count 44 transition count 583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 815 place count 44 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 519 transitions
Redundant transition composition rules discarded 519 transitions
Iterating global reduction 10 with 519 rules applied. Total rules applied 1334 place count 44 transition count 61
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 10 with 18 rules applied. Total rules applied 1352 place count 35 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1354 place count 35 transition count 52
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1359 place count 30 transition count 47
Applied a total of 1359 rules in 104 ms. Remains 30 /184 variables (removed 154) and now considering 47/1267 (removed 1220) transitions.
[2024-06-01 09:22:26] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
// Phase 1: matrix 37 rows 30 cols
[2024-06-01 09:22:26] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 09:22:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 09:22:26] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
[2024-06-01 09:22:26] [INFO ] Invariant cache hit.
[2024-06-01 09:22:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 09:22:26] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 09:22:26] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 09:22:26] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
[2024-06-01 09:22:26] [INFO ] Invariant cache hit.
[2024-06-01 09:22:26] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:22:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:22:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 36/66 variables, 30/96 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (OVERLAPS) 1/67 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/67 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 17 (OVERLAPS) 0/67 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:22:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:22:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:22:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 36/66 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/67 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/67 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 157 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 68/68 constraints]
After SMT, in 4049ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4050ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/184 places, 47/1267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4230 ms. Remains : 30/184 places, 47/1267 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-12 finished in 4399 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 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 1243
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 1243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 162 transition count 1239
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 148 transition count 1225
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 148 transition count 1225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 148 transition count 1223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 138 transition count 1213
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 138 transition count 1213
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 129 transition count 1204
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 129 transition count 1204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 124 transition count 1199
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 124 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 124 transition count 1196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 122 transition count 1194
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 122 transition count 1194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 122 transition count 1192
Applied a total of 135 rules in 34 ms. Remains 122 /184 variables (removed 62) and now considering 1192/1267 (removed 75) transitions.
[2024-06-01 09:22:30] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
// Phase 1: matrix 1182 rows 122 cols
[2024-06-01 09:22:30] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 09:22:31] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 09:22:31] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-06-01 09:22:31] [INFO ] Invariant cache hit.
[2024-06-01 09:22:31] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:22:31] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Running 1191 sub problems to find dead transitions.
[2024-06-01 09:22:31] [INFO ] Flow matrix only has 1182 transitions (discarded 10 similar events)
[2024-06-01 09:22:31] [INFO ] Invariant cache hit.
[2024-06-01 09:22:31] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:22:53] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 0 ms to minimize.
[2024-06-01 09:22:53] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:22:53] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:22:54] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2024-06-01 09:22:54] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-06-01 09:22:54] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:22:55] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-06-01 09:22:55] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 0 ms to minimize.
[2024-06-01 09:22:55] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:22:55] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:22:56] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 1 ms to minimize.
[2024-06-01 09:22:56] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:22:56] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 0 ms to minimize.
[2024-06-01 09:22:56] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-06-01 09:22:57] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-06-01 09:22:57] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2024-06-01 09:22:57] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2024-06-01 09:22:57] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2024-06-01 09:22:57] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-06-01 09:22:58] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:22:58] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-06-01 09:22:58] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-06-01 09:22:58] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-06-01 09:22:59] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:23:00] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:23:00] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:23:00] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:23:00] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2024-06-01 09:23:00] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2024-06-01 09:23:00] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2024-06-01 09:23:01] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:23:01] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2024-06-01 09:23:01] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:23:04] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 0 ms to minimize.
[2024-06-01 09:23:04] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 0 ms to minimize.
[2024-06-01 09:23:05] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-06-01 09:23:05] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2024-06-01 09:23:05] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-06-01 09:23:05] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-06-01 09:23:05] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-06-01 09:23:05] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2024-06-01 09:23:09] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2024-06-01 09:23:10] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2024-06-01 09:23:10] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 09:23:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:23:10] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2024-06-01 09:23:11] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:23:11] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:23:11] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:23:11] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:23:11] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:23:12] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:23:12] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:23:16] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-06-01 09:23:17] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-06-01 09:23:17] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-06-01 09:23:17] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-06-01 09:23:17] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
SMT process timed out in 45703ms, After SMT, problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 45718ms
Starting structural reductions in LTL mode, iteration 1 : 122/184 places, 1192/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46713 ms. Remains : 122/184 places, 1192/1267 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-13
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-13 finished in 46818 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((X(p1)&&p0))||X(X(G(p2)))))'
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 1267/1267 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 1245
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 1245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 163 transition count 1241
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 149 transition count 1227
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 149 transition count 1227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 149 transition count 1225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 87 place count 138 transition count 1214
Iterating global reduction 2 with 11 rules applied. Total rules applied 98 place count 138 transition count 1214
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 108 place count 128 transition count 1204
Iterating global reduction 2 with 10 rules applied. Total rules applied 118 place count 128 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 122 transition count 1198
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 122 transition count 1198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 122 transition count 1196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 118 transition count 1192
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 118 transition count 1192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 118 transition count 1190
Applied a total of 142 rules in 29 ms. Remains 118 /184 variables (removed 66) and now considering 1190/1267 (removed 77) transitions.
[2024-06-01 09:23:17] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
// Phase 1: matrix 1179 rows 118 cols
[2024-06-01 09:23:17] [INFO ] Computed 2 invariants in 8 ms
[2024-06-01 09:23:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 09:23:17] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-06-01 09:23:17] [INFO ] Invariant cache hit.
[2024-06-01 09:23:18] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-06-01 09:23:18] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 1189 sub problems to find dead transitions.
[2024-06-01 09:23:18] [INFO ] Flow matrix only has 1179 transitions (discarded 11 similar events)
[2024-06-01 09:23:18] [INFO ] Invariant cache hit.
[2024-06-01 09:23:18] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:23:39] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 1 ms to minimize.
[2024-06-01 09:23:39] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-06-01 09:23:39] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2024-06-01 09:23:40] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-06-01 09:23:40] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 0 ms to minimize.
[2024-06-01 09:23:40] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 0 ms to minimize.
[2024-06-01 09:23:41] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-06-01 09:23:41] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:23:41] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 0 ms to minimize.
[2024-06-01 09:23:41] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 0 ms to minimize.
[2024-06-01 09:23:42] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2024-06-01 09:23:42] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2024-06-01 09:23:42] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-06-01 09:23:42] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:23:42] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2024-06-01 09:23:43] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-06-01 09:23:43] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-06-01 09:23:43] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2024-06-01 09:23:43] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-06-01 09:23:44] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:23:44] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:23:44] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-06-01 09:23:44] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-06-01 09:23:45] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:23:45] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:23:45] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2024-06-01 09:23:45] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2024-06-01 09:23:45] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2024-06-01 09:23:46] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2024-06-01 09:23:46] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2024-06-01 09:23:46] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2024-06-01 09:23:46] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-06-01 09:23:46] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:23:47] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
[2024-06-01 09:23:47] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-06-01 09:23:47] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2024-06-01 09:23:47] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 0 ms to minimize.
[2024-06-01 09:23:48] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:23:48] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2024-06-01 09:23:48] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:23:51] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-06-01 09:23:51] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:23:51] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:23:52] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:23:52] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:23:52] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:23:56] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-06-01 09:23:57] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2024-06-01 09:23:57] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:23:57] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2024-06-01 09:23:57] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2024-06-01 09:23:57] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:23:58] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2024-06-01 09:23:58] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2024-06-01 09:23:58] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-06-01 09:23:58] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2024-06-01 09:23:58] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:24:00] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2024-06-01 09:24:01] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-01 09:24:01] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2024-06-01 09:24:01] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:24:01] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:24:02] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-06-01 09:24:03] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 0 ms to minimize.
[2024-06-01 09:24:03] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-06-01 09:24:03] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 118/1297 variables, and 94 constraints, problems are : Problem set: 0 solved, 1189 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1189/157 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:24:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:24:10] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:24:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:24:16] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2024-06-01 09:24:16] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:24:16] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:24:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2024-06-01 09:24:16] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:24:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:24:25] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:24:30] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
[2024-06-01 09:24:32] [INFO ] Deduced a trap composed of 17 places in 145 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 118/1297 variables, and 123 constraints, problems are : Problem set: 0 solved, 1189 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/118 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/157 constraints, Known Traps: 121/121 constraints]
After SMT, in 74989ms problems are : Problem set: 0 solved, 1189 unsolved
Search for dead transitions found 0 dead transitions in 75003ms
Starting structural reductions in LTL mode, iteration 1 : 118/184 places, 1190/1267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75955 ms. Remains : 118/184 places, 1190/1267 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyCommit-PT-08a-LTLCardinality-14
Stuttering criterion allowed to conclude after 17178 steps with 0 reset in 532 ms.
FORMULA StigmergyCommit-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-08a-LTLCardinality-14 finished in 76778 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((p0||X(F(p1))||G(p2))))'
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||F(G(p1)))))'
[2024-06-01 09:24:34] [INFO ] Flatten gal took : 77 ms
[2024-06-01 09:24:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 09:24:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 1267 transitions and 19054 arcs took 21 ms.
Total runtime 453391 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-08a-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-08a-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717234345622

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-08a-LTLCardinality-00
ltl formula formula --ltl=/tmp/4645/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 1267 transitions and 19054 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4645/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4645/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4645/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4645/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 186 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 1320 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~72 levels ~10000 states ~56396 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~20000 states ~137472 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~40000 states ~282352 transitions
pnml2lts-mc( 2/ 4): ~103 levels ~80000 states ~551448 transitions
pnml2lts-mc( 2/ 4): ~103 levels ~160000 states ~1164752 transitions
pnml2lts-mc( 1/ 4): ~80 levels ~320000 states ~2329908 transitions
pnml2lts-mc( 1/ 4): ~80 levels ~640000 states ~4771884 transitions
pnml2lts-mc( 2/ 4): ~103 levels ~1280000 states ~12481152 transitions
pnml2lts-mc( 1/ 4): ~85 levels ~2560000 states ~23414276 transitions
pnml2lts-mc( 1/ 4): ~85 levels ~5120000 states ~49785668 transitions
pnml2lts-mc( 2/ 4): ~103 levels ~10240000 states ~89911236 transitions
pnml2lts-mc( 1/ 4): ~85 levels ~20480000 states ~172268332 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31374324
pnml2lts-mc( 0/ 4): unique states count: 33552960
pnml2lts-mc( 0/ 4): unique transitions count: 282730809
pnml2lts-mc( 0/ 4): - self-loop count: 4000722
pnml2lts-mc( 0/ 4): - claim dead count: 227720415
pnml2lts-mc( 0/ 4): - claim found count: 17470887
pnml2lts-mc( 0/ 4): - claim success count: 33554836
pnml2lts-mc( 0/ 4): - cum. max stack depth: 360
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33555172 states 282775274 transitions, fanout: 8.427
pnml2lts-mc( 0/ 4): Total exploration time 449.100 sec (449.090 sec minimum, 449.095 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74716, Transitions per second: 629649
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.6MB, 8.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 1297 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.6MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-08a-LTLCardinality-05
ltl formula formula --ltl=/tmp/4645/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 1267 transitions and 19054 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.070 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4645/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4645/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4645/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4645/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 185 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 1292 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~75 levels ~10000 states ~65068 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~20000 states ~151524 transitions
pnml2lts-mc( 2/ 4): ~76 levels ~40000 states ~297920 transitions
pnml2lts-mc( 1/ 4): ~80 levels ~80000 states ~573292 transitions
pnml2lts-mc( 3/ 4): ~77 levels ~160000 states ~1397504 transitions
pnml2lts-mc( 3/ 4): ~80 levels ~320000 states ~2850756 transitions
pnml2lts-mc( 0/ 4): ~80 levels ~640000 states ~5619976 transitions
pnml2lts-mc( 0/ 4): ~83 levels ~1280000 states ~12271056 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~62!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 1313402
pnml2lts-mc( 0/ 4): unique transitions count: 13263733
pnml2lts-mc( 0/ 4): - self-loop count: 2303633
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 9644875
pnml2lts-mc( 0/ 4): - claim success count: 1313634
pnml2lts-mc( 0/ 4): - cum. max stack depth: 339
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1313731 states 13269534 transitions, fanout: 10.101
pnml2lts-mc( 0/ 4): Total exploration time 19.840 sec (19.840 sec minimum, 19.840 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66216, Transitions per second: 668827
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 10.3MB, 8.2 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1297 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 10.3MB (~256.0MB paged-in)

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyCommit-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531800187"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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