About the Execution of ITS-Tools for StigmergyElection-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 111397.00 | 0.00 | 0.00 | TFFFTFFFTFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900195.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-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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.7K 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 71K 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-04a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-04a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749137876910
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 15:37:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:37:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:37:59] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2025-06-05 15:37:59] [INFO ] Transformed 58 places.
[2025-06-05 15:37:59] [INFO ] Transformed 218 transitions.
[2025-06-05 15:37:59] [INFO ] Found NUPN structural information;
[2025-06-05 15:38:00] [INFO ] Parsed PT model containing 58 places and 218 transitions and 1238 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyElection-PT-04a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 108/108 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 53 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 53 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 99
Applied a total of 12 rules in 41 ms. Remains 52 /58 variables (removed 6) and now considering 99/108 (removed 9) transitions.
[2025-06-05 15:38:00] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
// Phase 1: matrix 92 rows 52 cols
[2025-06-05 15:38:00] [INFO ] Computed 2 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:00] [INFO ] Implicit Places using invariants in 400 ms returned []
[2025-06-05 15:38:00] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
[2025-06-05 15:38:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-05 15:38:01] [INFO ] Implicit Places using invariants and state equation in 298 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 775 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/58 places, 99/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 854 ms. Remains : 51/58 places, 99/108 transitions.
Support contains 16 out of 51 places after structural reductions.
[2025-06-05 15:38:01] [INFO ] Flatten gal took : 59 ms
[2025-06-05 15:38:01] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:38:01] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 658 steps (2 resets) in 159 ms. (4 steps per ms) remains 0/10 properties
FORMULA StigmergyElection-PT-04a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 9 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' '!(X(F(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 45 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 39 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 39 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 37 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 37 transition count 80
Applied a total of 28 rules in 14 ms. Remains 37 /51 variables (removed 14) and now considering 80/99 (removed 19) transitions.
[2025-06-05 15:38:02] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
// Phase 1: matrix 75 rows 37 cols
[2025-06-05 15:38:02] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:02] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 15:38:02] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2025-06-05 15:38:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:02] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 15:38:02] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-05 15:38:02] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2025-06-05 15:38:02] [INFO ] Invariant cache hit.
[2025-06-05 15:38:02] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:03] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:03] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:03] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:04] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:04] [INFO ] Deduced a trap composed of 9 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 15:38:04] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:04] [INFO ] Deduced a trap composed of 9 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 15:38:04] [INFO ] Deduced a trap composed of 9 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 15:38:04] [INFO ] Deduced a trap composed of 10 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 15:38:04] [INFO ] Deduced a trap composed of 9 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 15:38:04] [INFO ] Deduced a trap composed of 9 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 15:38:04] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:04] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:04] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:04] [INFO ] Deduced a trap composed of 12 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 15:38:04] [INFO ] Deduced a trap composed of 12 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 15:38:04] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:05] [INFO ] Deduced a trap composed of 10 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 15:38:05] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:06] [INFO ] Deduced a trap composed of 9 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 15:38:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:06] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:07] [INFO ] Deduced a trap composed of 9 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 15:38:07] [INFO ] Deduced a trap composed of 9 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 15:38:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 74/111 variables, 37/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 32/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 1/112 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (OVERLAPS) 0/112 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 99 constraints, problems are : Problem set: 0 solved, 79 unsolved in 9805 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:13] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 74/111 variables, 37/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 32/99 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 79/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:16] [INFO ] Deduced a trap along path composed of 6 places in 91 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:16] [INFO ] Deduced a trap along path composed of 7 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:16] [INFO ] Deduced a trap along path composed of 6 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:17] [INFO ] Deduced a trap along path composed of 6 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/112 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/112 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 183 constraints, problems are : Problem set: 0 solved, 79 unsolved in 19371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 29365ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 29381ms
Starting structural reductions in LTL mode, iteration 1 : 37/51 places, 80/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29623 ms. Remains : 37/51 places, 80/99 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLCardinality-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLCardinality-01 finished in 29949 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' '!(G(F(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 50 transition count 83
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 35 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 30 place count 35 transition count 77
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 42 place count 29 transition count 77
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 25 transition count 70
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 25 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 25 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 25 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 24 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 23 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 23 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 61 place count 23 transition count 60
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 69 place count 19 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 73 place count 19 transition count 52
Performed 2 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 17 transition count 64
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 93 place count 17 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 16 transition count 58
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 107 place count 16 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 109 place count 15 transition count 56
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 121 place count 15 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 134 place count 15 transition count 31
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 138 place count 11 transition count 27
Applied a total of 138 rules in 41 ms. Remains 11 /51 variables (removed 40) and now considering 27/99 (removed 72) transitions.
[2025-06-05 15:38:32] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 11 cols
[2025-06-05 15:38:32] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-05 15:38:32] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-05 15:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:38:32] [INFO ] Redundant transitions in 1 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-05 15:38:32] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-05 15:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 5 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 15:38:32] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/32 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/32 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 37 constraints, problems are : Problem set: 0 solved, 11 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 1042ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/51 places, 27/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1169 ms. Remains : 11/51 places, 27/99 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 143 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 49 steps (5 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2025-06-05 15:38:34] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-05 15:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-05 15:38:34] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-05 15:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:38:34] [INFO ] Redundant transitions in 1 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-05 15:38:34] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-05 15:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:34] [INFO ] Deduced a trap composed of 3 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 15:38:34] [INFO ] Deduced a trap composed of 3 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 15:38:34] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 5 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 15:38:35] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:35] [INFO ] Deduced a trap composed of 3 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 15:38:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/32 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/32 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 37 constraints, problems are : Problem set: 0 solved, 11 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1243ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 1244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1352 ms. Remains : 11/11 places, 27/27 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 201 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 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34 steps (4 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 343 ms.
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLCardinality-02 finished in 5028 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(G((p0||(X(X(!p1)) U ((!p1&&X(X(!p1)))||X(X(G(!p1))))))))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 45 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 40 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 40 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 38 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 38 transition count 81
Applied a total of 26 rules in 11 ms. Remains 38 /51 variables (removed 13) and now considering 81/99 (removed 18) transitions.
[2025-06-05 15:38:37] [INFO ] Flow matrix only has 76 transitions (discarded 5 similar events)
// Phase 1: matrix 76 rows 38 cols
[2025-06-05 15:38:37] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 15:38:37] [INFO ] Flow matrix only has 76 transitions (discarded 5 similar events)
[2025-06-05 15:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:38:37] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 15:38:37] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-05 15:38:37] [INFO ] Flow matrix only has 76 transitions (discarded 5 similar events)
[2025-06-05 15:38:37] [INFO ] Invariant cache hit.
[2025-06-05 15:38:37] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:37] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 9 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 15:38:38] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:39] [INFO ] Deduced a trap composed of 9 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 15:38:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:39] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 75/113 variables, 38/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:40] [INFO ] Deduced a trap composed of 9 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 15:38:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 97 constraints, problems are : Problem set: 0 solved, 80 unsolved in 9398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/113 variables, 38/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 32/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 80/176 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:49] [INFO ] Deduced a trap along path composed of 6 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:49] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:53] [INFO ] Deduced a trap along path composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/114 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:38:59] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 181 constraints, problems are : Problem set: 0 solved, 80 unsolved in 22170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 31631ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 31633ms
Starting structural reductions in LTL mode, iteration 1 : 38/51 places, 81/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31798 ms. Remains : 38/51 places, 81/99 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Running random walk in product with property : StigmergyElection-PT-04a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLCardinality-03 finished in 32073 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 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 50 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 38 transition count 86
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 24 place count 38 transition count 80
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 36 place count 32 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 29 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 29 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 29 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 43 place count 29 transition count 73
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 28 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 26 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 26 transition count 69
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 55 place count 26 transition count 63
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 23 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 23 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 22 transition count 63
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 74 place count 22 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 76 place count 21 transition count 65
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 88 place count 21 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 90 place count 20 transition count 63
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 102 place count 20 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 104 place count 19 transition count 61
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 116 place count 19 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 129 place count 19 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 19 transition count 36
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 133 place count 16 transition count 33
Applied a total of 133 rules in 45 ms. Remains 16 /51 variables (removed 35) and now considering 33/99 (removed 66) transitions.
[2025-06-05 15:39:09] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
// Phase 1: matrix 28 rows 16 cols
[2025-06-05 15:39:09] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 15:39:09] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
[2025-06-05 15:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-05 15:39:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:39:09] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-05 15:39:09] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
[2025-06-05 15:39:09] [INFO ] Invariant cache hit.
[2025-06-05 15:39:09] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:09] [INFO ] Deduced a trap composed of 8 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 15:39:09] [INFO ] Deduced a trap composed of 5 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 15:39:09] [INFO ] Deduced a trap composed of 5 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 15:39:09] [INFO ] Deduced a trap composed of 3 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 15:39:09] [INFO ] Deduced a trap composed of 3 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 15:39:09] [INFO ] Deduced a trap composed of 3 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 15:39:09] [INFO ] Deduced a trap composed of 3 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 15:39:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:09] [INFO ] Deduced a trap composed of 3 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 15:39:10] [INFO ] Deduced a trap composed of 3 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 15:39:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 27/43 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 40 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:11] [INFO ] Deduced a trap composed of 5 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 15:39:11] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 27/43 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 74 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3492ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3493ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/51 places, 33/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3646 ms. Remains : 16/51 places, 33/99 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLCardinality-09
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLCardinality-09 finished in 3717 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 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 50 transition count 82
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 34 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 32 place count 34 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 29 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 26 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 26 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 26 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 26 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 25 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 24 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 24 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 59 place count 24 transition count 62
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 69 place count 19 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 73 place count 19 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 18 transition count 63
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 87 place count 18 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 89 place count 17 transition count 61
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 101 place count 17 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 103 place count 16 transition count 59
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 115 place count 16 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 128 place count 16 transition count 34
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 132 place count 12 transition count 30
Applied a total of 132 rules in 29 ms. Remains 12 /51 variables (removed 39) and now considering 30/99 (removed 69) transitions.
[2025-06-05 15:39:12] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 12 cols
[2025-06-05 15:39:13] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 15:39:13] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-05 15:39:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:39:13] [INFO ] Redundant transitions in 1 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-05 15:39:13] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-05 15:39:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:13] [INFO ] Deduced a trap composed of 3 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 15:39:13] [INFO ] Deduced a trap composed of 3 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 15:39:13] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:13] [INFO ] Deduced a trap composed of 6 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 15:39:13] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:13] [INFO ] Deduced a trap composed of 3 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 15:39:13] [INFO ] Deduced a trap composed of 3 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 15:39:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 23/35 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 14 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 23/35 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/36 variables, and 38 constraints, problems are : Problem set: 0 solved, 14 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 1089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/51 places, 30/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1197 ms. Remains : 12/51 places, 30/99 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLCardinality-10 finished in 1256 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(((X(X(X(!p0)))&&F(!p1))||G(!p0))))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 45 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 41 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 41 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 40 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 40 transition count 86
Applied a total of 22 rules in 5 ms. Remains 40 /51 variables (removed 11) and now considering 86/99 (removed 13) transitions.
[2025-06-05 15:39:14] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
// Phase 1: matrix 80 rows 40 cols
[2025-06-05 15:39:14] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 15:39:14] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
[2025-06-05 15:39:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:39:14] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 15:39:14] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-05 15:39:14] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
[2025-06-05 15:39:14] [INFO ] Invariant cache hit.
[2025-06-05 15:39:14] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:15] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:15] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:15] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:15] [INFO ] Deduced a trap composed of 9 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 15:39:15] [INFO ] Deduced a trap composed of 11 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 15:39:15] [INFO ] Deduced a trap composed of 12 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 15:39:15] [INFO ] Deduced a trap composed of 11 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 15:39:15] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:15] [INFO ] Deduced a trap composed of 12 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 15:39:15] [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 15:39:15] [INFO ] Deduced a trap composed of 9 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 15:39:15] [INFO ] Deduced a trap composed of 9 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 15:39:15] [INFO ] Deduced a trap composed of 9 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 15:39:15] [INFO ] Deduced a trap composed of 11 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 15:39:15] [INFO ] Deduced a trap composed of 12 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 15:39:15] [INFO ] Deduced a trap composed of 12 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 15:39:15] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:16] [INFO ] Deduced a trap composed of 9 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 15:39:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:16] [INFO ] Deduced a trap composed of 9 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 15:39:16] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:17] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 79/119 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 32/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/120 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:20] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/120 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 100 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8984 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 79/119 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 32/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 85/185 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:27] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:28] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:39:31] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 1/120 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/120 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 189 constraints, problems are : Problem set: 0 solved, 85 unsolved in 24326 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33356ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 33357ms
Starting structural reductions in LTL mode, iteration 1 : 40/51 places, 86/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33485 ms. Remains : 40/51 places, 86/99 transitions.
Stuttering acceptance computed with spot in 525 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0]
Running random walk in product with property : StigmergyElection-PT-04a-LTLCardinality-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLCardinality-11 finished in 34038 ms.
All properties solved by simple procedures.
Total runtime 108704 ms.
BK_STOP 1749137988307
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-04a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-04a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490900195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04a.tgz
mv StigmergyElection-PT-04a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;