About the Execution of ITS-Tools for StigmergyElection-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 226672.00 | 0.00 | 0.00 | FTTTTTFFFFFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900212
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 193K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749143320971
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 17:08:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 17:08:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:08:44] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2025-06-05 17:08:44] [INFO ] Transformed 72 places.
[2025-06-05 17:08:44] [INFO ] Transformed 450 transitions.
[2025-06-05 17:08:44] [INFO ] Found NUPN structural information;
[2025-06-05 17:08:44] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyElection-PT-05a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 159/159 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 64 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 64 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 60 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 60 transition count 139
Applied a total of 24 rules in 83 ms. Remains 60 /72 variables (removed 12) and now considering 139/159 (removed 20) transitions.
[2025-06-05 17:08:44] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 60 cols
[2025-06-05 17:08:44] [INFO ] Computed 2 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:08:45] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-06-05 17:08:45] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:08:45] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:08:45] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-05 17:08:45] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:08:45] [INFO ] Invariant cache hit.
[2025-06-05 17:08:45] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:47] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:48] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:50] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:51] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:52] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:52] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:53] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 131/191 variables, 60/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:57] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:57] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:57] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:57] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 1/192 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 195 constraints, problems are : Problem set: 0 solved, 138 unsolved in 20343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:08] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:08] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:10] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:11] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 131/191 variables, 60/114 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 85/199 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 138/337 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:19] [INFO ] Deduced a trap along path composed of 7 places in 68 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:28] [INFO ] Deduced a trap along path composed of 7 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/192 variables, and 339 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 85/86 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50872ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 50906ms
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 139/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51790 ms. Remains : 60/72 places, 139/159 transitions.
Support contains 13 out of 60 places after structural reductions.
[2025-06-05 17:09:36] [INFO ] Flatten gal took : 52 ms
[2025-06-05 17:09:36] [INFO ] Flatten gal took : 23 ms
[2025-06-05 17:09:36] [INFO ] Input system was already deterministic with 139 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (176 resets) in 1305 ms. (30 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
[2025-06-05 17:09:37] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:09:37] [INFO ] Invariant cache hit.
[2025-06-05 17:09:37] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 60/192 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/60 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-05a-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-05a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(F(p0)))))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-06-05 17:09:37] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:09:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-05 17:09:37] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:09:38] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:09:38] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 362 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/60 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 50 transition count 130
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 50 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 45 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 45 transition count 125
Applied a total of 28 rules in 10 ms. Remains 45 /59 variables (removed 14) and now considering 125/139 (removed 14) transitions.
[2025-06-05 17:09:38] [INFO ] Flow matrix only has 118 transitions (discarded 7 similar events)
// Phase 1: matrix 118 rows 45 cols
[2025-06-05 17:09:38] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:09:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 17:09:38] [INFO ] Flow matrix only has 118 transitions (discarded 7 similar events)
[2025-06-05 17:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:09:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:09:38] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/60 places, 125/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 589 ms. Remains : 45/60 places, 125/139 transitions.
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 625 ms.
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 27 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05a-LTLFireability-01 finished in 2087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(X((!p0||X(G(!p0)))))&&(!p0 U (p1||G(!p0)))))))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 9 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:09:39] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:09:39] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:09:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 17:09:39] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:09:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:09:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:09:40] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-05 17:09:40] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:09:40] [INFO ] Invariant cache hit.
[2025-06-05 17:09:40] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:41] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:41] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:41] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:42] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:43] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:44] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:45] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:45] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:45] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:45] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:46] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:46] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:46] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:47] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:47] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:47] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 128/186 variables, 58/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 1/187 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:53] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:09:58] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/187 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 16 (OVERLAPS) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 196 constraints, problems are : Problem set: 0 solved, 134 unsolved in 25207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 128/186 variables, 58/110 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 85/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 134/329 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:12] [INFO ] Deduced a trap along path composed of 7 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:20] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/187 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/187 variables, and 332 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55376ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 55379ms
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 135/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55649 ms. Remains : 58/60 places, 135/139 transitions.
Stuttering acceptance computed with spot in 418 ms :[(AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Product exploration explored 100000 steps with 33333 reset in 491 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 23 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05a-LTLFireability-02 finished in 56865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 9 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:10:36] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-05 17:10:36] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:36] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:10:37] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 135/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 47 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 47 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 42 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 42 transition count 120
Applied a total of 30 rules in 7 ms. Remains 42 /57 variables (removed 15) and now considering 120/135 (removed 15) transitions.
[2025-06-05 17:10:37] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 42 cols
[2025-06-05 17:10:37] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 17:10:37] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
[2025-06-05 17:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:10:37] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/60 places, 120/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 42/60 places, 120/139 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-03
Product exploration explored 100000 steps with 14300 reset in 301 ms.
Product exploration explored 100000 steps with 14155 reset in 314 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2025-06-05 17:10:38] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
[2025-06-05 17:10:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:10:38] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 17:10:38] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-06-05 17:10:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:10:38] [INFO ] [Real]Added 66 Read/Feed constraints in 19 ms returned sat
[2025-06-05 17:10:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:10:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 17:10:39] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-05 17:10:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2025-06-05 17:10:39] [INFO ] Computed and/alt/rep : 35/40/35 causal constraints (skipped 78 transitions) in 22 ms.
[2025-06-05 17:10:39] [INFO ] Added : 18 causal constraints over 4 iterations in 116 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 41 transition count 109
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 31 transition count 109
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 21 transition count 99
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 71 place count 21 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 21 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 16 transition count 58
Applied a total of 86 rules in 58 ms. Remains 16 /42 variables (removed 26) and now considering 58/120 (removed 62) transitions.
[2025-06-05 17:10:39] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2025-06-05 17:10:39] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 17:10:39] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:10:39] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:10:39] [INFO ] Redundant transitions in 2 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-05 17:10:39] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:10:39] [INFO ] Invariant cache hit.
[2025-06-05 17:10:39] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 51/67 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/68 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:41] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:41] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:42] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:42] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:42] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:42] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 74 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8723ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 8724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/42 places, 58/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8890 ms. Remains : 16/42 places, 58/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2025-06-05 17:10:48] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:10:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:10:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 17:10:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-05 17:10:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:10:48] [INFO ] [Real]Added 41 Read/Feed constraints in 11 ms returned sat
[2025-06-05 17:10:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:10:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 17:10:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 17:10:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2025-06-05 17:10:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 47 transitions) in 14 ms.
[2025-06-05 17:10:49] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 430 ms.
Product exploration explored 100000 steps with 16666 reset in 484 ms.
Built C files in :
/tmp/ltsmin5410011756718731361
[2025-06-05 17:10:50] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2025-06-05 17:10:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:10:50] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2025-06-05 17:10:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:10:50] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2025-06-05 17:10:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:10:50] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5410011756718731361
Running compilation step : cd /tmp/ltsmin5410011756718731361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 639 ms.
Running link step : cd /tmp/ltsmin5410011756718731361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin5410011756718731361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13528264258154608817.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05a-LTLFireability-03 finished in 14269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(!p1 U X(X(X(!p1)))))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 11 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:10:51] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:10:51] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 17:10:51] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:51] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:10:51] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 135/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 47 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 47 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 42 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 42 transition count 120
Applied a total of 30 rules in 11 ms. Remains 42 /57 variables (removed 15) and now considering 120/135 (removed 15) transitions.
[2025-06-05 17:10:51] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 42 cols
[2025-06-05 17:10:51] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-05 17:10:51] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
[2025-06-05 17:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:10:51] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/60 places, 120/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 42/60 places, 120/139 transitions.
Stuttering acceptance computed with spot in 637 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, p1, p1, true, p1, p1, p1, p1, p1]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-06
Stuttering criterion allowed to conclude after 21 steps with 2 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-06 finished in 1176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((p0 U G(p0)) U X(X(!p0))) U p0))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 9 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:10:52] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:10:52] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 17:10:52] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:52] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:10:52] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 342 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 135/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 47 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 47 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 42 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 42 transition count 120
Applied a total of 30 rules in 7 ms. Remains 42 /57 variables (removed 15) and now considering 120/135 (removed 15) transitions.
[2025-06-05 17:10:52] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 42 cols
[2025-06-05 17:10:52] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 17:10:52] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
[2025-06-05 17:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:52] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:10:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/60 places, 120/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 506 ms. Remains : 42/60 places, 120/139 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, true, (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-08 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 58 transition count 128
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 128
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 48 transition count 121
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 35 place count 41 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 45 place count 31 transition count 110
Iterating global reduction 2 with 10 rules applied. Total rules applied 55 place count 31 transition count 110
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 70 place count 31 transition count 95
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 70 place count 31 transition count 91
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 27 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 26 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 26 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 96 place count 26 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 21 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 111 place count 21 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 121 place count 16 transition count 58
Applied a total of 121 rules in 52 ms. Remains 16 /60 variables (removed 44) and now considering 58/139 (removed 81) transitions.
[2025-06-05 17:10:52] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2025-06-05 17:10:52] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 17:10:53] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:10:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:10:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:10:53] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:10:53] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-05 17:10:53] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:10:53] [INFO ] Invariant cache hit.
[2025-06-05 17:10:53] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:53] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 51/67 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/68 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:56] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 74 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:57] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:57] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8891ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 8892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/60 places, 58/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9047 ms. Remains : 16/60 places, 58/139 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-09 finished in 9114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((G(p1)&&p0)) U G((p1||X(p1)))))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:11:02] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:02] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:11:02] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 313 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 135/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 47 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 47 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 42 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 42 transition count 120
Applied a total of 30 rules in 4 ms. Remains 42 /57 variables (removed 15) and now considering 120/135 (removed 15) transitions.
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 42 cols
[2025-06-05 17:11:02] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
[2025-06-05 17:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:11:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/60 places, 120/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 459 ms. Remains : 42/60 places, 120/139 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-10
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-10 finished in 821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 58 transition count 128
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 128
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 21 place count 48 transition count 122
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 42 transition count 122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 32 transition count 111
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 32 transition count 111
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 68 place count 32 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 68 place count 32 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 76 place count 28 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 86 place count 23 transition count 87
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 91 place count 23 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 101 place count 18 transition count 77
Applied a total of 101 rules in 40 ms. Remains 18 /60 variables (removed 42) and now considering 77/139 (removed 62) transitions.
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
// Phase 1: matrix 71 rows 18 cols
[2025-06-05 17:11:02] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2025-06-05 17:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-05 17:11:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:11:02] [INFO ] Redundant transitions in 3 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-05 17:11:02] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2025-06-05 17:11:02] [INFO ] Invariant cache hit.
[2025-06-05 17:11:02] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 5/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 70/88 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 55/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/89 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 99 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 5/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 70/88 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 55/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 72/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 171 constraints, problems are : Problem set: 0 solved, 72 unsolved in 6310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11984ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 11985ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/60 places, 77/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12124 ms. Remains : 18/60 places, 77/139 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-12 finished in 12188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:11:15] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:11:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 17:11:15] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:11:15] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:11:15] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-05 17:11:15] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:11:15] [INFO ] Invariant cache hit.
[2025-06-05 17:11:15] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:16] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:18] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:19] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:19] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:19] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:19] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:19] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:20] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:20] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:20] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:20] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:21] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:21] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:21] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:21] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 128/186 variables, 58/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 1/187 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:26] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:27] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:27] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:30] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/187 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 16 (OVERLAPS) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 196 constraints, problems are : Problem set: 0 solved, 134 unsolved in 20290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 128/186 variables, 58/110 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 85/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 134/329 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:43] [INFO ] Deduced a trap along path composed of 7 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:50] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/187 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/187 variables, and 332 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50437ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 50439ms
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 135/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50655 ms. Remains : 58/60 places, 135/139 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-13 finished in 50855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 58 transition count 128
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 128
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 48 transition count 121
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 41 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 45 place count 31 transition count 110
Iterating global reduction 2 with 10 rules applied. Total rules applied 55 place count 31 transition count 110
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 70 place count 31 transition count 95
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 70 place count 31 transition count 91
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 27 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 26 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 26 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 96 place count 26 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 21 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 111 place count 21 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 121 place count 16 transition count 58
Applied a total of 121 rules in 34 ms. Remains 16 /60 variables (removed 44) and now considering 58/139 (removed 81) transitions.
[2025-06-05 17:12:05] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2025-06-05 17:12:05] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-05 17:12:05] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:12:06] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:12:06] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-05 17:12:06] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:06] [INFO ] Invariant cache hit.
[2025-06-05 17:12:06] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:06] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 51/67 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/68 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:09] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 74 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8817ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 8818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/60 places, 58/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8968 ms. Remains : 16/60 places, 58/139 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-14
Product exploration explored 100000 steps with 16666 reset in 489 ms.
Product exploration explored 100000 steps with 16666 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2025-06-05 17:12:16] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:12:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 17:12:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-05 17:12:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:12:16] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2025-06-05 17:12:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:12:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 17:12:16] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 17:12:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2025-06-05 17:12:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 47 transitions) in 9 ms.
[2025-06-05 17:12:16] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 16 /16 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-06-05 17:12:16] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:16] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-05 17:12:16] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:12:16] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:12:16] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-05 17:12:16] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:16] [INFO ] Invariant cache hit.
[2025-06-05 17:12:16] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:17] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 51/67 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/68 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:18] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 74 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:12:21] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8443ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 8444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8546 ms. Remains : 16/16 places, 58/58 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2025-06-05 17:12:25] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-05 17:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:12:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 17:12:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-05 17:12:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 17:12:25] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2025-06-05 17:12:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:12:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 17:12:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 17:12:25] [INFO ] [Nat]Added 41 Read/Feed constraints in 14 ms returned sat
[2025-06-05 17:12:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 47 transitions) in 9 ms.
[2025-06-05 17:12:25] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 520 ms.
Product exploration explored 100000 steps with 16666 reset in 257 ms.
Built C files in :
/tmp/ltsmin16595395733799856509
[2025-06-05 17:12:26] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2025-06-05 17:12:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:12:26] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2025-06-05 17:12:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:12:26] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2025-06-05 17:12:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:12:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16595395733799856509
Running compilation step : cd /tmp/ltsmin16595395733799856509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin16595395733799856509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16595395733799856509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7913474270575697913.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05a-LTLFireability-14 finished in 21081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 139/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 135
Applied a total of 4 rules in 2 ms. Remains 58 /60 variables (removed 2) and now considering 135/139 (removed 4) transitions.
[2025-06-05 17:12:26] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:12:26] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 17:12:27] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:12:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:27] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:12:27] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 252 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 135/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 48 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 48 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 43 transition count 121
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 43 transition count 121
Applied a total of 28 rules in 2 ms. Remains 43 /57 variables (removed 14) and now considering 121/135 (removed 14) transitions.
[2025-06-05 17:12:27] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
// Phase 1: matrix 115 rows 43 cols
[2025-06-05 17:12:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 17:12:27] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
[2025-06-05 17:12:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:12:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/60 places, 121/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 43/60 places, 121/139 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-15 finished in 535 ms.
All properties solved by simple procedures.
Total runtime 223881 ms.
BK_STOP 1749143547643
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-05a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490900212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05a.tgz
mv StigmergyElection-PT-05a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;