About the Execution of ITS-Tools for StigmergyElection-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 433820.00 | 0.00 | 0.00 | FFTTTFFFFTTTTTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900210.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is StigmergyElection-PT-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900210
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 193K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2023-15
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-00
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-01
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-02
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-03
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-04
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-05
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-06
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-07
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-08
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-09
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-10
FORMULA_NAME StigmergyElection-PT-05a-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749142873790
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 17:01:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 17:01:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:01:16] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2025-06-05 17:01:16] [INFO ] Transformed 72 places.
[2025-06-05 17:01:16] [INFO ] Transformed 450 transitions.
[2025-06-05 17:01:16] [INFO ] Found NUPN structural information;
[2025-06-05 17:01:16] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
Support contains 42 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 159/159 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 70 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 157
Applied a total of 4 rules in 39 ms. Remains 70 /72 variables (removed 2) and now considering 157/159 (removed 2) transitions.
[2025-06-05 17:01:17] [INFO ] Flow matrix only has 144 transitions (discarded 13 similar events)
// Phase 1: matrix 144 rows 70 cols
[2025-06-05 17:01:17] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:01:17] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-05 17:01:17] [INFO ] Flow matrix only has 144 transitions (discarded 13 similar events)
[2025-06-05 17:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:01:17] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:01:17] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-05 17:01:17] [INFO ] Flow matrix only has 144 transitions (discarded 13 similar events)
[2025-06-05 17:01:17] [INFO ] Invariant cache hit.
[2025-06-05 17:01:17] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 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 17:01:20] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:20] [INFO ] Deduced a trap composed of 12 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 17:01:21] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [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 17:01:22] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:22] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 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 17:01:23] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:23] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 143/213 variables, 70/113 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 85/198 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:27] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:29] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 1/214 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (OVERLAPS) 0/214 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 201 constraints, problems are : Problem set: 0 solved, 156 unsolved in 23058 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:42] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 143/213 variables, 70/116 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 85/201 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 156/357 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:49] [INFO ] Deduced a trap along path composed of 9 places in 56 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:01:49] [INFO ] Deduced a trap along path composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 1/214 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:05] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/214 variables, and 361 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 53547ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 53574ms
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 157/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54394 ms. Remains : 70/72 places, 157/159 transitions.
Support contains 42 out of 70 places after structural reductions.
[2025-06-05 17:02:11] [INFO ] Flatten gal took : 63 ms
[2025-06-05 17:02:11] [INFO ] Flatten gal took : 31 ms
[2025-06-05 17:02:12] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 40 out of 70 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 56 to 46
RANDOM walk for 40000 steps (160 resets) in 3499 ms. (11 steps per ms) remains 11/46 properties
BEST_FIRST walk for 40004 steps (71 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (81 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (71 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (91 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 284 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (96 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (74 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (91 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (217 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 11/11 properties
[2025-06-05 17:02:13] [INFO ] Flow matrix only has 144 transitions (discarded 13 similar events)
[2025-06-05 17:02:13] [INFO ] Invariant cache hit.
[2025-06-05 17:02:13] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/70 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 143/213 variables, 70/74 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 85/159 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/159 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/214 variables, 1/160 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/160 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/160 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 160 constraints, problems are : Problem set: 6 solved, 5 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/70 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:14] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:14] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:14] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:14] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Problem AtomicPropp34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:14] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 7 ms to minimize.
Problem AtomicPropp36 is UNSAT
After SMT solving in domain Int declared 70/214 variables, and 10 constraints, problems are : Problem set: 11 solved, 0 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/70 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1020ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 17:02:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 17:02:14] [INFO ] Flatten gal took : 38 ms
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 17:02:14] [INFO ] Flatten gal took : 29 ms
[2025-06-05 17:02:14] [INFO ] Input system was already deterministic with 157 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 58 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 58 transition count 135
Applied a total of 24 rules in 11 ms. Remains 58 /70 variables (removed 12) and now considering 135/157 (removed 22) transitions.
[2025-06-05 17:02:14] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:02:15] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 17:02:15] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:15] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:02:15] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 218 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/70 places, 135/157 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 47 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 47 transition count 125
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 43 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 43 transition count 121
Applied a total of 28 rules in 7 ms. Remains 43 /57 variables (removed 14) and now considering 121/135 (removed 14) transitions.
[2025-06-05 17:02:15] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
// Phase 1: matrix 115 rows 43 cols
[2025-06-05 17:02:15] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 17:02:15] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
[2025-06-05 17:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:02:15] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/70 places, 121/157 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 43/70 places, 121/157 transitions.
[2025-06-05 17:02:15] [INFO ] Flatten gal took : 13 ms
[2025-06-05 17:02:15] [INFO ] Flatten gal took : 12 ms
[2025-06-05 17:02:15] [INFO ] Input system was already deterministic with 121 transitions.
[2025-06-05 17:02:15] [INFO ] Flatten gal took : 12 ms
[2025-06-05 17:02:15] [INFO ] Flatten gal took : 12 ms
[2025-06-05 17:02:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4625704326943133154.gal : 4 ms
[2025-06-05 17:02:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8020318714887824574.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4625704326943133154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8020318714887824574.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3379,0.082381,5296,2,555,5,3927,6,0,287,3131,0
Converting to forward existential form...Done !
original formula: EG(AG(EF((AX((p28==0)) + AG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(p68==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (!(EX(!((p28==0)))) + !(E(TRUE U !(((((p12==0)||(p26==0))||((p40==0)||(p54==0))...186
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t34, t36, t37, t38, t42,...285
(forward)formula 0,1,0.393699,14256,1,0,210,35897,263,75,2975,28152,295
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 58 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 58 transition count 135
Applied a total of 24 rules in 7 ms. Remains 58 /70 variables (removed 12) and now considering 135/157 (removed 22) transitions.
[2025-06-05 17:02:15] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:02:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 17:02:15] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:16] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:02:16] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-05 17:02:16] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:02:16] [INFO ] Invariant cache hit.
[2025-06-05 17:02:16] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:17] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:17] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:17] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:17] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 13 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 17:02:18] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:18] [INFO ] Deduced a trap composed of 10 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 17:02:19] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:19] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [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 17:02:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:21] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:21] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:21] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:21] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:21] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:22] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:22] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:23] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:23] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 128/186 variables, 58/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 1/187 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:28] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:28] [INFO ] Deduced a trap composed of 10 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 17:02:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/187 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 16 (OVERLAPS) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 196 constraints, problems are : Problem set: 0 solved, 134 unsolved in 21860 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 128/186 variables, 58/110 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 85/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 134/329 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:45] [INFO ] Deduced a trap along path composed of 7 places in 72 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:02:52] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/187 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/187 variables, and 332 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52069ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 52071ms
Starting structural reductions in LTL mode, iteration 1 : 58/70 places, 135/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52304 ms. Remains : 58/70 places, 135/157 transitions.
[2025-06-05 17:03:08] [INFO ] Flatten gal took : 17 ms
[2025-06-05 17:03:08] [INFO ] Flatten gal took : 16 ms
[2025-06-05 17:03:08] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-05 17:03:08] [INFO ] Flatten gal took : 14 ms
[2025-06-05 17:03:08] [INFO ] Flatten gal took : 15 ms
[2025-06-05 17:03:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11023343841120234547.gal : 5 ms
[2025-06-05 17:03:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10158147560707086217.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11023343841120234547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10158147560707086217.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4169,0.109808,5572,2,745,5,5386,6,0,359,3478,0
Converting to forward existential form...Done !
original formula: EX(EG(((((AF(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(p68==0))) + (p12==0)) + ((p26==0)||(p40==0))) + ((p54==0)||(p68==0))) * (AX(...243
=> equivalent forward existential formula: [FwdG(EY(Init),((((!(EG(!(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(p68==0))))) + (p12==0)) + ((p26==0)||(...298
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...335
(forward)formula 0,0,0.540312,14660,1,0,253,40088,294,102,3099,37055,317
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 59 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 59 transition count 137
Applied a total of 22 rules in 9 ms. Remains 59 /70 variables (removed 11) and now considering 137/157 (removed 20) transitions.
[2025-06-05 17:03:08] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
// Phase 1: matrix 131 rows 59 cols
[2025-06-05 17:03:08] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:08] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 17:03:08] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
[2025-06-05 17:03:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:09] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:03:09] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 349 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/70 places, 137/157 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 49 transition count 128
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 49 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 44 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 44 transition count 123
Applied a total of 28 rules in 7 ms. Remains 44 /58 variables (removed 14) and now considering 123/137 (removed 14) transitions.
[2025-06-05 17:03:09] [INFO ] Flow matrix only has 117 transitions (discarded 6 similar events)
// Phase 1: matrix 117 rows 44 cols
[2025-06-05 17:03:09] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 17:03:09] [INFO ] Flow matrix only has 117 transitions (discarded 6 similar events)
[2025-06-05 17:03:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:03:09] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 44/70 places, 123/157 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 501 ms. Remains : 44/70 places, 123/157 transitions.
[2025-06-05 17:03:09] [INFO ] Flatten gal took : 11 ms
[2025-06-05 17:03:09] [INFO ] Flatten gal took : 12 ms
[2025-06-05 17:03:09] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-05 17:03:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 17:03:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 17:03:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3964643980410678496.gal : 3 ms
[2025-06-05 17:03:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12141074486232329447.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3964643980410678496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12141074486232329447.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3890,0.061846,5072,2,511,5,3259,6,0,293,2061,0
Converting to forward existential form...Done !
original formula: EF((((AX((((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))||(p68!=1))&&(p48!=1))) * (p12==1)) * ((p26==1)&&(p40==1))) * ((p54==1)&&(p68==1))...157
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((p54==1)&&(p68==1))) * ((p26==1)&&(p40==1))) * (p12==1)) * !(EX(!((((((p12!=1)||(p26!=1)...215
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t29, t30,...315
(forward)formula 0,0,0.207286,8400,1,0,203,18719,259,64,2771,13211,249
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 147
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 59 transition count 147
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 19 place count 59 transition count 133
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 47 place count 45 transition count 133
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 59 place count 33 transition count 116
Iterating global reduction 2 with 12 rules applied. Total rules applied 71 place count 33 transition count 116
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 28 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 28 transition count 106
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 96 place count 28 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 28 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 111 place count 23 transition count 81
Applied a total of 111 rules in 61 ms. Remains 23 /70 variables (removed 47) and now considering 81/157 (removed 76) transitions.
[2025-06-05 17:03:09] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
// Phase 1: matrix 75 rows 23 cols
[2025-06-05 17:03:09] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 17:03:09] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2025-06-05 17:03:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:09] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-05 17:03:09] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:03:09] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-05 17:03:09] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2025-06-05 17:03:09] [INFO ] Invariant cache hit.
[2025-06-05 17:03:09] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 5/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 6 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 17:03:10] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 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 17:03:10] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:10] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:12] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 74/97 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:12] [INFO ] Deduced a trap composed of 4 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 17:03:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:12] [INFO ] Deduced a trap composed of 4 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 17:03:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 1/98 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 104 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 5/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 74/97 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 76/181 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 182 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12986ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 12987ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/70 places, 81/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13150 ms. Remains : 23/70 places, 81/157 transitions.
[2025-06-05 17:03:22] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:03:22] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:03:22] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-05 17:03:22] [INFO ] Flatten gal took : 7 ms
[2025-06-05 17:03:22] [INFO ] Flatten gal took : 6 ms
[2025-06-05 17:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7657493969481749963.gal : 2 ms
[2025-06-05 17:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12076464868380524313.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7657493969481749963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12076464868380524313.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,105,0.034349,4672,2,171,5,1095,6,0,168,728,0
Converting to forward existential form...Done !
original formula: E(!(EG(!(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)))))) U AG((p31==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))))))))) * !(E(TRUE U !((p31==1...170
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t15, t16, t24, t26, t28, t30, t32, In...250
(forward)formula 0,0,0.087809,5056,1,0,132,4671,177,32,1740,3319,165
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 68 transition count 146
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 58 transition count 146
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 21 place count 58 transition count 131
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 51 place count 43 transition count 131
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 63 place count 31 transition count 114
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 31 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 26 transition count 104
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 26 transition count 104
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 116 place count 26 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 26 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 21 transition count 63
Applied a total of 131 rules in 32 ms. Remains 21 /70 variables (removed 49) and now considering 63/157 (removed 94) transitions.
[2025-06-05 17:03:22] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
// Phase 1: matrix 57 rows 21 cols
[2025-06-05 17:03:22] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 17:03:23] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
[2025-06-05 17:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 17:03:23] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:03:23] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-05 17:03:23] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
[2025-06-05 17:03:23] [INFO ] Invariant cache hit.
[2025-06-05 17:03:23] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 5/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 5 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 17:03:23] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 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 17:03:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:23] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 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 17:03:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 5 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 17:03:24] [INFO ] Deduced a trap composed of 4 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 17:03:24] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 56/77 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:26] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/78 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 88 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 5/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 56/77 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 35/89 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 58/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 148 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8377ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 8378ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/70 places, 63/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8506 ms. Remains : 21/70 places, 63/157 transitions.
[2025-06-05 17:03:31] [INFO ] Flatten gal took : 6 ms
[2025-06-05 17:03:31] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:03:31] [INFO ] Input system was already deterministic with 63 transitions.
[2025-06-05 17:03:31] [INFO ] Flatten gal took : 3 ms
[2025-06-05 17:03:31] [INFO ] Flatten gal took : 3 ms
[2025-06-05 17:03:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14873629444123384146.gal : 2 ms
[2025-06-05 17:03:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8460364452987482462.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14873629444123384146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8460364452987482462.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,73,0.026031,4408,2,144,5,802,6,0,142,526,0
Converting to forward existential form...Done !
original formula: EG(!(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)) U EF(AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)) U E(TRUE U !(E(TRUE U !(((((p12==1)&&(p2...212
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t22, t24, t26, t28, t30, In...250
(forward)formula 0,1,0.075472,4792,1,0,118,3723,148,32,1398,3289,139
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 147
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 59 transition count 147
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 19 place count 59 transition count 133
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 47 place count 45 transition count 133
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 35 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 35 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 32 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 32 transition count 114
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 80 place count 32 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 32 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 95 place count 27 transition count 97
Applied a total of 95 rules in 30 ms. Remains 27 /70 variables (removed 43) and now considering 97/157 (removed 60) transitions.
[2025-06-05 17:03:31] [INFO ] Flow matrix only has 89 transitions (discarded 8 similar events)
// Phase 1: matrix 89 rows 27 cols
[2025-06-05 17:03:31] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-05 17:03:31] [INFO ] Flow matrix only has 89 transitions (discarded 8 similar events)
[2025-06-05 17:03:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-05 17:03:31] [INFO ] Implicit Places using invariants and state equation in 71 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 17:03:31] [INFO ] Redundant transitions in 3 ms returned []
Running 92 sub problems to find dead transitions.
[2025-06-05 17:03:31] [INFO ] Flow matrix only has 89 transitions (discarded 8 similar events)
[2025-06-05 17:03:31] [INFO ] Invariant cache hit.
[2025-06-05 17:03:31] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 5/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [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 17:03:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 9 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 17:03:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 4 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 17:03:32] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:32] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 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 17:03:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 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 17:03:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 6 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 17:03:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:33] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 88/115 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 58/113 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:35] [INFO ] Deduced a trap composed of 4 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 17:03:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:35] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:35] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:36] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 1/116 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 0/116 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 120 constraints, problems are : Problem set: 0 solved, 92 unsolved in 9201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 5/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:41] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 88/115 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 58/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/116 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/116 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 213 constraints, problems are : Problem set: 0 solved, 92 unsolved in 9238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18507ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 18510ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/70 places, 97/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18650 ms. Remains : 27/70 places, 97/157 transitions.
[2025-06-05 17:03:50] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:03:50] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:03:50] [INFO ] Input system was already deterministic with 97 transitions.
[2025-06-05 17:03:50] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:03:50] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability18305941515114415461.gal : 1 ms
[2025-06-05 17:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10685552526769446925.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18305941515114415461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10685552526769446925.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,161,0.03044,4844,2,212,5,1271,6,0,198,779,0
Converting to forward existential form...Done !
original formula: EG((E(AF(((p45==1)||((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)))) U AF(((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p...372
=> equivalent forward existential formula: [FwdG(Init,(E(!(EG(!(((p45==1)||((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)))))) U !(EG(!(((((((p12=...439
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t9, t10, t11, t12, t13, t14, t16, t17, t18, t20, t21, t30, t33, t...272
(forward)formula 0,1,0.138682,7020,1,0,237,13154,231,94,2100,11575,321
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 60 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 60 transition count 139
Applied a total of 20 rules in 6 ms. Remains 60 /70 variables (removed 10) and now considering 139/157 (removed 18) transitions.
[2025-06-05 17:03:50] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 60 cols
[2025-06-05 17:03:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 17:03:50] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:03:50] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:03:50] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-05 17:03:50] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2025-06-05 17:03:50] [INFO ] Invariant cache hit.
[2025-06-05 17:03:50] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:52] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:53] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 13 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 17:03:54] [INFO ] Deduced a trap composed of 12 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 17:03:54] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:54] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:55] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:55] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:55] [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 17:03:55] [INFO ] Deduced a trap composed of 13 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 17:03:55] [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 17:03:55] [INFO ] Deduced a trap composed of 13 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 17:03:55] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:56] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:56] [INFO ] Deduced a trap composed of 12 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 17:03:56] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 131/191 variables, 60/107 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:03:58] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:00] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 1/192 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 196 constraints, problems are : Problem set: 0 solved, 138 unsolved in 18345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:10] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 131/191 variables, 60/111 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 85/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 138/334 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:16] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:32] [INFO ] Deduced a trap along path composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 1)
(t3 1)
(t4 0)
(t5 1)
(t6 0)
(t7 2)
(t8 2)
(t9 0)
(t10 1)
(t11 0)
(t12 0)
(t13 0)
(t14 1)
(t15 1)
(t16 1)
(t17 0)
(t18 1)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 1)
(t26 1)
(t27 0)
(t28 1)
(t29 1)
(t30 0)
(t31 1)
(t32 1)
(t33 0)
(t34 1)
(t35 0)
(t36 0)
(t37 1)
(t38 1)
(t39 1)
(t40 1)
(t41 1)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 0)
(t56 1)
(t57 1)
(t58 1)
(t59 1)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 1)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 1)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 337 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48496ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 48498ms
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 139/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48707 ms. Remains : 60/70 places, 139/157 transitions.
[2025-06-05 17:04:39] [INFO ] Flatten gal took : 10 ms
[2025-06-05 17:04:39] [INFO ] Flatten gal took : 10 ms
[2025-06-05 17:04:39] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-05 17:04:39] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:04:39] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:04:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14693287567697261923.gal : 3 ms
[2025-06-05 17:04:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5887902138900283945.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14693287567697261923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5887902138900283945.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4331,0.078957,5880,2,815,5,5869,6,0,370,3804,0
Converting to forward existential form...Done !
original formula: (!(E(((EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))) + AX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)))) + (((...538
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(!(!(EG(!(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)))))))) U (!((!(((p45=...786
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t16, t17, t19, t21, t22, t23, t24, t26, t27, ...335
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.9714,26012,1,0,330,108560,308,151,3439,82119,432
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 58 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 58 transition count 135
Applied a total of 24 rules in 9 ms. Remains 58 /70 variables (removed 12) and now considering 135/157 (removed 22) transitions.
[2025-06-05 17:04:40] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2025-06-05 17:04:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 17:04:40] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2025-06-05 17:04:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:04:40] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 322 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/70 places, 135/157 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 47 transition count 125
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 47 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 42 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 42 transition count 120
Applied a total of 30 rules in 6 ms. Remains 42 /57 variables (removed 15) and now considering 120/135 (removed 15) transitions.
[2025-06-05 17:04:40] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 42 cols
[2025-06-05 17:04:40] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:40] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-05 17:04:40] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
[2025-06-05 17:04:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:40] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-05 17:04:40] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/70 places, 120/157 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 475 ms. Remains : 42/70 places, 120/157 transitions.
[2025-06-05 17:04:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:04:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:04:40] [INFO ] Input system was already deterministic with 120 transitions.
[2025-06-05 17:04:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:04:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:04:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3223658801106411619.gal : 2 ms
[2025-06-05 17:04:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8007518525355200958.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3223658801106411619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8007518525355200958.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3378,0.100965,5292,2,544,5,3904,6,0,282,3098,0
Converting to forward existential form...Done !
original formula: EF(AX(AG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(p68==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(p68==0)))))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t36, t37, t38, t40, t41,...285
(forward)formula 0,1,0.462033,11692,1,0,193,31547,255,68,2819,22294,268
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 70 transition count 148
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 61 transition count 148
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 54 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 54 transition count 136
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 49 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 49 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 44 transition count 121
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 44 transition count 121
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 83 place count 44 transition count 90
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 39 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 35 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 35 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 35 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 30 transition count 71
Applied a total of 116 rules in 36 ms. Remains 30 /70 variables (removed 40) and now considering 71/157 (removed 86) transitions.
[2025-06-05 17:04:41] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 30 cols
[2025-06-05 17:04:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 17:04:41] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
[2025-06-05 17:04:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:41] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 17:04:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:04:41] [INFO ] Redundant transitions in 3 ms returned []
Running 70 sub problems to find dead transitions.
[2025-06-05 17:04:41] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
[2025-06-05 17:04:41] [INFO ] Invariant cache hit.
[2025-06-05 17:04:41] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 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 17:04:42] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 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 17:04:42] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 6 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 17:04:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [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 17:04:42] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:42] [INFO ] Deduced a trap composed of 7 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 17:04:42] [INFO ] Deduced a trap composed of 7 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 17:04:42] [INFO ] Deduced a trap composed of 7 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 17:04:42] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:43] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:44] [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 17:04:44] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 64/94 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 1/95 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (OVERLAPS) 0/95 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 111 constraints, problems are : Problem set: 0 solved, 70 unsolved in 6669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:48] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:48] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:48] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 64/94 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 70/183 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:50] [INFO ] Deduced a trap along path composed of 4 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:51] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:51] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:51] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:04:51] [INFO ] Deduced a trap along path composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 1/95 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/95 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/95 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 189 constraints, problems are : Problem set: 0 solved, 70 unsolved in 10156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 16878ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 16879ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/70 places, 71/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17105 ms. Remains : 30/70 places, 71/157 transitions.
[2025-06-05 17:04:58] [INFO ] Flatten gal took : 4 ms
[2025-06-05 17:04:58] [INFO ] Flatten gal took : 3 ms
[2025-06-05 17:04:58] [INFO ] Input system was already deterministic with 71 transitions.
[2025-06-05 17:04:58] [INFO ] Flatten gal took : 3 ms
[2025-06-05 17:04:58] [INFO ] Flatten gal took : 3 ms
[2025-06-05 17:04:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17630571192890697471.gal : 1 ms
[2025-06-05 17:04:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11450659913980822694.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17630571192890697471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11450659913980822694.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,302,0.027873,4468,2,272,5,1709,6,0,183,1167,0
Converting to forward existential form...Done !
original formula: AG(EF(((p13==0)||(p71==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p13==0)||(p71==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t17, t18, t61, t62, t63, t64, t65, I...251
(forward)formula 0,1,0.087573,6260,1,0,123,9609,156,40,1639,7300,148
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 59 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 59 transition count 137
Applied a total of 22 rules in 2 ms. Remains 59 /70 variables (removed 11) and now considering 137/157 (removed 20) transitions.
[2025-06-05 17:04:58] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
// Phase 1: matrix 131 rows 59 cols
[2025-06-05 17:04:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 17:04:58] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
[2025-06-05 17:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:04:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:04:58] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2025-06-05 17:04:58] [INFO ] Flow matrix only has 131 transitions (discarded 6 similar events)
[2025-06-05 17:04:58] [INFO ] Invariant cache hit.
[2025-06-05 17:04:58] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 11 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 17:05:00] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:00] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [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 17:05:01] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 10 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 17:05:01] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:01] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 11 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 17:05:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:02] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:03] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:03] [INFO ] Deduced a trap composed of 13 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 17:05:03] [INFO ] Deduced a trap composed of 13 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 17:05:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 130/189 variables, 59/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 85/187 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:05] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:06] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:06] [INFO ] Deduced a trap composed of 10 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 17:05:06] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:07] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 1/190 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 193 constraints, problems are : Problem set: 0 solved, 136 unsolved in 18670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:18] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:20] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:21] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 130/189 variables, 59/112 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 85/197 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 136/333 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 1/190 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:36] [INFO ] Deduced a trap along path composed of 7 places in 49 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 335 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48830ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 48831ms
Starting structural reductions in LTL mode, iteration 1 : 59/70 places, 137/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49063 ms. Remains : 59/70 places, 137/157 transitions.
[2025-06-05 17:05:47] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:05:47] [INFO ] Flatten gal took : 7 ms
[2025-06-05 17:05:47] [INFO ] Input system was already deterministic with 137 transitions.
[2025-06-05 17:05:47] [INFO ] Flatten gal took : 7 ms
[2025-06-05 17:05:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 17:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11431725397948682503.gal : 2 ms
[2025-06-05 17:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10748001471240233101.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11431725397948682503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10748001471240233101.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4250,0.100668,5576,2,786,5,5459,6,0,365,3637,0
Converting to forward existential form...Done !
original formula: A((!(AX(A((((p69==1)&&(p71==1))||((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))) U E(((p63==1)&&(p71==1)) U (p44==1))))) + ((((...474
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)) + ((((p12==1)&&(p26==1))&&((p40==1...1178
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t16, t17, t18, t20, t21, t22, t23, t25, t...339
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.789076,20560,1,0,397,83260,310,195,3221,68572,469
FORMULA StigmergyElection-PT-05a-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 62 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 62 transition count 143
Applied a total of 16 rules in 4 ms. Remains 62 /70 variables (removed 8) and now considering 143/157 (removed 14) transitions.
[2025-06-05 17:05:48] [INFO ] Flow matrix only has 135 transitions (discarded 8 similar events)
// Phase 1: matrix 135 rows 62 cols
[2025-06-05 17:05:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:05:48] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 17:05:48] [INFO ] Flow matrix only has 135 transitions (discarded 8 similar events)
[2025-06-05 17:05:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:05:48] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:05:48] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2025-06-05 17:05:48] [INFO ] Flow matrix only has 135 transitions (discarded 8 similar events)
[2025-06-05 17:05:48] [INFO ] Invariant cache hit.
[2025-06-05 17:05:48] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:50] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:51] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:52] [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 17:05:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 10 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 17:05:53] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:53] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:54] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:54] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:54] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:54] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:05:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 134/196 variables, 62/110 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 85/195 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 1/197 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 196 constraints, problems are : Problem set: 0 solved, 142 unsolved in 17824 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:07] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:08] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:08] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 134/196 variables, 62/113 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 85/198 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 142/340 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:15] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:22] [INFO ] Deduced a trap along path composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 1/197 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/197 variables, and 343 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47950ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 47951ms
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 143/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48182 ms. Remains : 62/70 places, 143/157 transitions.
[2025-06-05 17:06:36] [INFO ] Flatten gal took : 6 ms
[2025-06-05 17:06:36] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:06:36] [INFO ] Input system was already deterministic with 143 transitions.
[2025-06-05 17:06:36] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:06:36] [INFO ] Flatten gal took : 6 ms
[2025-06-05 17:06:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13640787688264650951.gal : 2 ms
[2025-06-05 17:06:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2609179695941865218.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13640787688264650951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2609179695941865218.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4385,0.081997,5880,2,868,5,5917,6,0,381,3965,0
Converting to forward existential form...Done !
original formula: (AG(((EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))) * (p31==0)) + AG(((p5==0)&&((((p12==0)||(p26==0))||((p40==0)||(p54==0)...995
=> equivalent forward existential formula: (([(EY(((((FwdU(((Init * !(!(E(TRUE U !(((E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))) * (...2185
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t16, t17, t19, t21, t22, t23, t24, t26, t27, ...335
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 51/0/92
Hit Full ! (commute/partial/dont) 51/0/92
(forward)formula 0,0,1.21848,31704,1,0,359,136754,341,180,3611,107589,506
FORMULA StigmergyElection-PT-05a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 62 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 62 transition count 142
Applied a total of 16 rules in 4 ms. Remains 62 /70 variables (removed 8) and now considering 142/157 (removed 15) transitions.
[2025-06-05 17:06:37] [INFO ] Flow matrix only has 134 transitions (discarded 8 similar events)
// Phase 1: matrix 134 rows 62 cols
[2025-06-05 17:06:37] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:06:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 17:06:37] [INFO ] Flow matrix only has 134 transitions (discarded 8 similar events)
[2025-06-05 17:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:06:37] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:06:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-05 17:06:37] [INFO ] Flow matrix only has 134 transitions (discarded 8 similar events)
[2025-06-05 17:06:37] [INFO ] Invariant cache hit.
[2025-06-05 17:06:37] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:39] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [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 17:06:40] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:40] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 10 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 17:06:41] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 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 17:06:41] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:41] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:42] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:42] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:42] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:42] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:42] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:42] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:43] [INFO ] Deduced a trap composed of 12 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 17:06:43] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:43] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:43] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:44] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:44] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:46] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 133/195 variables, 62/114 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 85/199 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 1/196 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:56] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:06:56] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 9 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/196 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 17 (OVERLAPS) 0/196 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 203 constraints, problems are : Problem set: 0 solved, 141 unsolved in 26501 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 133/195 variables, 62/117 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 85/202 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 141/343 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:10] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/196 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 345 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56588ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 56589ms
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 142/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56779 ms. Remains : 62/70 places, 142/157 transitions.
[2025-06-05 17:07:34] [INFO ] Flatten gal took : 4 ms
[2025-06-05 17:07:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:07:34] [INFO ] Input system was already deterministic with 142 transitions.
[2025-06-05 17:07:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:07:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:07:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2909001939031093730.gal : 2 ms
[2025-06-05 17:07:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17120772461426383106.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2909001939031093730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17120772461426383106.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4358,0.077377,5680,2,856,5,5707,6,0,378,3824,0
Converting to forward existential form...Done !
original formula: (A((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)) + !(((EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))) + (((((p1...986
=> equivalent forward existential formula: ([((Init * !(EG(!(!((E(!(EG(!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1))))))) U (!(EG(!((E(!(...3039
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t8, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t23, t25, t26,...336
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.527296,17328,1,0,291,62083,323,116,3262,49456,393
FORMULA StigmergyElection-PT-05a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 157/157 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 61 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 61 transition count 141
Applied a total of 18 rules in 3 ms. Remains 61 /70 variables (removed 9) and now considering 141/157 (removed 16) transitions.
[2025-06-05 17:07:35] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
// Phase 1: matrix 134 rows 61 cols
[2025-06-05 17:07:35] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:07:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 17:07:35] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
[2025-06-05 17:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:07:35] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 17:07:35] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-06-05 17:07:35] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
[2025-06-05 17:07:35] [INFO ] Invariant cache hit.
[2025-06-05 17:07:35] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:36] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:36] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:36] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:37] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 12 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 17:07:38] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:38] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:39] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:40] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:41] [INFO ] Deduced a trap composed of 12 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 17:07:41] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:41] [INFO ] Deduced a trap composed of 13 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 17:07:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:41] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:42] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 133/194 variables, 61/113 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 85/198 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:45] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 1/195 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:51] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:51] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (OVERLAPS) 0/195 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 202 constraints, problems are : Problem set: 0 solved, 140 unsolved in 21596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:57] [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 17:07:58] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:07:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 133/194 variables, 61/119 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 140/344 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/195 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:08:23] [INFO ] Deduced a trap along path composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/195 variables, and 347 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51703ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 51703ms
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 141/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51864 ms. Remains : 61/70 places, 141/157 transitions.
[2025-06-05 17:08:27] [INFO ] Flatten gal took : 4 ms
[2025-06-05 17:08:27] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:08:27] [INFO ] Input system was already deterministic with 141 transitions.
[2025-06-05 17:08:27] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:08:27] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13200396753087235457.gal : 1 ms
[2025-06-05 17:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14142451273186113617.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13200396753087235457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14142451273186113617.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4358,0.071344,5492,2,760,5,5494,6,0,376,3412,0
Converting to forward existential form...Done !
original formula: AX((((AG((p62==1)) + AX((((p47==0) * AX(((p21==1)&&(p71==1)))) + (A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(p68==1)) U ((((p12==1...582
=> equivalent forward existential formula: ([((((EY(Init) * !(((!(E(TRUE U !((p62==1)))) + !(EX(!((((p47==0) * !(EX(!(((p21==1)&&(p71==1)))))) + (!((E(!(((...1330
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t13, t14, t16, t18, t19, t20, t21, t23, t24, t25, t26, ...340
(forward)formula 0,1,0.483471,17524,1,0,303,60456,320,117,3371,51139,389
FORMULA StigmergyElection-PT-05a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-05 17:08:27] [INFO ] Flatten gal took : 5 ms
[2025-06-05 17:08:27] [INFO ] Flatten gal took : 5 ms
Total runtime 431161 ms.
BK_STOP 1749143307610
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-05a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-05a, examination is CTLFireability"
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-174903490900210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05a.tgz
mv StigmergyElection-PT-05a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;