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-171690532100313.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100313
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717008310105

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:45:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:45:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:45:11] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-29 18:45:11] [INFO ] Transformed 86 places.
[2024-05-29 18:45:11] [INFO ] Transformed 1042 transitions.
[2024-05-29 18:45:11] [INFO ] Found NUPN structural information;
[2024-05-29 18:45:11] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 241
Applied a total of 2 rules in 20 ms. Remains 85 /86 variables (removed 1) and now considering 241/242 (removed 1) transitions.
[2024-05-29 18:45:11] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
// Phase 1: matrix 224 rows 85 cols
[2024-05-29 18:45:11] [INFO ] Computed 6 invariants in 15 ms
[2024-05-29 18:45:11] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-29 18:45:11] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
[2024-05-29 18:45:11] [INFO ] Invariant cache hit.
[2024-05-29 18:45:12] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:12] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 18:45:12] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
[2024-05-29 18:45:12] [INFO ] Invariant cache hit.
[2024-05-29 18:45:12] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:45:13] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 12 ms to minimize.
[2024-05-29 18:45:13] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 10 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 4 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:45:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 8 ms to minimize.
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:45:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:45:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[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 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 44 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:45:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 223/308 variables, 85/168 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 1/309 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 323 constraints, problems are : Problem set: 0 solved, 240 unsolved in 16317 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 223/308 variables, 85/168 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 240/562 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 1/309 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 563 constraints, problems are : Problem set: 0 solved, 240 unsolved in 19600 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 77/77 constraints]
After SMT, in 36571ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 36587ms
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 241/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37008 ms. Remains : 85/86 places, 241/242 transitions.
Support contains 76 out of 85 places after structural reductions.
[2024-05-29 18:45:48] [INFO ] Flatten gal took : 45 ms
[2024-05-29 18:45:48] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:45:48] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 74 out of 85 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (89 resets) in 3370 ms. (11 steps per ms) remains 6/79 properties
BEST_FIRST walk for 40003 steps (117 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
[2024-05-29 18:45:50] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
[2024-05-29 18:45:50] [INFO ] Invariant cache hit.
[2024-05-29 18:45:50] [INFO ] State equation strengthened by 155 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 223/308 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 154/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/309 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 246 constraints, problems are : Problem set: 0 solved, 6 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/85 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:45:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp69 is UNSAT
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:51] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
Problem AtomicPropp77 is UNSAT
After SMT solving in domain Int declared 85/309 variables, and 28 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/85 constraints, ReadFeed: 0/155 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 22/22 constraints]
After SMT, in 1263ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2024-05-29 18:45:51] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:45:51] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:45:51] [INFO ] Input system was already deterministic with 241 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 229
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 229
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 225
Applied a total of 18 rules in 8 ms. Remains 76 /85 variables (removed 9) and now considering 225/241 (removed 16) transitions.
[2024-05-29 18:45:51] [INFO ] Flow matrix only has 215 transitions (discarded 10 similar events)
// Phase 1: matrix 215 rows 76 cols
[2024-05-29 18:45:51] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 18:45:51] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 18:45:51] [INFO ] Flow matrix only has 215 transitions (discarded 10 similar events)
[2024-05-29 18:45:51] [INFO ] Invariant cache hit.
[2024-05-29 18:45:51] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 198 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/85 places, 225/241 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 67 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 67 transition count 217
Applied a total of 16 rules in 6 ms. Remains 67 /75 variables (removed 8) and now considering 217/225 (removed 8) transitions.
[2024-05-29 18:45:51] [INFO ] Flow matrix only has 207 transitions (discarded 10 similar events)
// Phase 1: matrix 207 rows 67 cols
[2024-05-29 18:45:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:45:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 18:45:51] [INFO ] Flow matrix only has 207 transitions (discarded 10 similar events)
[2024-05-29 18:45:51] [INFO ] Invariant cache hit.
[2024-05-29 18:45:51] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:45:51] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/85 places, 217/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 344 ms. Remains : 67/85 places, 217/241 transitions.
[2024-05-29 18:45:51] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:45:51] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:45:51] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-29 18:45:51] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:45:51] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:45:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5426042990946878607.gal : 9 ms
[2024-05-29 18:45:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2442535464159652677.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/CTLCardinality5426042990946878607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2442535464159652677.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,20340,0.086185,6160,2,1153,5,6549,6,0,471,5107,0


Converting to forward existential form...Done !
original formula: (A(((EG(AX((p9==0))) * AX(AF(((p14==0)||(p77==1))))) * (E(EF((p26==0)) U (p74!=1)) * !(((AF((p8==1)) + (p37==0)) + (p16==1))))) U EF(((EG...293
=> equivalent forward existential formula: [(((Init * !((E(!(E(TRUE U ((EG((p76==1)) + !(E(TRUE U !((p22==1))))) + (p34==1)))) U (!(((EG(!(EX(!((p9==0)))))...801
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t13, t14, t15, t16, t17, t18, t20, t21, t22, t23, t24, ...366
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.14148,77592,1,0,591,331925,493,285,5510,273049,847
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-00 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 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 230
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 230
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 74 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 74 transition count 222
Applied a total of 22 rules in 9 ms. Remains 74 /85 variables (removed 11) and now considering 222/241 (removed 19) transitions.
[2024-05-29 18:45:54] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
// Phase 1: matrix 212 rows 74 cols
[2024-05-29 18:45:54] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:45:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 18:45:54] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
[2024-05-29 18:45:54] [INFO ] Invariant cache hit.
[2024-05-29 18:45:54] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:54] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/85 places, 222/241 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 213
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 213
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 59 transition count 208
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 59 transition count 208
Applied a total of 28 rules in 6 ms. Remains 59 /73 variables (removed 14) and now considering 208/222 (removed 14) transitions.
[2024-05-29 18:45:54] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
// Phase 1: matrix 198 rows 59 cols
[2024-05-29 18:45:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:45:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 18:45:54] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-05-29 18:45:54] [INFO ] Invariant cache hit.
[2024-05-29 18:45:54] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:45:54] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/85 places, 208/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 59/85 places, 208/241 transitions.
[2024-05-29 18:45:54] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:45:54] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:45:54] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-29 18:45:54] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:45:54] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:45:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15934821738735477404.gal : 3 ms
[2024-05-29 18:45:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2761308328089258502.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/CTLCardinality15934821738735477404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2761308328089258502.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,20208,0.069977,6260,2,975,5,7434,6,0,432,4086,0


Converting to forward existential form...Done !
original formula: EG(A(((A((p83==1) U AG(((p4==0)||(p68==1)))) * EX(((p49==0)&&(p76==0)))) + (!(AF((p79==1))) * (EX(TRUE) + ((p8==0)&&((p47==0)||(p71==1)))...205
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(!(EX(!(E(((p32==0)||(p81==1)) U (p32==1))))))))) U (!(((!((E(!(!(E(TRUE U !(((p4==0)||(...514
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t20, t22, t24, t25, t27, t29, t30, t34,...347
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,1.03804,43304,1,0,477,180519,457,204,5267,140391,662
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 5 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
[2024-05-29 18:45:55] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-05-29 18:45:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:45:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 18:45:55] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:45:55] [INFO ] Invariant cache hit.
[2024-05-29 18:45:55] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:55] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/85 places, 215/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 59 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 59 transition count 205
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 55 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 55 transition count 201
Applied a total of 28 rules in 4 ms. Remains 55 /69 variables (removed 14) and now considering 201/215 (removed 14) transitions.
[2024-05-29 18:45:55] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
// Phase 1: matrix 194 rows 55 cols
[2024-05-29 18:45:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:45:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 18:45:55] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2024-05-29 18:45:55] [INFO ] Invariant cache hit.
[2024-05-29 18:45:55] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:45:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/85 places, 201/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 55/85 places, 201/241 transitions.
[2024-05-29 18:45:55] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:45:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:56] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-29 18:45:56] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:56] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:45:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11515547653125855601.gal : 2 ms
[2024-05-29 18:45:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11518598976458441947.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/CTLCardinality11515547653125855601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11518598976458441947.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,18928,0.15877,9188,2,1406,5,14380,6,0,414,9682,0


Converting to forward existential form...Done !
original formula: (AF(((EG(AG((p20==1))) + AX(((p46==0)&&(p18==1)))) + (((p59==0)||(p66==1)) * AX(AG((p84==0)))))) + EX(TRUE))
=> equivalent forward existential formula: [FwdG((Init * !(EX(TRUE))),!(((EG(!(E(TRUE U !((p20==1))))) + !(EX(!(((p46==0)&&(p18==1)))))) + (((p59==0)||(p66...210
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t10, t11, t13, t14, t16, t18, t19, t21, t22, t23, t24, t25, t26, t28,...357
(forward)formula 0,1,0.731635,29516,1,0,320,87955,432,84,5556,64976,439
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 227
Applied a total of 18 rules in 8 ms. Remains 76 /85 variables (removed 9) and now considering 227/241 (removed 14) transitions.
[2024-05-29 18:45:56] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
// Phase 1: matrix 217 rows 76 cols
[2024-05-29 18:45:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:45:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 18:45:56] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
[2024-05-29 18:45:56] [INFO ] Invariant cache hit.
[2024-05-29 18:45:56] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:56] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/85 places, 227/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 215
Applied a total of 24 rules in 6 ms. Remains 63 /75 variables (removed 12) and now considering 215/227 (removed 12) transitions.
[2024-05-29 18:45:56] [INFO ] Flow matrix only has 205 transitions (discarded 10 similar events)
// Phase 1: matrix 205 rows 63 cols
[2024-05-29 18:45:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:45:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 18:45:57] [INFO ] Flow matrix only has 205 transitions (discarded 10 similar events)
[2024-05-29 18:45:57] [INFO ] Invariant cache hit.
[2024-05-29 18:45:57] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:45:57] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/85 places, 215/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 63/85 places, 215/241 transitions.
[2024-05-29 18:45:57] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:45:57] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:57] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-29 18:45:57] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:45:57] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2584121476825536478.gal : 3 ms
[2024-05-29 18:45:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5648535233577234226.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/CTLCardinality2584121476825536478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5648535233577234226.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,20432,0.149253,8996,2,1510,5,15638,6,0,457,9838,0


Converting to forward existential form...Done !
original formula: (AX(AF(((p81==0)&&(p72==1)))) + !(E((((((AG((p46==1)) + EG(((p30==0)||(p82==1)))) + ((p0==0)||(p33==1))) * (p52==1)) + (EF((p72==1)) * EX...297
=> equivalent forward existential formula: ([((FwdU((Init * !(!(EX(!(!(EG(!(((p81==0)&&(p72==1)))))))))),(((((!(E(TRUE U !((p46==1)))) + EG(((p30==0)||(p82...668
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t27, t29, ...366
(forward)formula 0,1,0.678007,28532,1,0,315,101360,436,90,5896,71756,435
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 227
Applied a total of 18 rules in 4 ms. Remains 76 /85 variables (removed 9) and now considering 227/241 (removed 14) transitions.
[2024-05-29 18:45:57] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
// Phase 1: matrix 217 rows 76 cols
[2024-05-29 18:45:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:45:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 18:45:57] [INFO ] Flow matrix only has 217 transitions (discarded 10 similar events)
[2024-05-29 18:45:57] [INFO ] Invariant cache hit.
[2024-05-29 18:45:57] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:45:58] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 183 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/85 places, 227/241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 71 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 71 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 70 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 70 transition count 222
Applied a total of 10 rules in 6 ms. Remains 70 /75 variables (removed 5) and now considering 222/227 (removed 5) transitions.
[2024-05-29 18:45:58] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
// Phase 1: matrix 212 rows 70 cols
[2024-05-29 18:45:58] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:45:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 18:45:58] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
[2024-05-29 18:45:58] [INFO ] Invariant cache hit.
[2024-05-29 18:45:58] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:45:58] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 70/85 places, 222/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 70/85 places, 222/241 transitions.
[2024-05-29 18:45:58] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:45:58] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:58] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-29 18:45:58] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:45:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:45:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality14453641686261113581.gal : 3 ms
[2024-05-29 18:45:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality16564318680445886623.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/CTLCardinality14453641686261113581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16564318680445886623.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,20446,0.082134,6344,2,1259,5,7778,6,0,492,5400,0


Converting to forward existential form...Done !
original formula: (AG(A(!(AG((p65==1))) U AX((EF((p55==1)) + !(((p72==0)||(p52==1))))))) + (EX(!(A((((p38==0)||(p19==1))||((p33==1)&&(p28==1))) U E((p47==0...309
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(!((E(!(!(EX(!((E(TRUE U (p55==1)) + !(((p72==0)||(p52==1)))))))) U (!(!(!(E(TRUE U !((...923
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t12, t13, t15, t16, t18, t19, t21, t23, t24, t26, t27, ...371
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.96743,39548,1,0,392,147720,486,141,5654,119541,566
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 83 transition count 219
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 62 transition count 217
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 60 transition count 217
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 47 place count 60 transition count 207
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 67 place count 50 transition count 207
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 77 place count 40 transition count 191
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 40 transition count 191
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 35 transition count 181
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 35 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 104 place count 35 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 4 with 113 rules applied. Total rules applied 217 place count 35 transition count 61
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 229 place count 29 transition count 55
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 23 transition count 49
Applied a total of 235 rules in 47 ms. Remains 23 /85 variables (removed 62) and now considering 49/241 (removed 192) transitions.
[2024-05-29 18:45:59] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 23 cols
[2024-05-29 18:45:59] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:45:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:45:59] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
[2024-05-29 18:45:59] [INFO ] Invariant cache hit.
[2024-05-29 18:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:45:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-29 18:45:59] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-29 18:45:59] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
[2024-05-29 18:45:59] [INFO ] Invariant cache hit.
[2024-05-29 18:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 6/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:45:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 42/65 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 60 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 6/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 18:46:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 42/65 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 92 constraints, problems are : Problem set: 0 solved, 29 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 38/38 constraints]
After SMT, in 1990ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/85 places, 49/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2111 ms. Remains : 23/85 places, 49/241 transitions.
[2024-05-29 18:46:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:46:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:46:01] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-29 18:46:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality6872812432995566312.gal : 1 ms
[2024-05-29 18:46:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14626037625738461063.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/CTLCardinality6872812432995566312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14626037625738461063.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,236,0.017701,3872,2,127,5,975,6,0,135,758,0


Converting to forward existential form...Done !
original formula: E((p81==0) U !(EF(!((((p4==0)||(p49==1))||(p72==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(p81==0)) * !(E(TRUE U !((((p4==0)||(p49==1))||(p72==1))))))] != FALSE
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, t31, t33, t34...255
Hit Full ! (commute/partial/dont) 46/0/3
(forward)formula 0,1,0.044814,4980,1,0,121,5582,120,48,1334,5390,137
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 83 transition count 221
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 64 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 41 place count 63 transition count 209
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 63 place count 52 transition count 209
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 74 place count 41 transition count 192
Iterating global reduction 3 with 11 rules applied. Total rules applied 85 place count 41 transition count 192
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 36 transition count 182
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 36 transition count 182
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 110 place count 36 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 4 with 91 rules applied. Total rules applied 201 place count 36 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 36 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 35 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 213 place count 30 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 30 transition count 70
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 219 place count 25 transition count 65
Applied a total of 219 rules in 43 ms. Remains 25 /85 variables (removed 60) and now considering 65/241 (removed 176) transitions.
[2024-05-29 18:46:01] [INFO ] Flow matrix only has 59 transitions (discarded 6 similar events)
// Phase 1: matrix 59 rows 25 cols
[2024-05-29 18:46:01] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:46:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:46:01] [INFO ] Flow matrix only has 59 transitions (discarded 6 similar events)
[2024-05-29 18:46:01] [INFO ] Invariant cache hit.
[2024-05-29 18:46:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-29 18:46:01] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-29 18:46:01] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-29 18:46:01] [INFO ] Flow matrix only has 59 transitions (discarded 6 similar events)
[2024-05-29 18:46:01] [INFO ] Invariant cache hit.
[2024-05-29 18:46:01] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [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, 64 unsolved
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 58/83 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 81 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 58/83 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 64/144 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 1/84 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/84 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 145 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 34/34 constraints]
After SMT, in 3552ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3553ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/85 places, 65/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3667 ms. Remains : 25/85 places, 65/241 transitions.
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:46:05] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2439726228933120606.gal : 7 ms
[2024-05-29 18:46:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9089886858129872595.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/CTLCardinality2439726228933120606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9089886858129872595.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,222,0.017655,4144,2,162,5,1207,6,0,159,775,0


Converting to forward existential form...Done !
original formula: EF(((AF((EG((p58==1)) * (p52==1))) * (p63==0)) * ((p49==1)&&(p82==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p49==1)&&(p82==1))) * (p63==0)) * !(EG(!((EG((p58==1)) * (p52==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t14, t16, t17, t18, t25, t32, t45, Interse...245
(forward)formula 0,0,0.044831,4460,1,0,114,4853,150,40,1712,3925,147
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 3 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
[2024-05-29 18:46:05] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-05-29 18:46:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:46:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 18:46:05] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:46:05] [INFO ] Invariant cache hit.
[2024-05-29 18:46:05] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:46:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [69]
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 : 69/85 places, 215/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 207
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 207
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 57 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 57 transition count 203
Applied a total of 24 rules in 4 ms. Remains 57 /69 variables (removed 12) and now considering 203/215 (removed 12) transitions.
[2024-05-29 18:46:05] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
// Phase 1: matrix 196 rows 57 cols
[2024-05-29 18:46:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:46:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 18:46:05] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
[2024-05-29 18:46:05] [INFO ] Invariant cache hit.
[2024-05-29 18:46:05] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:46:05] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/85 places, 203/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 57/85 places, 203/241 transitions.
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:46:05] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:46:05] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:46:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12281180517512687113.gal : 2 ms
[2024-05-29 18:46:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15227185453691070367.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/CTLCardinality12281180517512687113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15227185453691070367.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,19313,0.074861,6252,2,1040,5,7013,6,0,424,4639,0


Converting to forward existential form...Done !
original formula: AX(A(AG((!(((p38==0)&&(p60==1))) * (EG(((p79==0)||(p77==1))) + !(((p59==0)||(p11==1)))))) U AF(!(((p31==0)||(p30==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),!(!(EG(!(!(((p31==0)||(p30==1)))))))) * !(!(E(TRUE U !((!(((p38==0)&&(p60==1))) * (EG(((p7...307
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t16, t17, t18, t19, t20, t21, t23, t25, t26, ...361
(forward)formula 0,0,0.738868,30064,1,0,389,89489,424,136,5059,91846,489
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 83 transition count 220
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 63 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 62 transition count 219
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 43 place count 62 transition count 208
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 65 place count 51 transition count 208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 74 place count 42 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 83 place count 42 transition count 194
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 38 transition count 186
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 38 transition count 186
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 98 place count 38 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 105 transitions
Redundant transition composition rules discarded 105 transitions
Iterating global reduction 4 with 105 rules applied. Total rules applied 203 place count 38 transition count 74
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 215 place count 32 transition count 68
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 26 transition count 62
Applied a total of 221 rules in 22 ms. Remains 26 /85 variables (removed 59) and now considering 62/241 (removed 179) transitions.
[2024-05-29 18:46:06] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
// Phase 1: matrix 55 rows 26 cols
[2024-05-29 18:46:06] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:46:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:46:06] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
[2024-05-29 18:46:06] [INFO ] Invariant cache hit.
[2024-05-29 18:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:46:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-29 18:46:06] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-29 18:46:06] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
[2024-05-29 18:46:06] [INFO ] Invariant cache hit.
[2024-05-29 18:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 6/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:46:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 54/80 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/81 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 65 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 6/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-29 18:46:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 54/80 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 34/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/81 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 100 constraints, problems are : Problem set: 0 solved, 34 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 38/38 constraints]
After SMT, in 2278ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 2279ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/85 places, 62/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2361 ms. Remains : 26/85 places, 62/241 transitions.
[2024-05-29 18:46:08] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:46:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:08] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-29 18:46:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:46:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality10586316289954039093.gal : 1 ms
[2024-05-29 18:46:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6211541881997259574.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/CTLCardinality10586316289954039093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6211541881997259574.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,270,0.021054,3996,2,153,5,1242,6,0,159,903,0


Converting to forward existential form...Done !
original formula: E(((p58==0)||(p18==1)) U !(AF((!(AG((p9==1))) * (p47==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((p58==0)||(p18==1))),!((!(!(E(TRUE U !((p9==1))))) * (p47==0))))] != FALSE
Hit Full ! (commute/partial/dont) 51/0/11
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t20, t21, t34, t37...260
(forward)formula 0,1,0.056221,5104,1,0,114,5533,152,44,1755,5314,139
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 80 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 80 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 79 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 79 transition count 231
Applied a total of 12 rules in 7 ms. Remains 79 /85 variables (removed 6) and now considering 231/241 (removed 10) transitions.
[2024-05-29 18:46:08] [INFO ] Flow matrix only has 219 transitions (discarded 12 similar events)
// Phase 1: matrix 219 rows 79 cols
[2024-05-29 18:46:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 18:46:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 18:46:08] [INFO ] Flow matrix only has 219 transitions (discarded 12 similar events)
[2024-05-29 18:46:08] [INFO ] Invariant cache hit.
[2024-05-29 18:46:08] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:46:08] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-29 18:46:08] [INFO ] Flow matrix only has 219 transitions (discarded 12 similar events)
[2024-05-29 18:46:08] [INFO ] Invariant cache hit.
[2024-05-29 18:46:08] [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, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:46:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 5 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:46:11] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:46:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 218/297 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 154/312 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-29 18:46:17] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (OVERLAPS) 1/298 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 14 (OVERLAPS) 0/298 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 314 constraints, problems are : Problem set: 0 solved, 230 unsolved in 15800 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 218/297 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 154/313 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 230/543 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 1/298 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 544 constraints, problems are : Problem set: 0 solved, 230 unsolved in 19825 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 76/76 constraints]
After SMT, in 36093ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 36100ms
Starting structural reductions in LTL mode, iteration 1 : 79/85 places, 231/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36289 ms. Remains : 79/85 places, 231/241 transitions.
[2024-05-29 18:46:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:45] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:46:45] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-29 18:46:45] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:46:45] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:46:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7391570330974740011.gal : 2 ms
[2024-05-29 18:46:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality15844255249904869263.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/CTLCardinality7391570330974740011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15844255249904869263.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,20462,0.110224,7520,2,1477,5,10750,6,0,529,6101,0


Converting to forward existential form...Done !
original formula: ((EX(TRUE) + EF(((((!(E((p76==1) U ((p33==0)||(p36==1)))) + A((AG(((p20==0)||(p62==1))) * (p7!=1)) U ((p43==0)||(p51==1)))) + (((p62==0)&...267
=> equivalent forward existential formula: [(EY(FwdU((Init * !((EX(TRUE) + E(TRUE U ((((!(E((p76==1) U ((p33==0)||(p36==1)))) + !((E(!(((p43==0)||(p51==1))...417
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t13, t14, t16, t18, t19, t21, t22, t26, t27, t29, t30, ...371
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.78733,64008,1,0,409,259770,499,157,5864,194370,586
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 230
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 226
Applied a total of 18 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 226/241 (removed 15) transitions.
[2024-05-29 18:46:46] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
// Phase 1: matrix 216 rows 76 cols
[2024-05-29 18:46:46] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 18:46:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 18:46:46] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
[2024-05-29 18:46:46] [INFO ] Invariant cache hit.
[2024-05-29 18:46:46] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:46:47] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-29 18:46:47] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
[2024-05-29 18:46:47] [INFO ] Invariant cache hit.
[2024-05-29 18:46:47] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:46:49] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:46:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 215/291 variables, 76/143 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 154/297 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:46:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:46:56] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 1/292 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (OVERLAPS) 0/292 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 301 constraints, problems are : Problem set: 0 solved, 225 unsolved in 17552 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:47:05] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:47:07] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 215/291 variables, 76/149 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 154/303 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 225/528 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-29 18:47:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (OVERLAPS) 1/292 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/292 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 531 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 72/72 constraints]
After SMT, in 48029ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 48032ms
Starting structural reductions in LTL mode, iteration 1 : 76/85 places, 226/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48225 ms. Remains : 76/85 places, 226/241 transitions.
[2024-05-29 18:47:35] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:47:35] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:35] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-29 18:47:35] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:35] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality1930503371596448913.gal : 2 ms
[2024-05-29 18:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality244795650894561732.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/CTLCardinality1930503371596448913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality244795650894561732.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,20438,0.237133,12272,2,3701,5,20406,6,0,516,11398,0


Converting to forward existential form...Done !
original formula: EX(AX(((AF((((p85==0)||(p43==1))||((p14==0)||(p9==1)))) * (((p21==0)||(p58==1))||((p8==0)&&(p35==1)))) * (((p55==1)||(p83==0))||((p16==1)...193
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(((!(EG(!((((p85==0)||(p43==1))||((p14==0)||(p9==1)))))) * (((p21==0)||(p58==1))||((p8==0)&&(...250
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t16, t18, t19, t21, t23, t24, t25, t26, t...375
(forward)formula 0,0,2.02197,65332,1,0,381,141584,466,120,6132,99397,533
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 3 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
[2024-05-29 18:47:37] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-05-29 18:47:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:47:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 18:47:37] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:47:37] [INFO ] Invariant cache hit.
[2024-05-29 18:47:37] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:47:37] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 189 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/85 places, 215/241 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 58 transition count 204
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 58 transition count 204
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 52 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 52 transition count 198
Applied a total of 34 rules in 4 ms. Remains 52 /69 variables (removed 17) and now considering 198/215 (removed 17) transitions.
[2024-05-29 18:47:37] [INFO ] Flow matrix only has 191 transitions (discarded 7 similar events)
// Phase 1: matrix 191 rows 52 cols
[2024-05-29 18:47:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:47:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:47:37] [INFO ] Flow matrix only has 191 transitions (discarded 7 similar events)
[2024-05-29 18:47:37] [INFO ] Invariant cache hit.
[2024-05-29 18:47:37] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:47:37] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/85 places, 198/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 52/85 places, 198/241 transitions.
[2024-05-29 18:47:37] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:47:37] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:37] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-29 18:47:37] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:37] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:47:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1350270521530058571.gal : 4 ms
[2024-05-29 18:47:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17120786859257022694.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/CTLCardinality1350270521530058571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17120786859257022694.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,18414,0.061441,6228,2,709,5,5128,6,0,399,2967,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(((p81!=1)&&(p72!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((p81!=1)&&(p72!=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t8, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t31,...347
(forward)formula 0,1,0.468807,20800,1,0,319,64403,409,94,4954,48394,455
FORMULA StigmergyElection-PT-06a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 3 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
[2024-05-29 18:47:38] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-05-29 18:47:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:47:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 18:47:38] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:47:38] [INFO ] Invariant cache hit.
[2024-05-29 18:47:38] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:47:38] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/85 places, 215/241 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 206
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 57 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 57 transition count 203
Applied a total of 24 rules in 4 ms. Remains 57 /69 variables (removed 12) and now considering 203/215 (removed 12) transitions.
[2024-05-29 18:47:38] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
// Phase 1: matrix 196 rows 57 cols
[2024-05-29 18:47:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:47:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 18:47:38] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
[2024-05-29 18:47:38] [INFO ] Invariant cache hit.
[2024-05-29 18:47:38] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:47:38] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/85 places, 203/241 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 57/85 places, 203/241 transitions.
[2024-05-29 18:47:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:47:38] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:47:38] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-29 18:47:38] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:38] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9186668313261296708.gal : 1 ms
[2024-05-29 18:47:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality14638150920727249093.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/CTLCardinality9186668313261296708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14638150920727249093.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,18419,0.065984,6252,2,834,5,6319,6,0,424,3424,0


Converting to forward existential form...Done !
original formula: E((!((AG(!((((p51==0)||(p39==1))&&((p10==0)||(p74==1))))) + EX((p10==0)))) * !(EF(((((p56==1)&&((p12==0)||(p11==1)))||(p82==1))||(p54==0)...211
=> equivalent forward existential formula: [((FwdU(FwdU(Init,(!((!(E(TRUE U !(!((((p51==0)||(p39==1))&&((p10==0)||(p74==1))))))) + EX((p10==0)))) * !(E(TRU...300
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t31,...347
(forward)formula 0,1,0.549036,23200,1,0,338,78678,429,112,5177,57346,506
FORMULA StigmergyElection-PT-06a-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 83 transition count 219
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 62 transition count 219
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 43 place count 62 transition count 207
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 67 place count 50 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 43 transition count 196
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 43 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 39 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 39 transition count 188
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 39 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 200 place count 39 transition count 77
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 3 with 12 rules applied. Total rules applied 212 place count 33 transition count 71
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 33 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 33 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 33 transition count 69
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 221 place count 28 transition count 64
Applied a total of 221 rules in 23 ms. Remains 28 /85 variables (removed 57) and now considering 64/241 (removed 177) transitions.
[2024-05-29 18:47:38] [INFO ] Flow matrix only has 54 transitions (discarded 10 similar events)
// Phase 1: matrix 54 rows 28 cols
[2024-05-29 18:47:38] [INFO ] Computed 3 invariants in 0 ms
[2024-05-29 18:47:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:47:38] [INFO ] Flow matrix only has 54 transitions (discarded 10 similar events)
[2024-05-29 18:47:38] [INFO ] Invariant cache hit.
[2024-05-29 18:47:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-29 18:47:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 18:47:39] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-29 18:47:39] [INFO ] Flow matrix only has 54 transitions (discarded 10 similar events)
[2024-05-29 18:47:39] [INFO ] Invariant cache hit.
[2024-05-29 18:47:39] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:47:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 53/81 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 1/82 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1788 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:47:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 53/81 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 1/82 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (OVERLAPS) 0/82 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 144 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 33/33 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3280ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/85 places, 64/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3369 ms. Remains : 28/85 places, 64/241 transitions.
[2024-05-29 18:47:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:47:42] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:47:42] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-29 18:47:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:47:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:47:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2025956071448893854.gal : 1 ms
[2024-05-29 18:47:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8244513867666581334.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/CTLCardinality2025956071448893854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8244513867666581334.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,285,0.022065,4004,2,206,5,1522,6,0,162,1057,0


Converting to forward existential form...Done !
original formula: (EF(AG(((p64!=0)&&(p19!=1)))) * EF(AG(((((p36!=0)&&(p31!=1))||(p82!=1))&&(p1==1)))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(E(TRUE U !(((p64!=0)&&(p19!=1))))))),TRUE) * !(E(TRUE U !(((((p36!=0)&&(p31!=1))||(p82...184
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t16, t17, t19, t28, t38, t39, t41, Inter...247
(forward)formula 0,0,0.050501,4848,1,0,107,6769,139,42,1642,5126,130
FORMULA StigmergyElection-PT-06a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 18:47:42] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:47:42] [INFO ] Flatten gal took : 6 ms
Total runtime 151063 ms.

BK_STOP 1717008462442

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-171690532100313"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;