Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000242.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-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 1.8M 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-07a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-15
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-00
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-01
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-02
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-03
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-04
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-05
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-06
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-07
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-08
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-09
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-10
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749154391549

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 20:13:13] [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 20:13:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:13:14] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2025-06-05 20:13:14] [INFO ] Transformed 100 places.
[2025-06-05 20:13:14] [INFO ] Transformed 2618 transitions.
[2025-06-05 20:13:14] [INFO ] Found NUPN structural information;
[2025-06-05 20:13:14] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 638 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Support contains 15 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 90 transition count 375
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 90 transition count 375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 87 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 87 transition count 369
Applied a total of 26 rules in 64 ms. Remains 87 /100 variables (removed 13) and now considering 369/389 (removed 20) transitions.
[2025-06-05 20:13:14] [INFO ] Flow matrix only has 358 transitions (discarded 11 similar events)
// Phase 1: matrix 358 rows 87 cols
[2025-06-05 20:13:14] [INFO ] Computed 2 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:13:14] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-06-05 20:13:14] [INFO ] Flow matrix only has 358 transitions (discarded 11 similar events)
[2025-06-05 20:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:13:15] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:13:15] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-05 20:13:15] [INFO ] Flow matrix only has 358 transitions (discarded 11 similar events)
[2025-06-05 20:13:15] [INFO ] Invariant cache hit.
[2025-06-05 20:13:15] [INFO ] State equation strengthened by 288 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:19] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:19] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:20] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:21] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13: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 20:13:21] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:21] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:21] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:21] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:21] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:22] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:22] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:22] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:22] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:22] [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 20:13:22] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:22] [INFO ] Deduced a trap composed of 10 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 20:13:22] [INFO ] Deduced a trap composed of 11 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 20:13:23] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:23] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:24] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:24] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:24] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:24] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:24] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:25] [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 20:13:25] [INFO ] Deduced a trap composed of 11 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 20:13:25] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:25] [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 20:13:26] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:26] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:26] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:26] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:26] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:26] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:27] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:28] [INFO ] Deduced a trap composed of 10 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 20:13:28] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:28] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:28] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:28] [INFO ] Deduced a trap composed of 10 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 20:13:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:28] [INFO ] Deduced a trap composed of 13 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 20:13:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:29] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:30] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:30] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:30] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:30] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:31] [INFO ] Deduced a trap composed of 15 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 20:13:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 357/444 variables, 87/179 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 287/466 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:42] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:43] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:43] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:43] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:44] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/445 variables, and 472 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 368/106 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:48] [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 20:13:49] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:49] [INFO ] Deduced a trap composed of 11 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 20:13:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:51] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:13:51] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 357/444 variables, 87/191 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 287/478 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 106/584 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/445 variables, and 584 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 368/106 constraints, Known Traps: 102/102 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61031ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 61060ms
Starting structural reductions in LTL mode, iteration 1 : 87/100 places, 369/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62051 ms. Remains : 87/100 places, 369/389 transitions.
Support contains 15 out of 87 places after structural reductions.
[2025-06-05 20:14:16] [INFO ] Flatten gal took : 97 ms
[2025-06-05 20:14:16] [INFO ] Flatten gal took : 56 ms
[2025-06-05 20:14:16] [INFO ] Input system was already deterministic with 369 transitions.
Reduction of identical properties reduced properties to check from 20 to 11
RANDOM walk for 40000 steps (55 resets) in 3150 ms. (12 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (22 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (70 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
[2025-06-05 20:14:18] [INFO ] Flow matrix only has 358 transitions (discarded 11 similar events)
[2025-06-05 20:14:18] [INFO ] Invariant cache hit.
[2025-06-05 20:14:18] [INFO ] State equation strengthened by 288 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 86/445 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/87 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-06-05 20:14:18] [INFO ] Flatten gal took : 40 ms
[2025-06-05 20:14:18] [INFO ] Flatten gal took : 40 ms
[2025-06-05 20:14:18] [INFO ] Input system was already deterministic with 369 transitions.
Computed a total of 16 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 355
Applied a total of 14 rules in 15 ms. Remains 80 /87 variables (removed 7) and now considering 355/369 (removed 14) transitions.
[2025-06-05 20:14:18] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2025-06-05 20:14:18] [INFO ] Computed 2 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-05 20:14:18] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2025-06-05 20:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:18] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:14:19] [INFO ] Implicit Places using invariants and state equation in 547 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 636 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 355/369 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 12 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2025-06-05 20:14:19] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2025-06-05 20:14:19] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-05 20:14:19] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2025-06-05 20:14:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:19] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:14:19] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/87 places, 334/369 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 857 ms. Remains : 58/87 places, 334/369 transitions.
[2025-06-05 20:14:19] [INFO ] Flatten gal took : 39 ms
[2025-06-05 20:14:19] [INFO ] Flatten gal took : 30 ms
[2025-06-05 20:14:19] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-05 20:14:19] [INFO ] Flatten gal took : 23 ms
[2025-06-05 20:14:19] [INFO ] Flatten gal took : 22 ms
[2025-06-05 20:14:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13762197269415235177.gal : 44 ms
[2025-06-05 20:14:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10114704844822033326.ctl : 5 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/CTLFireability13762197269415235177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10114704844822033326.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,80326,0.892026,21632,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: !(A((!(A((((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) * (p12==1)) * ((p26==1)&&(p40==1))) * ((...555
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==...1254
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.04198,81792,1,0,507,204187,698,112,10531,137902,792
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 71 transition count 340
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 57 transition count 340
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 71 place count 43 transition count 322
Iterating global reduction 2 with 14 rules applied. Total rules applied 85 place count 43 transition count 322
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 100 place count 43 transition count 307
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 43 transition count 304
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 40 transition count 304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 38 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 38 transition count 300
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 158 place count 38 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 38 transition count 245
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 31 transition count 238
Applied a total of 179 rules in 136 ms. Remains 31 /87 variables (removed 56) and now considering 238/369 (removed 131) transitions.
[2025-06-05 20:14:23] [INFO ] Flow matrix only has 230 transitions (discarded 8 similar events)
// Phase 1: matrix 230 rows 31 cols
[2025-06-05 20:14:23] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 20:14:23] [INFO ] Flow matrix only has 230 transitions (discarded 8 similar events)
[2025-06-05 20:14:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:14:23] [INFO ] State equation strengthened by 197 read => feed constraints.
[2025-06-05 20:14:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:14:23] [INFO ] Redundant transitions in 16 ms returned []
Running 231 sub problems to find dead transitions.
[2025-06-05 20:14:23] [INFO ] Flow matrix only has 230 transitions (discarded 8 similar events)
[2025-06-05 20:14:23] [INFO ] Invariant cache hit.
[2025-06-05 20:14:23] [INFO ] State equation strengthened by 197 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:25] [INFO ] Deduced a trap composed of 4 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 20:14:25] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:25] [INFO ] Deduced a trap composed of 4 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 20:14:25] [INFO ] Deduced a trap composed of 4 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 20:14:25] [INFO ] Deduced a trap composed of 6 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 20:14:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 4 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 20:14:26] [INFO ] Deduced a trap composed of 6 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 20:14:26] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 6 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 20:14:26] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 6 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 20:14:26] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:26] [INFO ] Deduced a trap composed of 5 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 20:14:26] [INFO ] Deduced a trap composed of 5 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 20:14:27] [INFO ] Deduced a trap composed of 4 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 20:14:27] [INFO ] Deduced a trap composed of 5 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 20:14:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [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 20:14:27] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 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 20:14:27] [INFO ] Deduced a trap composed of 4 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 20:14:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:28] [INFO ] Deduced a trap composed of 4 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 20:14:28] [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 20:14:28] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:29] [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 20:14:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:29] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 229/260 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 196/277 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:32] [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 20:14:32] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:32] [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 20:14:32] [INFO ] Deduced a trap composed of 4 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 20:14:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 8/285 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (OVERLAPS) 1/261 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/261 variables, and 288 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 231/32 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:55] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:14:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 229/260 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 196/289 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 32/321 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 1/261 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 7)
(t2 0)
(t3 7)
(t4 0)
(t5 6)
(t6 0)
(t7 5)
(t8 0)
(t9 4)
(t10 0)
(t11 1)
(t12 0)
(t13 3)
(t14 0)
(t15 3)
(t16 1)
(t17 1)
(t18 1)
(t19 1)
(t20 1)
(t21 0)
(t22 1)
(t23 1)
(t24 1)
(t25 0)
(t26 1)
(t27 1)
(t28 1)
(t29 1)
(t30 1)
(t31 1)
(t32 1)
(t33 2)
(t34 2)
(t35 2)
(t36 2)
(t37 2)
(t38 2)
(t39 2)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 322 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 231/32 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60590ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/87 places, 238/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60921 ms. Remains : 31/87 places, 238/369 transitions.
[2025-06-05 20:15:24] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:15:24] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:15:24] [INFO ] Input system was already deterministic with 238 transitions.
[2025-06-05 20:15:24] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:15:24] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:15:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2438739492394767635.gal : 7 ms
[2025-06-05 20:15:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16899343954943075019.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/CTLFireability2438739492394767635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16899343954943075019.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,397,0.151017,8336,2,383,5,3645,6,0,355,2136,0


Converting to forward existential form...Done !
original formula: A((EG((((((AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) * EG(((((p12==1)&&(p26==1))&&((p40==1)&&(...734
=> equivalent forward existential formula: [((Init * !(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))))) * !(E(!(((...1198
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t17, t18, t19, t20, t22, t23...297
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,0,0.831207,19728,1,0,421,34885,517,128,6815,27400,662
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 59 place count 56 transition count 339
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 72 place count 43 transition count 323
Iterating global reduction 2 with 13 rules applied. Total rules applied 85 place count 43 transition count 323
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 100 place count 43 transition count 308
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 43 transition count 305
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 40 transition count 305
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 38 transition count 301
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 38 transition count 301
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 158 place count 38 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 38 transition count 246
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 31 transition count 239
Applied a total of 179 rules in 81 ms. Remains 31 /87 variables (removed 56) and now considering 239/369 (removed 130) transitions.
[2025-06-05 20:15:25] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
// Phase 1: matrix 230 rows 31 cols
[2025-06-05 20:15:25] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:15:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 20:15:25] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2025-06-05 20:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:15:25] [INFO ] State equation strengthened by 197 read => feed constraints.
[2025-06-05 20:15:25] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:15:25] [INFO ] Redundant transitions in 17 ms returned []
Running 232 sub problems to find dead transitions.
[2025-06-05 20:15:25] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2025-06-05 20:15:25] [INFO ] Invariant cache hit.
[2025-06-05 20:15:25] [INFO ] State equation strengthened by 197 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:27] [INFO ] Deduced a trap composed of 5 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 20:15:27] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:27] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:27] [INFO ] Deduced a trap composed of 6 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 20:15:27] [INFO ] Deduced a trap composed of 4 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 20:15:27] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:27] [INFO ] Deduced a trap composed of 4 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 20:15:27] [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 20:15:27] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 6 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 20:15:28] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [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 20:15:28] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:28] [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 20:15:29] [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 20:15:29] [INFO ] Deduced a trap composed of 6 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 20:15:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:29] [INFO ] Deduced a trap composed of 5 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 20:15:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [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 20:15:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 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 20:15:30] [INFO ] Deduced a trap composed of 4 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 20:15:30] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:30] [INFO ] Deduced a trap composed of 4 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 20:15:30] [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 20:15:30] [INFO ] Deduced a trap composed of 4 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 20:15:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:31] [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 20:15:31] [INFO ] Deduced a trap composed of 4 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 20:15:31] [INFO ] Deduced a trap composed of 4 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 20:15:31] [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 20:15:31] [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 20:15:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 229/260 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 196/279 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:34] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:34] [INFO ] Deduced a trap composed of 4 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 20:15:34] [INFO ] Deduced a trap composed of 4 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 20:15:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:34] [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 20:15:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:37] [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 20:15:37] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:15:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (OVERLAPS) 1/261 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 1.0)
(t2 0.0)
(t3 1.0)
(t4 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/261 variables, and 290 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 232/33 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 229/260 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 196/289 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 33/322 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 1/261 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 323 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 232/33 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/87 places, 239/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60746 ms. Remains : 31/87 places, 239/369 transitions.
[2025-06-05 20:16:26] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:16:26] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:16:26] [INFO ] Input system was already deterministic with 239 transitions.
[2025-06-05 20:16:26] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:16:26] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12675461327480497595.gal : 3 ms
[2025-06-05 20:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13062349952903057593.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/CTLFireability12675461327480497595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13062349952903057593.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,397,0.15259,8552,2,471,5,5023,6,0,355,2749,0


Converting to forward existential form...Done !
original formula: E(((((E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U !(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==...658
=> equivalent forward existential formula: [((FwdU(Init,((((E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U !(EG(((((p...808
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...302
(forward)formula 0,0,0.522199,11624,1,0,319,17522,498,51,7123,12532,503
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 355
Applied a total of 14 rules in 11 ms. Remains 80 /87 variables (removed 7) and now considering 355/369 (removed 14) transitions.
[2025-06-05 20:16:26] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2025-06-05 20:16:26] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:16:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-05 20:16:27] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2025-06-05 20:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:16:27] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:16:27] [INFO ] Implicit Places using invariants and state equation in 531 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 600 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 355/369 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 8 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2025-06-05 20:16:27] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2025-06-05 20:16:27] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:16:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-05 20:16:27] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2025-06-05 20:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:16:27] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:16:27] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/87 places, 334/369 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 819 ms. Remains : 58/87 places, 334/369 transitions.
[2025-06-05 20:16:27] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:16:27] [INFO ] Flatten gal took : 16 ms
[2025-06-05 20:16:27] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-05 20:16:27] [INFO ] Flatten gal took : 16 ms
[2025-06-05 20:16:27] [INFO ] Flatten gal took : 20 ms
[2025-06-05 20:16:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13760089912526071675.gal : 5 ms
[2025-06-05 20:16:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15798269382913785475.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/CTLFireability13760089912526071675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15798269382913785475.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,80326,0.923247,21668,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: EF(EX(EX(EG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||(p96==0)))))))
=> equivalent forward existential formula: [FwdG(EY(EY(FwdU(Init,TRUE))),((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||(p96==0))))]...164
Hit Full ! (commute/partial/dont) 51/0/283
(forward)formula 0,1,3.48021,71204,1,0,23,144616,19,2,8096,94239,24
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 42 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 42 transition count 321
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 42 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 42 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 39 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 36 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 36 transition count 297
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 226 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 29 transition count 171
Applied a total of 247 rules in 53 ms. Remains 29 /87 variables (removed 58) and now considering 171/369 (removed 198) transitions.
[2025-06-05 20:16:31] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2025-06-05 20:16:31] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:16:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-05 20:16:31] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:16:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:16:31] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-05 20:16:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:16:31] [INFO ] Redundant transitions in 3 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 20:16:31] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:16:31] [INFO ] Invariant cache hit.
[2025-06-05 20:16:31] [INFO ] State equation strengthened by 134 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:32] [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 20:16:32] [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 20:16: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 20:16:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 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 20:16: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 20:16:33] [INFO ] Deduced a trap composed of 4 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 20:16:33] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 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 20:16:33] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 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 20:16:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:33] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 5 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 20:16:34] [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 20:16:34] [INFO ] Deduced a trap composed of 4 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 20:16:34] [INFO ] Deduced a trap composed of 4 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 20:16:34] [INFO ] Deduced a trap composed of 4 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 20:16:34] [INFO ] Deduced a trap composed of 5 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 20:16:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 5 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 20:16:34] [INFO ] Deduced a trap composed of 4 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 20:16:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 5 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 20:16:34] [INFO ] Deduced a trap composed of 4 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 20:16:34] [INFO ] Deduced a trap composed of 5 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 20:16:34] [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 20:16:34] [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 20:16:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:35] [INFO ] Deduced a trap composed of 4 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 20:16:35] [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 20:16:35] [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 20:16:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16: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 20:16:35] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:35] [INFO ] Deduced a trap composed of 4 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 20:16:35] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:35] [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 20:16:36] [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 20:16:36] [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 20:16:36] [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 20:16:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:39] [INFO ] Deduced a trap composed of 4 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 20:16:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:39] [INFO ] Deduced a trap composed of 4 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 20:16:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:16:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 164 unsolved in 23057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 394 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53403ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53404ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/87 places, 171/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53601 ms. Remains : 29/87 places, 171/369 transitions.
[2025-06-05 20:17:25] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:17:25] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:17:25] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-05 20:17:25] [INFO ] Flatten gal took : 9 ms
[2025-06-05 20:17:25] [INFO ] Flatten gal took : 9 ms
[2025-06-05 20:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3607873649077255107.gal : 4 ms
[2025-06-05 20:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4391744288305242614.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/CTLFireability3607873649077255107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4391744288305242614.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,269,0.097505,7016,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: EF((AG(((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))||(((p68!=1)||(p82!=1))||(p96!=1)))) * ((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))|...191
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))||(((p68!=1)||(p82!=1))||(p96!=1)))) * !(E(TRU...255
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
(forward)formula 0,1,0.338786,9704,1,0,256,17500,355,56,4908,12627,377
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 84 transition count 363
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 84 transition count 363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 81 transition count 357
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 81 transition count 357
Applied a total of 12 rules in 9 ms. Remains 81 /87 variables (removed 6) and now considering 357/369 (removed 12) transitions.
[2025-06-05 20:17:25] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
// Phase 1: matrix 349 rows 81 cols
[2025-06-05 20:17:25] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:17:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 20:17:25] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
[2025-06-05 20:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:17:25] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:17:25] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2025-06-05 20:17:25] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
[2025-06-05 20:17:25] [INFO ] Invariant cache hit.
[2025-06-05 20:17:25] [INFO ] State equation strengthened by 288 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:29] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:29] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:29] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:29] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:30] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:31] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [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 20:17:32] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:32] [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 20:17:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [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 20:17:33] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [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 20:17:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:33] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [INFO ] Deduced a trap composed of 11 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 20:17:35] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [INFO ] Deduced a trap composed of 11 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 20:17:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [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 20:17:35] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:35] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:36] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:36] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:36] [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 20:17:36] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:37] [INFO ] Deduced a trap composed of 13 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 20:17:37] [INFO ] Deduced a trap composed of 14 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 20:17:37] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:37] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:37] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:37] [INFO ] Deduced a trap composed of 10 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 20:17:37] [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 20:17:37] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:37] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:38] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:40] [INFO ] Deduced a trap composed of 10 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 20:17:40] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:40] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:40] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:40] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:40] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:40] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:41] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:42] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:42] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:42] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:42] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:42] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:43] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:44] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:45] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:45] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:45] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:45] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 348/429 variables, 81/182 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 287/469 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:54] [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 20:17:54] [INFO ] Deduced a trap composed of 10 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 20:17:54] [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 20:17:54] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:55] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/430 variables, and 477 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 356/94 constraints, Known Traps: 107/107 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:58] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:59] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:59] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:17:59] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:02] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 348/429 variables, 81/195 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 287/482 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 94/576 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/430 variables, and 576 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 356/94 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 357/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61025 ms. Remains : 81/87 places, 357/369 transitions.
[2025-06-05 20:18:26] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:18:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:18:26] [INFO ] Input system was already deterministic with 357 transitions.
[2025-06-05 20:18:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:18:26] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:18:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9139205033395668931.gal : 3 ms
[2025-06-05 20:18:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9251634234131535640.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/CTLFireability9139205033395668931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9251634234131535640.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,95266,1.09895,26096,2,2735,5,40849,6,0,671,21459,0


Converting to forward existential form...Done !
original formula: AF(((EF(AX(FALSE)) * A(AF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))||(p6==1))) U !(E(((p80==1)&&(...507
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(EX(!(FALSE)))) * !((E(!(!(E(((p80==1)&&(p99==1)) U ((((p12==1)&&(p26==1))&&((p40==1)&&...823
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, ...412
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.70909,107244,1,0,560,283448,747,135,11282,186987,845
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-05 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 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 42 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 42 transition count 321
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 42 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 42 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 39 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 36 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 36 transition count 297
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 226 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 29 transition count 171
Applied a total of 247 rules in 51 ms. Remains 29 /87 variables (removed 58) and now considering 171/369 (removed 198) transitions.
[2025-06-05 20:18:32] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2025-06-05 20:18:32] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:18:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-05 20:18:32] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:18:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:18:32] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-05 20:18:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:18:32] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 20:18:32] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:18:32] [INFO ] Invariant cache hit.
[2025-06-05 20:18:32] [INFO ] State equation strengthened by 134 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:33] [INFO ] Deduced a trap composed of 5 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 20:18:33] [INFO ] Deduced a trap composed of 5 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 20:18: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 20:18:33] [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 20:18:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18: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 20:18: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 20:18: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 20:18:33] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 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 20:18:34] [INFO ] Deduced a trap composed of 4 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 20:18:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 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 20:18:34] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [INFO ] Deduced a trap composed of 5 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 20:18:34] [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 20:18:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:34] [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 20:18:35] [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 20:18:35] [INFO ] Deduced a trap composed of 5 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 20:18: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 20:18:35] [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 20:18:35] [INFO ] Deduced a trap composed of 5 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 20:18:35] [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 20:18:35] [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 20:18:35] [INFO ] Deduced a trap composed of 5 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 20:18:35] [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 20:18:35] [INFO ] Deduced a trap composed of 5 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 20:18:35] [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 20:18: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 20:18:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:35] [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 20:18:35] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:35] [INFO ] Deduced a trap composed of 4 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 20:18:36] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:36] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:36] [INFO ] Deduced a trap composed of 4 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 20:18:36] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:36] [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 20:18:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:36] [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 20:18:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:36] [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 20:18:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:36] [INFO ] Deduced a trap composed of 4 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 20:18:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:37] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:39] [INFO ] Deduced a trap composed of 4 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 20:18:40] [INFO ] Deduced a trap composed of 4 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 20:18:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:40] [INFO ] Deduced a trap composed of 4 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 20:18:40] [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 20:18:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:18:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 164 unsolved in 23186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 394 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53504ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53505ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/87 places, 171/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53685 ms. Remains : 29/87 places, 171/369 transitions.
[2025-06-05 20:19:26] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:19:26] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:19:26] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-05 20:19:26] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:19:26] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:19:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17569843943122684425.gal : 2 ms
[2025-06-05 20:19:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7525564416609916538.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/CTLFireability17569843943122684425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7525564416609916538.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,269,0.09084,6892,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: EF(AG((EG(AF(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||(p96==0))))) * ((((p12==0)||(p26==0))||((p40==0)||(p54...199
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EG(!(EG(!(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))...269
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.402856,10732,1,0,295,20397,367,83,4752,15599,433
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 84 transition count 363
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 84 transition count 363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 82 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 82 transition count 359
Applied a total of 10 rules in 5 ms. Remains 82 /87 variables (removed 5) and now considering 359/369 (removed 10) transitions.
[2025-06-05 20:19:26] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
// Phase 1: matrix 350 rows 82 cols
[2025-06-05 20:19:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-05 20:19:26] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
[2025-06-05 20:19:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:26] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:19:27] [INFO ] Implicit Places using invariants and state equation in 535 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 611 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 359/369 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 68 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 68 transition count 346
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 61 transition count 339
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 61 transition count 339
Applied a total of 40 rules in 5 ms. Remains 61 /81 variables (removed 20) and now considering 339/359 (removed 20) transitions.
[2025-06-05 20:19:27] [INFO ] Flow matrix only has 330 transitions (discarded 9 similar events)
// Phase 1: matrix 330 rows 61 cols
[2025-06-05 20:19:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 20:19:27] [INFO ] Flow matrix only has 330 transitions (discarded 9 similar events)
[2025-06-05 20:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:27] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:19:27] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/87 places, 339/369 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 810 ms. Remains : 61/87 places, 339/369 transitions.
[2025-06-05 20:19:27] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:19:27] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:19:27] [INFO ] Input system was already deterministic with 339 transitions.
[2025-06-05 20:19:27] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:19:27] [INFO ] Flatten gal took : 16 ms
[2025-06-05 20:19:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3216825186416910972.gal : 3 ms
[2025-06-05 20:19:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17403478065503152792.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/CTLFireability3216825186416910972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17403478065503152792.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,92614,0.841094,20284,2,2083,5,30123,6,0,574,18248,0


Converting to forward existential form...Done !
original formula: (EG(!(E(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) U AX((p85==1))))) + AF(EG(((((p12==1)&&(p26=...220
=> equivalent forward existential formula: [FwdG((Init * !(EG(!(E(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) U !(...274
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t31, t32,...378
(forward)formula 0,1,2.70174,49212,1,0,454,122814,703,87,10833,89711,704
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 355
Applied a total of 14 rules in 6 ms. Remains 80 /87 variables (removed 7) and now considering 355/369 (removed 14) transitions.
[2025-06-05 20:19:30] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2025-06-05 20:19:30] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 20:19:30] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2025-06-05 20:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:30] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:19:30] [INFO ] Implicit Places using invariants and state equation in 546 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 628 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 355/369 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 6 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2025-06-05 20:19:30] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2025-06-05 20:19:30] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 20:19:30] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2025-06-05 20:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:30] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:19:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/87 places, 334/369 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 826 ms. Remains : 58/87 places, 334/369 transitions.
[2025-06-05 20:19:30] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:19:30] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:19:31] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-05 20:19:31] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:19:31] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:19:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9464187178045111573.gal : 3 ms
[2025-06-05 20:19:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9208520036255321511.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/CTLFireability9464187178045111573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9208520036255321511.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,80326,0.913273,21676,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: AX(EG(AF(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)...196
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U ((...249
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
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,3.65152,70572,1,0,507,195051,689,130,10529,131185,773
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 42 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 42 transition count 321
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 42 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 42 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 39 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 36 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 36 transition count 297
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 226 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 29 transition count 171
Applied a total of 247 rules in 44 ms. Remains 29 /87 variables (removed 58) and now considering 171/369 (removed 198) transitions.
[2025-06-05 20:19:34] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2025-06-05 20:19:34] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-05 20:19:34] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:19:34] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-05 20:19:34] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:19:34] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 20:19:34] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:19:34] [INFO ] Invariant cache hit.
[2025-06-05 20:19:34] [INFO ] State equation strengthened by 134 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [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 20:19:36] [INFO ] Deduced a trap composed of 5 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 20:19:36] [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 20:19:36] [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 20:19:36] [INFO ] Deduced a trap composed of 4 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 20:19:36] [INFO ] Deduced a trap composed of 4 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 20:19:36] [INFO ] Deduced a trap composed of 4 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 20:19:36] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [INFO ] Deduced a trap composed of 4 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 20:19:36] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:36] [INFO ] Deduced a trap composed of 4 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 20:19:36] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [INFO ] Deduced a trap composed of 4 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 20:19:37] [INFO ] Deduced a trap composed of 4 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 20:19:37] [INFO ] Deduced a trap composed of 4 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 20:19:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [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 20:19:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [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 20:19:37] [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 20:19:37] [INFO ] Deduced a trap composed of 5 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 20:19:37] [INFO ] Deduced a trap composed of 4 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 20:19:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [INFO ] Deduced a trap composed of 5 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 20:19:37] [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 20:19:37] [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 20:19:37] [INFO ] Deduced a trap composed of 5 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 20:19:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [INFO ] Deduced a trap composed of 5 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 20:19:37] [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 20:19:37] [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 20:19:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:37] [INFO ] Deduced a trap composed of 4 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 20:19:38] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:38] [INFO ] Deduced a trap composed of 4 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 20:19:38] [INFO ] Deduced a trap composed of 4 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 20:19:38] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:38] [INFO ] Deduced a trap composed of 4 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 20:19:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:38] [INFO ] Deduced a trap composed of 4 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 20:19:38] [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 20:19:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:39] [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 20:19:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:39] [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 20:19:39] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:39] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:42] [INFO ] Deduced a trap composed of 4 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 20:19:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:42] [INFO ] Deduced a trap composed of 4 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 20:19:42] [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 20:19:42] [INFO ] Deduced a trap composed of 4 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 20:19:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:19:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 164 unsolved in 22739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 394 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53070ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53071ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/87 places, 171/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53243 ms. Remains : 29/87 places, 171/369 transitions.
[2025-06-05 20:20:27] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:20:27] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:20:28] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-05 20:20:28] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:20:28] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:20:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13239095058646666889.gal : 1 ms
[2025-06-05 20:20:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2625537721523545155.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/CTLFireability13239095058646666889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2625537721523545155.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,269,0.0879,7020,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))))...166
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
(forward)formula 0,1,0.375897,9964,1,0,274,17204,360,58,4890,13075,396
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 42 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 42 transition count 321
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 42 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 42 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 39 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 36 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 36 transition count 297
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 226 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 29 transition count 171
Applied a total of 247 rules in 44 ms. Remains 29 /87 variables (removed 58) and now considering 171/369 (removed 198) transitions.
[2025-06-05 20:20:28] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:20:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-05 20:20:28] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:20:28] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-05 20:20:28] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:20:28] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 20:20:28] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:20:28] [INFO ] Invariant cache hit.
[2025-06-05 20:20:28] [INFO ] State equation strengthened by 134 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:29] [INFO ] Deduced a trap composed of 5 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 20:20:29] [INFO ] Deduced a trap composed of 5 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 20:20:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:29] [INFO ] Deduced a trap composed of 4 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 20:20:30] [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 20:20:30] [INFO ] Deduced a trap composed of 4 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 20:20:30] [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 20:20:30] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 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 20:20:30] [INFO ] Deduced a trap composed of 4 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 20:20:30] [INFO ] Deduced a trap composed of 4 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 20:20:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 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 20:20:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:31] [INFO ] Deduced a trap composed of 5 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 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:31] [INFO ] Deduced a trap composed of 4 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 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 5 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 20:20:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 5 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 20:20:31] [INFO ] Deduced a trap composed of 4 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 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 5 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 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:31] [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 20:20:31] [INFO ] Deduced a trap composed of 4 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 20:20:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [INFO ] Deduced a trap composed of 4 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 20:20: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 20:20:32] [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 20:20:32] [INFO ] Deduced a trap composed of 4 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 20:20:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:32] [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 20:20:32] [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 20:20:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:36] [INFO ] Deduced a trap composed of 4 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 20:20:36] [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 20:20:36] [INFO ] Deduced a trap composed of 4 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 20:20:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:36] [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 20:20:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:20:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 164 unsolved in 22768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 394 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53078ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53079ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/87 places, 171/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53257 ms. Remains : 29/87 places, 171/369 transitions.
[2025-06-05 20:21:21] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:21:21] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:21:21] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-05 20:21:21] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:21:21] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:21:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14900328569191116048.gal : 2 ms
[2025-06-05 20:21:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8044829914126910132.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/CTLFireability14900328569191116048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8044829914126910132.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,269,0.090944,7012,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p12==0))))||((((p26==0)||(p40==0))||((p54==...364
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0...422
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
(forward)formula 0,0,0.310387,8676,1,0,244,12516,360,45,4970,9180,356
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 72 place count 43 transition count 323
Iterating global reduction 2 with 13 rules applied. Total rules applied 85 place count 43 transition count 323
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 100 place count 43 transition count 308
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 43 transition count 305
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 40 transition count 305
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 38 transition count 301
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 38 transition count 301
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 158 place count 38 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 38 transition count 246
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 31 transition count 239
Applied a total of 179 rules in 44 ms. Remains 31 /87 variables (removed 56) and now considering 239/369 (removed 130) transitions.
[2025-06-05 20:21:22] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
// Phase 1: matrix 230 rows 31 cols
[2025-06-05 20:21:22] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:21:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-05 20:21:22] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2025-06-05 20:21:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:21:22] [INFO ] State equation strengthened by 197 read => feed constraints.
[2025-06-05 20:21:22] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:21:22] [INFO ] Redundant transitions in 4 ms returned []
Running 232 sub problems to find dead transitions.
[2025-06-05 20:21:22] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2025-06-05 20:21:22] [INFO ] Invariant cache hit.
[2025-06-05 20:21:22] [INFO ] State equation strengthened by 197 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:23] [INFO ] Deduced a trap composed of 5 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 20:21:23] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 6 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 20:21:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 4 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 20:21:24] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:24] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [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 20:21:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [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 20:21:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [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 20:21:25] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 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 20:21:25] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:25] [INFO ] Deduced a trap composed of 4 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 20:21:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:26] [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 20:21:26] [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 20:21:26] [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 20:21:26] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:26] [INFO ] Deduced a trap composed of 5 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 20:21:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:27] [INFO ] Deduced a trap composed of 4 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 20:21:27] [INFO ] Deduced a trap composed of 4 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 20:21:27] [INFO ] Deduced a trap composed of 4 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 20:21:27] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:28] [INFO ] Deduced a trap composed of 4 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 20:21:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:28] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:28] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:28] [INFO ] Deduced a trap composed of 6 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 20:21:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 229/260 variables, 31/85 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 196/281 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:32] [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 20:21:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:34] [INFO ] Deduced a trap composed of 4 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 20:21:34] [INFO ] Deduced a trap composed of 4 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 20:21:34] [INFO ] Deduced a trap composed of 6 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 20:21:34] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (OVERLAPS) 1/261 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/261 variables, and 290 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 232/33 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:21:53] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 229/260 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 196/290 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 33/323 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (OVERLAPS) 1/261 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 324 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 232/33 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/87 places, 239/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60604 ms. Remains : 31/87 places, 239/369 transitions.
[2025-06-05 20:22:22] [INFO ] Flatten gal took : 9 ms
[2025-06-05 20:22:22] [INFO ] Flatten gal took : 10 ms
[2025-06-05 20:22:22] [INFO ] Input system was already deterministic with 239 transitions.
[2025-06-05 20:22:22] [INFO ] Flatten gal took : 10 ms
[2025-06-05 20:22:22] [INFO ] Flatten gal took : 10 ms
[2025-06-05 20:22:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12322625080234926791.gal : 2 ms
[2025-06-05 20:22:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11795239401044961607.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/CTLFireability12322625080234926791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11795239401044961607.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,397,0.14428,8340,2,416,5,4133,6,0,355,2409,0


Converting to forward existential form...Done !
original formula: !(A(AG(!((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) * E((p15==1) U ((((p12==1)&&(p26==1))&&((p...297
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))) * ...558
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...302
Hit Full ! (commute/partial/dont) 24/0/215
(forward)formula 0,0,0.659324,14228,1,0,315,17272,505,46,7072,12432,491
FORMULA StigmergyElection-PT-07a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 355
Applied a total of 14 rules in 5 ms. Remains 80 /87 variables (removed 7) and now considering 355/369 (removed 14) transitions.
[2025-06-05 20:22:23] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2025-06-05 20:22:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-05 20:22:23] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2025-06-05 20:22:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:23] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:22:24] [INFO ] Implicit Places using invariants and state equation in 549 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 624 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 355/369 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 4 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2025-06-05 20:22:24] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2025-06-05 20:22:24] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-05 20:22:24] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2025-06-05 20:22:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:24] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:22:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/87 places, 334/369 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 815 ms. Remains : 58/87 places, 334/369 transitions.
[2025-06-05 20:22:24] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:22:24] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:22:24] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-05 20:22:24] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:22:24] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:22:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5073618994932731686.gal : 4 ms
[2025-06-05 20:22:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16899583344154528969.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/CTLFireability5073618994932731686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16899583344154528969.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,80326,0.938369,21672,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: !(A((!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) + E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1))...454
=> equivalent forward existential formula: ([(EY(((FwdU(Init,!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))) * !(((((p...710
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
Hit Full ! (commute/partial/dont) 51/0/283
Hit Full ! (commute/partial/dont) 51/0/283
(forward)formula 0,0,6.28027,112552,1,0,450,217053,699,96,10832,132620,729
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 355
Applied a total of 14 rules in 4 ms. Remains 80 /87 variables (removed 7) and now considering 355/369 (removed 14) transitions.
[2025-06-05 20:22:30] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2025-06-05 20:22:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 20:22:30] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2025-06-05 20:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:30] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:22:31] [INFO ] Implicit Places using invariants and state equation in 543 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 615 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/87 places, 355/369 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 4 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2025-06-05 20:22:31] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2025-06-05 20:22:31] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-05 20:22:31] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2025-06-05 20:22:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:31] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:22:31] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/87 places, 334/369 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 801 ms. Remains : 58/87 places, 334/369 transitions.
[2025-06-05 20:22:31] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:22:31] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:22:31] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-05 20:22:31] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:22:31] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:22:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4968092476991959097.gal : 3 ms
[2025-06-05 20:22:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10848570222880450725.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/CTLFireability4968092476991959097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10848570222880450725.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,80326,0.920649,21544,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: EF(AX(A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)...196
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&...469
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.85441,107688,1,0,451,213949,689,97,10592,130791,727
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 42 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 42 transition count 321
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 42 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 42 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 39 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 36 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 36 transition count 297
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 226 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 29 transition count 171
Applied a total of 247 rules in 31 ms. Remains 29 /87 variables (removed 58) and now considering 171/369 (removed 198) transitions.
[2025-06-05 20:22:37] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2025-06-05 20:22:37] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 20:22:37] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:22:37] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-05 20:22:37] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:22:37] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 20:22:37] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:22:37] [INFO ] Invariant cache hit.
[2025-06-05 20:22:37] [INFO ] State equation strengthened by 134 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:38] [INFO ] Deduced a trap composed of 5 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 20:22:38] [INFO ] Deduced a trap composed of 5 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 20:22:38] [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 20:22:38] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:38] [INFO ] Deduced a trap composed of 4 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 20:22:39] [INFO ] Deduced a trap composed of 4 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 20:22:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 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 20:22:39] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:39] [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 20:22:40] [INFO ] Deduced a trap composed of 5 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 20:22:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [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 20:22:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [INFO ] Deduced a trap composed of 5 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 20:22:40] [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 20:22:40] [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 20:22:40] [INFO ] Deduced a trap composed of 5 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 20:22:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [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 20:22:40] [INFO ] Deduced a trap composed of 5 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 20:22:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [INFO ] Deduced a trap composed of 5 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 20:22:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [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 20:22:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:41] [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 20:22:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:41] [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 20:22:41] [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 20:22:41] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:41] [INFO ] Deduced a trap composed of 4 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 20:22:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:41] [INFO ] Deduced a trap composed of 4 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 20:22:41] [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 20:22:41] [INFO ] Deduced a trap composed of 4 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 20:22:41] [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 20:22:42] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:45] [INFO ] Deduced a trap composed of 4 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 20:22:45] [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 20:22:45] [INFO ] Deduced a trap composed of 4 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 20:22:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:45] [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 20:22:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:52] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:22:53] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 164 unsolved in 23342 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 394 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53644ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53644ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/87 places, 171/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53801 ms. Remains : 29/87 places, 171/369 transitions.
[2025-06-05 20:23:31] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:23:31] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:23:31] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-05 20:23:31] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:23:31] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9198158893670839082.gal : 2 ms
[2025-06-05 20:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8278295209881369974.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/CTLFireability9198158893670839082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8278295209881369974.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,269,0.093412,7012,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) U ((((AG(((((p12==1)&&(p26==1))&&((p40==1)...375
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E(E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p9...450
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
(forward)formula 0,1,0.39182,10340,1,0,266,18058,367,56,5006,13753,394
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 85 transition count 354
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 29 place count 71 transition count 339
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 59 place count 56 transition count 339
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 42 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 42 transition count 321
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 42 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 42 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 39 transition count 303
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 36 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 36 transition count 297
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 226 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 233 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 247 place count 29 transition count 171
Applied a total of 247 rules in 35 ms. Remains 29 /87 variables (removed 58) and now considering 171/369 (removed 198) transitions.
[2025-06-05 20:23:31] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:23:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 20:23:31] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:23:31] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-05 20:23:31] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:23:31] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 20:23:31] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2025-06-05 20:23:31] [INFO ] Invariant cache hit.
[2025-06-05 20:23:31] [INFO ] State equation strengthened by 134 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [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 20:23:33] [INFO ] Deduced a trap composed of 4 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 20:23:33] [INFO ] Deduced a trap composed of 4 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 20:23:33] [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 20:23:33] [INFO ] Deduced a trap composed of 4 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 20:23: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 20:23:33] [INFO ] Deduced a trap composed of 4 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 20:23:33] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:34] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:34] [INFO ] Deduced a trap composed of 4 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 20:23:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:34] [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 20:23:34] [INFO ] Deduced a trap composed of 5 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 20:23:34] [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 20:23:34] [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 20:23:34] [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 20:23:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:34] [INFO ] Deduced a trap composed of 5 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 20:23:34] [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 20:23:34] [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 20:23:34] [INFO ] Deduced a trap composed of 5 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 20:23:34] [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 20:23:34] [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 20:23:34] [INFO ] Deduced a trap composed of 5 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 20:23:34] [INFO ] Deduced a trap composed of 4 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 20:23:34] [INFO ] Deduced a trap composed of 5 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 20:23:34] [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 20:23:34] [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 20:23:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:34] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23: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 20:23:35] [INFO ] Deduced a trap composed of 4 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 20:23:35] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:35] [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 20:23:35] [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 20:23:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:36] [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 20:23:36] [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 20:23:36] [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 20:23:36] [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 20:23:36] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:39] [INFO ] Deduced a trap composed of 4 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 20:23:39] [INFO ] Deduced a trap composed of 4 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 20:23:39] [INFO ] Deduced a trap composed of 4 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 20:23:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:23:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 164 unsolved in 23302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 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, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/229 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 394 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53584ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53585ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/87 places, 171/369 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53754 ms. Remains : 29/87 places, 171/369 transitions.
[2025-06-05 20:24:25] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:24:25] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:24:25] [INFO ] Input system was already deterministic with 171 transitions.
[2025-06-05 20:24:25] [INFO ] Flatten gal took : 6 ms
[2025-06-05 20:24:25] [INFO ] Flatten gal took : 7 ms
[2025-06-05 20:24:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13837445164484814433.gal : 2 ms
[2025-06-05 20:24:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5913557570367957868.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/CTLFireability13837445164484814433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5913557570367957868.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,269,0.087053,7012,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U EG((EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))...288
=> equivalent forward existential formula: [((Init * !(EG(!(EG((E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) ...769
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.44099,12260,1,0,297,22683,371,78,4869,17725,444
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2025-06-05 20:24:25] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:24:25] [INFO ] Flatten gal took : 14 ms
Total runtime 672497 ms.

BK_STOP 1749155066015

--------------------
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-07a"
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-07a, 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-174903491000242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07a.tgz
mv StigmergyElection-PT-07a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;