Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100314.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 11 18:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 11 18:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 565K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717008315165

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:45:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:45:16] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-29 18:45:16] [INFO ] Transformed 86 places.
[2024-05-29 18:45:16] [INFO ] Transformed 1042 transitions.
[2024-05-29 18:45:16] [INFO ] Found NUPN structural information;
[2024-05-29 18:45:16] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 233
Applied a total of 14 rules in 22 ms. Remains 79 /86 variables (removed 7) and now considering 233/242 (removed 9) transitions.
[2024-05-29 18:45:16] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
// Phase 1: matrix 222 rows 79 cols
[2024-05-29 18:45:16] [INFO ] Computed 2 invariants in 9 ms
[2024-05-29 18:45:16] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-29 18:45:16] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
[2024-05-29 18:45:16] [INFO ] Invariant cache hit.
[2024-05-29 18:45:16] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:17] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-29 18:45:17] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
[2024-05-29 18:45:17] [INFO ] Invariant cache hit.
[2024-05-29 18:45:17] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 9 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:45:21] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 9 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 221/300 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 154/311 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 1/301 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 314 constraints, problems are : Problem set: 0 solved, 232 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:45:40] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 221/300 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 154/316 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 232/548 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 1/301 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 549 constraints, problems are : Problem set: 0 solved, 232 unsolved in 27727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 81/81 constraints]
After SMT, in 48354ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 48372ms
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 233/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48828 ms. Remains : 79/86 places, 233/242 transitions.
Support contains 17 out of 79 places after structural reductions.
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 45 ms
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:46:05] [INFO ] Input system was already deterministic with 233 transitions.
Reduction of identical properties reduced properties to check from 18 to 12
RANDOM walk for 40000 steps (71 resets) in 1851 ms. (21 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
[2024-05-29 18:46:06] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
[2024-05-29 18:46:06] [INFO ] Invariant cache hit.
[2024-05-29 18:46:06] [INFO ] State equation strengthened by 155 read => feed constraints.
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 300/301 variables, and 89 constraints, problems are : Problem set: 2 solved, 0 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 0/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 509ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2024-05-29 18:46:06] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:46:07] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:46:07] [INFO ] Input system was already deterministic with 233 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 7 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:46:07] [INFO ] Computed 2 invariants in 8 ms
[2024-05-29 18:46:07] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:46:07] [INFO ] Invariant cache hit.
[2024-05-29 18:46:07] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:46:07] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 213/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 56 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 56 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 50 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 50 transition count 195
Applied a total of 36 rules in 7 ms. Remains 50 /68 variables (removed 18) and now considering 195/213 (removed 18) transitions.
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:46:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:46:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:46:07] [INFO ] Invariant cache hit.
[2024-05-29 18:46:07] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:46:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/79 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 354 ms. Remains : 50/79 places, 195/233 transitions.
[2024-05-29 18:46:07] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:46:07] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:46:07] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-29 18:46:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:46:07] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:46:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10039286769174957518.gal : 5 ms
[2024-05-29 18:46:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17382668733303779420.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10039286769174957518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17382668733303779420.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,16366,0.151095,8520,2,1169,5,12279,6,0,388,8183,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.154134,8520,1,0,6,12279,7,1,830,8183,1
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 77 transition count 220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 65 transition count 220
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 65 transition count 202
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 47 transition count 202
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 35 transition count 184
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 35 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 35 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 31 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 31 transition count 173
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 156 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 31 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 174 place count 25 transition count 101
Applied a total of 174 rules in 53 ms. Remains 25 /79 variables (removed 54) and now considering 101/233 (removed 132) transitions.
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
// Phase 1: matrix 94 rows 25 cols
[2024-05-29 18:46:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:46:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 18:46:07] [INFO ] Invariant cache hit.
[2024-05-29 18:46:07] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 18:46:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 18:46:07] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 18:46:07] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 18:46:07] [INFO ] Invariant cache hit.
[2024-05-29 18:46:07] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 8 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/134 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:46:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 43/43 constraints]
After SMT, in 7023ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7026ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/79 places, 101/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7163 ms. Remains : 25/79 places, 101/233 transitions.
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:46:14] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:46:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:46:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12262972718999879134.gal : 2 ms
[2024-05-29 18:46:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3400781527158924695.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12262972718999879134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3400781527158924695.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,139,0.025053,4796,2,220,5,1538,6,0,195,915,0


Converting to forward existential form...Done !
original formula: A(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) U A(!((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68...326
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))))))) U (!...1502
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t26, t28, t30...271
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.111411,6696,1,0,195,9420,231,57,2512,7543,264
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 79 transition count 221
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 67 transition count 221
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 61 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 61 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 55 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 55 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 55 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 52 transition count 193
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 52 transition count 193
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 85 place count 52 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 52 transition count 159
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 46 transition count 153
Applied a total of 103 rules in 29 ms. Remains 46 /79 variables (removed 33) and now considering 153/233 (removed 80) transitions.
[2024-05-29 18:46:15] [INFO ] Flow matrix only has 146 transitions (discarded 7 similar events)
// Phase 1: matrix 146 rows 46 cols
[2024-05-29 18:46:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:46:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:46:15] [INFO ] Flow matrix only has 146 transitions (discarded 7 similar events)
[2024-05-29 18:46:15] [INFO ] Invariant cache hit.
[2024-05-29 18:46:15] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-29 18:46:15] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-29 18:46:15] [INFO ] Redundant transitions in 6 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-29 18:46:15] [INFO ] Flow matrix only has 146 transitions (discarded 7 similar events)
[2024-05-29 18:46:15] [INFO ] Invariant cache hit.
[2024-05-29 18:46:15] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:46:15] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:46:15] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:15] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:46:15] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:46:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:15] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:16] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:46:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 145/191 variables, 46/92 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 118/210 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 1/192 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 211 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 18:46:22] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 145/191 variables, 46/93 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 118/211 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 152/363 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 364 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 45/45 constraints]
After SMT, in 15946ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 15948ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/79 places, 153/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16087 ms. Remains : 46/79 places, 153/233 transitions.
[2024-05-29 18:46:31] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:46:31] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:31] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-29 18:46:31] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:31] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:46:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16832940381530737160.gal : 3 ms
[2024-05-29 18:46:31] [INFO ] Time to serialize properties into /tmp/CTLFireability20130686585402672.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16832940381530737160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability20130686585402672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,1060,0.076321,5948,2,1210,5,4427,6,0,328,2313,0


Converting to forward existential form...Done !
original formula: AG((AG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))) + EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1...272
=> equivalent forward existential formula: [((FwdU((FwdU(Init,TRUE) * !(EG((((p18==0)||(p85==0))&&((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||((p68==0)|...345
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t128, t130, t132, t134, t136, t138, t140, ...285
(forward)formula 0,0,0.491863,21788,1,0,258,47398,328,85,4148,31471,396
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 70 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 70 transition count 215
Applied a total of 18 rules in 5 ms. Remains 70 /79 variables (removed 9) and now considering 215/233 (removed 18) transitions.
[2024-05-29 18:46:31] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-05-29 18:46:31] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:46:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:46:31] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:46:31] [INFO ] Invariant cache hit.
[2024-05-29 18:46:31] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:46:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-29 18:46:31] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:46:31] [INFO ] Invariant cache hit.
[2024-05-29 18:46:31] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:46:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:46:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:46:35] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:36] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:46:37] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:46:38] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 207/277 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 154/297 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2024-05-29 18:46:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 15 (OVERLAPS) 1/278 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 17 (OVERLAPS) 0/278 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 301 constraints, problems are : Problem set: 0 solved, 214 unsolved in 17562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 207/277 variables, 70/153 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 154/307 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 214/521 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 12 (OVERLAPS) 1/278 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 14 (OVERLAPS) 0/278 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 522 constraints, problems are : Problem set: 0 solved, 214 unsolved in 26397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 81/81 constraints]
After SMT, in 44344ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 44347ms
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 215/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44486 ms. Remains : 70/79 places, 215/233 transitions.
[2024-05-29 18:47:16] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:47:16] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:47:16] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-29 18:47:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:47:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15688380663289908505.gal : 2 ms
[2024-05-29 18:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7022235416505498461.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15688380663289908505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7022235416505498461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,19988,0.124138,8280,2,1330,5,10522,6,0,486,6196,0


Converting to forward existential form...Done !
original formula: A((EG(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p58!=1))))) + (AX((EF(((((p12==1)&&(p26==1))&&((p40==1)&&...913
=> equivalent forward existential formula: [((Init * !(EG(!(E((E(TRUE U !(!((E(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) U (!...3292
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t16, t17, t18, t20, t21, t22, t23, t25, t...375
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.10494,43124,1,0,415,142716,473,138,5710,109486,583
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 71 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 71 transition count 217
Applied a total of 16 rules in 5 ms. Remains 71 /79 variables (removed 8) and now considering 217/233 (removed 16) transitions.
[2024-05-29 18:47:17] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 71 cols
[2024-05-29 18:47:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:47:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:47:17] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2024-05-29 18:47:17] [INFO ] Invariant cache hit.
[2024-05-29 18:47:17] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:47:17] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 217/233 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 59 transition count 206
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 59 transition count 206
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 53 transition count 200
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 53 transition count 200
Applied a total of 34 rules in 6 ms. Remains 53 /70 variables (removed 17) and now considering 200/217 (removed 17) transitions.
[2024-05-29 18:47:17] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
// Phase 1: matrix 192 rows 53 cols
[2024-05-29 18:47:17] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:47:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:47:17] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2024-05-29 18:47:17] [INFO ] Invariant cache hit.
[2024-05-29 18:47:17] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:47:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/79 places, 200/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 53/79 places, 200/233 transitions.
[2024-05-29 18:47:17] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:17] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:17] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-29 18:47:17] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:17] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13436747121835578523.gal : 2 ms
[2024-05-29 18:47:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18118720462745740862.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13436747121835578523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18118720462745740862.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,19438,0.070628,6232,2,772,5,5814,6,0,404,3824,0


Converting to forward existential form...Done !
original formula: A(!(((AF(!(A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))) U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68=...877
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(((!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) + !(EG(!(((((p12=...1849
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, t27, t29, t31, t32,...347
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.703368,29512,1,0,417,103286,431,155,5166,77696,617
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 9 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:47:18] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:47:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:47:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 18:47:18] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:47:18] [INFO ] Invariant cache hit.
[2024-05-29 18:47:18] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:47:18] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 213/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 56 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 56 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 50 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 50 transition count 195
Applied a total of 36 rules in 7 ms. Remains 50 /68 variables (removed 18) and now considering 195/213 (removed 18) transitions.
[2024-05-29 18:47:18] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:47:18] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:47:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 18:47:18] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:47:18] [INFO ] Invariant cache hit.
[2024-05-29 18:47:18] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:47:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/79 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 50/79 places, 195/233 transitions.
[2024-05-29 18:47:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:18] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-29 18:47:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16497306437995046248.gal : 2 ms
[2024-05-29 18:47:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11038588603621168628.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16497306437995046248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11038588603621168628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,16366,0.146285,8632,2,1169,5,12279,6,0,388,8183,0


Converting to forward existential form...Done !
original formula: !(A(EX(EX(TRUE)) U E(EG(!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p12==1)&&(p26==1))))&&(((p40==1)&&(p54...268
=> equivalent forward existential formula: ([((FwdU(Init,!(E(EG(!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p12==1)&&(p26==1...831
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, t43, t44,...312
Using saturation style SCC detection
(forward)formula 0,1,0.747484,29476,1,0,345,87921,416,98,5373,64073,496
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 14 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:47:19] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:47:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:47:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:47:19] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:47:19] [INFO ] Invariant cache hit.
[2024-05-29 18:47:19] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:47:19] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-29 18:47:19] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:47:19] [INFO ] Invariant cache hit.
[2024-05-29 18:47:19] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:47:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:47:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:27] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 205/274 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 154/297 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 1/275 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 18 (OVERLAPS) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 299 constraints, problems are : Problem set: 0 solved, 212 unsolved in 17665 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:47:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 205/274 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 212/522 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 1/275 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (OVERLAPS) 0/275 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 523 constraints, problems are : Problem set: 0 solved, 212 unsolved in 21864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 85/85 constraints]
After SMT, in 39930ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 39932ms
Starting structural reductions in LTL mode, iteration 1 : 69/79 places, 213/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40074 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 18:47:59] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:47:59] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:47:59] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-29 18:47:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4256525456132913410.gal : 2 ms
[2024-05-29 18:47:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1488379510345732800.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4256525456132913410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1488379510345732800.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,19745,0.201218,11972,2,3255,5,19205,6,0,480,9951,0


Converting to forward existential form...Done !
original formula: AG(AX((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))) + ((EX(((p46==0)||(p85==0))) * EF(((((p12==1)&&(p26==1))&&((p...273
=> equivalent forward existential formula: (([((EY(FwdU(Init,TRUE)) * !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))))) * !(EX(((p46...562
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, ...371
(forward)formula 0,0,2.13544,75772,1,0,342,216615,442,112,6087,137313,488
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 12 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:48:01] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:01] [INFO ] Invariant cache hit.
[2024-05-29 18:48:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 18:48:01] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:01] [INFO ] Invariant cache hit.
[2024-05-29 18:48:01] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:48:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 213/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 56 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 56 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 50 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 50 transition count 195
Applied a total of 36 rules in 4 ms. Remains 50 /68 variables (removed 18) and now considering 195/213 (removed 18) transitions.
[2024-05-29 18:48:01] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:48:01] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:48:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 18:48:01] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:48:01] [INFO ] Invariant cache hit.
[2024-05-29 18:48:02] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:48:02] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/79 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 50/79 places, 195/233 transitions.
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:02] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14051334783721023309.gal : 1 ms
[2024-05-29 18:48:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14879768038863486349.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14051334783721023309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14879768038863486349.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,16366,0.147282,8636,2,1169,5,12279,6,0,388,8183,0


Converting to forward existential form...Done !
original formula: EX(A((EX(!(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))))) + ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((...332
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EG((!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) + EG(((((p12==1...719
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, t43, t44,...312
(forward)formula 0,1,0.570291,22100,1,0,280,54989,414,71,5418,42755,413
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-07 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 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 3 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:48:02] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:48:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:48:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:48:02] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:02] [INFO ] Invariant cache hit.
[2024-05-29 18:48:02] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:48:02] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 213/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 56 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 56 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 50 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 50 transition count 195
Applied a total of 36 rules in 3 ms. Remains 50 /68 variables (removed 18) and now considering 195/213 (removed 18) transitions.
[2024-05-29 18:48:02] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:48:02] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:48:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:48:02] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:48:02] [INFO ] Invariant cache hit.
[2024-05-29 18:48:02] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:48:02] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/79 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 50/79 places, 195/233 transitions.
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:02] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:02] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6840437042530091818.gal : 1 ms
[2024-05-29 18:48:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11103733048950643044.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6840437042530091818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11103733048950643044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,16366,0.143769,8640,2,1169,5,12279,6,0,388,8183,0


Converting to forward existential form...Done !
original formula: EX(AF((((EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) * (p12==1)) * ((p26==1)&&(p40==1))) * (((p54==1)&&(p68=...173
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) * (p12==1)) * ((...224
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, t43, t44,...312
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.670088,26328,1,0,345,84671,413,113,5519,60192,481
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-08 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 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 5 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:48:03] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:48:03] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:48:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 18:48:03] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:03] [INFO ] Invariant cache hit.
[2024-05-29 18:48:03] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:48:03] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 213/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 56 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 56 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 50 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 50 transition count 195
Applied a total of 36 rules in 2 ms. Remains 50 /68 variables (removed 18) and now considering 195/213 (removed 18) transitions.
[2024-05-29 18:48:03] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:48:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:48:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:48:03] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:48:03] [INFO ] Invariant cache hit.
[2024-05-29 18:48:03] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:48:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/79 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 50/79 places, 195/233 transitions.
[2024-05-29 18:48:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:03] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-29 18:48:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9049901894558936209.gal : 1 ms
[2024-05-29 18:48:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8185358445688906838.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9049901894558936209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8185358445688906838.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,16366,0.144305,8636,2,1169,5,12279,6,0,388,8183,0


Converting to forward existential form...Done !
original formula: (EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) + EF(EX(!(E(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(...255
=> equivalent forward existential formula: ([(EY(Init) * ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))))] != FALSE + [(EY(FwdU(Init,T...333
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, t43, t44,...312
(forward)formula 0,0,0.878428,35296,1,0,287,91912,407,86,5513,57467,433
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 77 transition count 220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 65 transition count 220
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 65 transition count 202
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 47 transition count 202
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 35 transition count 184
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 35 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 35 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 31 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 31 transition count 173
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 156 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 31 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 174 place count 25 transition count 101
Applied a total of 174 rules in 19 ms. Remains 25 /79 variables (removed 54) and now considering 101/233 (removed 132) transitions.
[2024-05-29 18:48:04] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
// Phase 1: matrix 94 rows 25 cols
[2024-05-29 18:48:04] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:48:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 18:48:04] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 18:48:04] [INFO ] Invariant cache hit.
[2024-05-29 18:48:04] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 18:48:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-29 18:48:04] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 18:48:04] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 18:48:04] [INFO ] Invariant cache hit.
[2024-05-29 18:48:04] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/134 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:48:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 43/43 constraints]
After SMT, in 6571ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 6572ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/79 places, 101/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6673 ms. Remains : 25/79 places, 101/233 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:48:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16582776168557279531.gal : 1 ms
[2024-05-29 18:48:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14557092224027496065.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16582776168557279531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14557092224027496065.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,139,0.028414,4792,2,220,5,1538,6,0,195,915,0


Converting to forward existential form...Done !
original formula: EG(A(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) U AF(!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p...178
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!(!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))))))))) U (!(!(...426
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t26, t28, t30...271
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.087199,5900,1,0,175,6854,226,51,2439,5998,229
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 4 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:48:11] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:48:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:48:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 18:48:11] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:11] [INFO ] Invariant cache hit.
[2024-05-29 18:48:11] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:48:11] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 213/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 56 transition count 201
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 56 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 50 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 50 transition count 195
Applied a total of 36 rules in 3 ms. Remains 50 /68 variables (removed 18) and now considering 195/213 (removed 18) transitions.
[2024-05-29 18:48:11] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:48:11] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:48:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:48:11] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:48:11] [INFO ] Invariant cache hit.
[2024-05-29 18:48:11] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:48:11] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/79 places, 195/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 50/79 places, 195/233 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4588462748156025504.gal : 2 ms
[2024-05-29 18:48:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3654365441841356726.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4588462748156025504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3654365441841356726.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,16366,0.147713,8640,2,1169,5,12279,6,0,388,8183,0


Converting to forward existential form...Done !
original formula: AF(EX(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))))))] = FALSE
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, t43, t44,...312
(forward)formula 0,1,0.622033,24216,1,0,299,57620,408,93,5314,43541,432
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-11 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 : 79/79 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 77 transition count 220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 65 transition count 220
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 65 transition count 202
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 47 transition count 202
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 35 transition count 184
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 35 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 35 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 31 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 31 transition count 173
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 156 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 31 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 174 place count 25 transition count 101
Applied a total of 174 rules in 19 ms. Remains 25 /79 variables (removed 54) and now considering 101/233 (removed 132) transitions.
[2024-05-29 18:48:12] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
// Phase 1: matrix 94 rows 25 cols
[2024-05-29 18:48:12] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:48:12] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-29 18:48:12] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 18:48:12] [INFO ] Invariant cache hit.
[2024-05-29 18:48:12] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 18:48:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 18:48:12] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 18:48:12] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 18:48:12] [INFO ] Invariant cache hit.
[2024-05-29 18:48:12] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:48:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/134 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:48:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 43/43 constraints]
After SMT, in 6829ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 6829ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/79 places, 101/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6923 ms. Remains : 25/79 places, 101/233 transitions.
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:48:19] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3059764086740300478.gal : 3 ms
[2024-05-29 18:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9735610372416195532.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3059764086740300478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9735610372416195532.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,139,0.023811,4796,2,220,5,1538,6,0,195,915,0


Converting to forward existential form...Done !
original formula: AG(!(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1))) U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(...167
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) * ((((p12==1)&&(p26...216
Hit Full ! (commute/partial/dont) 19/60/82
(forward)formula 0,0,0.029751,5112,1,0,6,1538,14,1,905,915,3
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 72 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 72 transition count 219
Applied a total of 14 rules in 1 ms. Remains 72 /79 variables (removed 7) and now considering 219/233 (removed 14) transitions.
[2024-05-29 18:48:19] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 72 cols
[2024-05-29 18:48:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:48:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 18:48:19] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2024-05-29 18:48:19] [INFO ] Invariant cache hit.
[2024-05-29 18:48:19] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:48:19] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 219/233 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 61 transition count 209
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 61 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 55 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 55 transition count 203
Applied a total of 32 rules in 3 ms. Remains 55 /71 variables (removed 16) and now considering 203/219 (removed 16) transitions.
[2024-05-29 18:48:19] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
// Phase 1: matrix 195 rows 55 cols
[2024-05-29 18:48:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:48:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:48:19] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-05-29 18:48:19] [INFO ] Invariant cache hit.
[2024-05-29 18:48:19] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:48:19] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/79 places, 203/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 55/79 places, 203/233 transitions.
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:19] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1754304691149029031.gal : 1 ms
[2024-05-29 18:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15372087513000321135.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1754304691149029031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15372087513000321135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,19950,0.077743,6252,2,1019,5,7482,6,0,415,4747,0


Converting to forward existential form...Done !
original formula: (AX(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||((p68==0)||(p82==0)))) * EG(A(((EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p6...656
=> equivalent forward existential formula: ([(EY(Init) * !(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||((p68==0)||(p82==0)))))] = FALSE * [(Init * !(EG(...1268
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t13, t14, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30,...357
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.686845,29536,1,0,473,124737,440,176,5155,94443,612
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-14 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 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 4 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
[2024-05-29 18:48:20] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 69 cols
[2024-05-29 18:48:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:48:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 18:48:20] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:20] [INFO ] Invariant cache hit.
[2024-05-29 18:48:20] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:48:20] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-29 18:48:20] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-29 18:48:20] [INFO ] Invariant cache hit.
[2024-05-29 18:48:20] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:48:21] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:48:22] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:48:23] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:48:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:25] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:48:25] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:48:25] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:25] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:48:25] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:25] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:48:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:26] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:48:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:26] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:48:26] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:48:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:48:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:48:27] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:48:27] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:27] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 205/274 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 154/297 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 1/275 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 18 (OVERLAPS) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 299 constraints, problems are : Problem set: 0 solved, 212 unsolved in 17167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:38] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:48:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:48:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:48:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:48:39] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:48:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:48:39] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:48:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
[2024-05-29 18:48:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-29 18:48:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 205/274 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 212/522 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 1/275 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (OVERLAPS) 0/275 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 523 constraints, problems are : Problem set: 0 solved, 212 unsolved in 21741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 85/85 constraints]
After SMT, in 39258ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 39260ms
Starting structural reductions in LTL mode, iteration 1 : 69/79 places, 213/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39389 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 18:48:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:48:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:59] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-29 18:48:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16414027268308475435.gal : 2 ms
[2024-05-29 18:48:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10799394101460693205.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16414027268308475435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10799394101460693205.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,19745,0.200769,11968,2,3255,5,19205,6,0,480,9951,0


Converting to forward existential form...Done !
original formula: E((AX((EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) + AF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p6...656
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(!((EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&((p68==1)&&(p82==1)))) + !(EG(!((((((p12=...738
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, ...371
(forward)formula 0,0,2.25148,78436,1,0,422,228239,453,138,5967,149363,599
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 18:49:02] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:49:02] [INFO ] Flatten gal took : 6 ms
Total runtime 226054 ms.

BK_STOP 1717008542345

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-06a"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-06a, 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 r400-tall-171690532100314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-06a.tgz
mv StigmergyElection-PT-06a 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;