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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 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 117K 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-03b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717006761197

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:19:22] [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:19:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:19:22] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-29 18:19:22] [INFO ] Transformed 427 places.
[2024-05-29 18:19:22] [INFO ] Transformed 518 transitions.
[2024-05-29 18:19:22] [INFO ] Found NUPN structural information;
[2024-05-29 18:19:22] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 100 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 395 transition count 486
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 395 transition count 486
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 387 transition count 478
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 387 transition count 478
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 386 transition count 477
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 386 transition count 477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 385 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 385 transition count 476
Applied a total of 84 rules in 96 ms. Remains 385 /427 variables (removed 42) and now considering 476/518 (removed 42) transitions.
// Phase 1: matrix 476 rows 385 cols
[2024-05-29 18:19:22] [INFO ] Computed 4 invariants in 23 ms
[2024-05-29 18:19:22] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-29 18:19:22] [INFO ] Invariant cache hit.
[2024-05-29 18:19:23] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2024-05-29 18:19:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-05-29 18:19:29] [INFO ] Deduced a trap composed of 233 places in 126 ms of which 21 ms to minimize.
[2024-05-29 18:19:29] [INFO ] Deduced a trap composed of 180 places in 129 ms of which 3 ms to minimize.
[2024-05-29 18:19:29] [INFO ] Deduced a trap composed of 175 places in 101 ms of which 3 ms to minimize.
[2024-05-29 18:19:29] [INFO ] Deduced a trap composed of 182 places in 106 ms of which 3 ms to minimize.
[2024-05-29 18:19:29] [INFO ] Deduced a trap composed of 175 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:19:29] [INFO ] Deduced a trap composed of 182 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:19:30] [INFO ] Deduced a trap composed of 288 places in 111 ms of which 3 ms to minimize.
[2024-05-29 18:19:30] [INFO ] Deduced a trap composed of 177 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:19:30] [INFO ] Deduced a trap composed of 177 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:19:30] [INFO ] Deduced a trap composed of 174 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:19:30] [INFO ] Deduced a trap composed of 175 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:19:31] [INFO ] Deduced a trap composed of 175 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:19:32] [INFO ] Deduced a trap composed of 230 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:19:32] [INFO ] Deduced a trap composed of 179 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:19:33] [INFO ] Deduced a trap composed of 180 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:19:33] [INFO ] Deduced a trap composed of 178 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 175 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 176 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:19:38] [INFO ] Deduced a trap composed of 180 places in 105 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-05-29 18:19:44] [INFO ] Deduced a trap composed of 179 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:19:44] [INFO ] Deduced a trap composed of 176 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:19:44] [INFO ] Deduced a trap composed of 180 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-05-29 18:19:47] [INFO ] Deduced a trap composed of 182 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 475 unsolved
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 30159ms
Starting structural reductions in LTL mode, iteration 1 : 385/427 places, 476/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30840 ms. Remains : 385/427 places, 476/518 transitions.
Support contains 100 out of 385 places after structural reductions.
[2024-05-29 18:19:53] [INFO ] Flatten gal took : 52 ms
[2024-05-29 18:19:53] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:19:53] [INFO ] Input system was already deterministic with 476 transitions.
Support contains 93 out of 385 places (down from 100) after GAL structural reductions.
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (681 resets) in 1852 ms. (21 steps per ms) remains 15/49 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (14 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 88 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
[2024-05-29 18:19:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 342/385 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-29 18:19:54] [INFO ] Deduced a trap composed of 179 places in 113 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-29 18:19:54] [INFO ] Deduced a trap composed of 182 places in 105 ms of which 3 ms to minimize.
[2024-05-29 18:19:55] [INFO ] Deduced a trap composed of 175 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 476/861 variables, 385/392 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-29 18:19:55] [INFO ] Deduced a trap composed of 175 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/861 variables, 1/393 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 0/393 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/861 variables, 0/393 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 393 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 348/385 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 4/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
[2024-05-29 18:19:56] [INFO ] Deduced a trap composed of 180 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:19:56] [INFO ] Deduced a trap composed of 179 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:19:56] [INFO ] Deduced a trap composed of 176 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:19:56] [INFO ] Deduced a trap composed of 216 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 476/861 variables, 385/397 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 11/408 constraints. Problems are: Problem set: 4 solved, 11 unsolved
[2024-05-29 18:19:56] [INFO ] Deduced a trap composed of 175 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/861 variables, 1/409 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 0/409 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/861 variables, 0/409 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 409 constraints, problems are : Problem set: 4 solved, 11 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 11/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 3152ms problems are : Problem set: 4 solved, 11 unsolved
Finished Parikh walk after 6409 steps, including 100 resets, run visited all 1 properties in 14 ms. (steps per millisecond=457 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 1579 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:19:59] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:19:59] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:19:59] [INFO ] Input system was already deterministic with 476 transitions.
Computed a total of 49 stabilizing places and 52 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 359 transition count 450
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 359 transition count 450
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 68 place count 343 transition count 434
Iterating global reduction 0 with 16 rules applied. Total rules applied 84 place count 343 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 341 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 341 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 340 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 340 transition count 431
Applied a total of 90 rules in 34 ms. Remains 340 /385 variables (removed 45) and now considering 431/476 (removed 45) transitions.
// Phase 1: matrix 431 rows 340 cols
[2024-05-29 18:19:59] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 18:19:59] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:19:59] [INFO ] Invariant cache hit.
[2024-05-29 18:19:59] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-29 18:19:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:20:05] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:20:05] [INFO ] Deduced a trap composed of 167 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:20:05] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:20:06] [INFO ] Deduced a trap composed of 168 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:20:06] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:20:06] [INFO ] Deduced a trap composed of 164 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:20:06] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:20:07] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 3 ms to minimize.
[2024-05-29 18:20:07] [INFO ] Deduced a trap composed of 175 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:20:07] [INFO ] Deduced a trap composed of 190 places in 90 ms of which 3 ms to minimize.
[2024-05-29 18:20:07] [INFO ] Deduced a trap composed of 168 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:20:08] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:20:09] [INFO ] Deduced a trap composed of 168 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:20:09] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 431/771 variables, 340/358 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:20:18] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:20:18] [INFO ] Deduced a trap composed of 162 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:20:18] [INFO ] Deduced a trap composed of 166 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:20:20] [INFO ] Deduced a trap composed of 167 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:20:21] [INFO ] Deduced a trap composed of 167 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/771 variables, and 363 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:20:33] [INFO ] Deduced a trap composed of 166 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 168 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 431/771 variables, 340/365 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 430/795 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 795 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 21/21 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 340/385 places, 431/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60411 ms. Remains : 340/385 places, 431/476 transitions.
[2024-05-29 18:20:59] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:20:59] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:20:59] [INFO ] Input system was already deterministic with 431 transitions.
[2024-05-29 18:20:59] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:20:59] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:20:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality16885622858519756583.gal : 22 ms
[2024-05-29 18:20:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5778272114063623336.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16885622858519756583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5778272114063623336.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,1.06999e+07,1.42675,53284,2,5918,5,164897,6,0,1793,243916,0


Converting to forward existential form...Done !
original formula: EG(((EX((AG((((p115==0)||(p254==1))||(p342==1))) + (p413!=0))) * EF(((p300==0)||(p137==1)))) * ((p37==0)||(p375==1))))
=> equivalent forward existential formula: [FwdG(Init,((EX((!(E(TRUE U !((((p115==0)||(p254==1))||(p342==1))))) + (p413!=0))) * E(TRUE U ((p300==0)||(p137=...197
Reverse transition relation is NOT exact ! Due to transitions t52, t63, t98, t99, t132, t133, t134, t135, t152, t161, t195, t196, t197, t230, t231, t233, t...326
Detected timeout of ITS tools.
[2024-05-29 18:21:30] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:21:30] [INFO ] Applying decomposition
[2024-05-29 18:21:30] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14354356819779269372.txt' '-o' '/tmp/graph14354356819779269372.bin' '-w' '/tmp/graph14354356819779269372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14354356819779269372.bin' '-l' '-1' '-v' '-w' '/tmp/graph14354356819779269372.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:21:30] [INFO ] Decomposing Gal with order
[2024-05-29 18:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:21:30] [INFO ] Removed a total of 315 redundant transitions.
[2024-05-29 18:21:30] [INFO ] Flatten gal took : 119 ms
[2024-05-29 18:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 22 ms.
[2024-05-29 18:21:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality3999627581158180210.gal : 22 ms
[2024-05-29 18:21:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1956653558587233171.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/CTLCardinality3999627581158180210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1956653558587233171.ctl'

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 -...262
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,1.06999e+07,0.11846,7792,637,18,7260,493,655,7961,59,1091,0


Converting to forward existential form...Done !
original formula: EG(((EX((AG((((i6.u36.p115==0)||(i13.i0.u75.p254==1))||(i20.i0.u98.p342==1))) + (i24.i0.u122.p413!=0))) * EF(((i17.i0.u86.p300==0)||(i7.u...216
=> equivalent forward existential formula: [FwdG(Init,((EX((!(E(TRUE U !((((i6.u36.p115==0)||(i13.i0.u75.p254==1))||(i20.i0.u98.p342==1))))) + (i24.i0.u122...277
Reverse transition relation is NOT exact ! Due to transitions t52, t132, t135, t152, t197, t230, t231, t233, t249, t294, t307, t328, t329, t331, t348, t349...393
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,0.648589,34720,1,0,60105,493,4913,88928,291,1091,277712
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 361 transition count 452
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 361 transition count 452
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 346 transition count 437
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 346 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 343 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 343 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 341 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 341 transition count 432
Applied a total of 88 rules in 22 ms. Remains 341 /385 variables (removed 44) and now considering 432/476 (removed 44) transitions.
// Phase 1: matrix 432 rows 341 cols
[2024-05-29 18:21:31] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 18:21:31] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 18:21:31] [INFO ] Invariant cache hit.
[2024-05-29 18:21:31] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-29 18:21:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-29 18:21:37] [INFO ] Deduced a trap composed of 165 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:21:37] [INFO ] Deduced a trap composed of 167 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:21:37] [INFO ] Deduced a trap composed of 166 places in 77 ms of which 4 ms to minimize.
[2024-05-29 18:21:38] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:21:38] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:21:38] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:21:39] [INFO ] Deduced a trap composed of 167 places in 90 ms of which 3 ms to minimize.
[2024-05-29 18:21:39] [INFO ] Deduced a trap composed of 221 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:21:39] [INFO ] Deduced a trap composed of 165 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:21:39] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:21:39] [INFO ] Deduced a trap composed of 165 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-29 18:21:42] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 432/773 variables, 341/357 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 217 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 358 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-29 18:22:05] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:22:05] [INFO ] Deduced a trap composed of 165 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:22:06] [INFO ] Deduced a trap composed of 166 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-29 18:22:09] [INFO ] Deduced a trap composed of 167 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:22:09] [INFO ] Deduced a trap composed of 169 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (OVERLAPS) 432/773 variables, 341/363 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 431/794 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-29 18:22:16] [INFO ] Deduced a trap composed of 164 places in 77 ms of which 3 ms to minimize.
[2024-05-29 18:22:19] [INFO ] Deduced a trap composed of 166 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 796 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 20/20 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 341/385 places, 432/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 341/385 places, 432/476 transitions.
[2024-05-29 18:22:31] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:22:31] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:22:31] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-29 18:22:31] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:22:31] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:22:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15791497550306223241.gal : 3 ms
[2024-05-29 18:22:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality11778098928907393958.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/CTLCardinality15791497550306223241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11778098928907393958.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,1.07953e+07,1.46597,53792,2,6635,5,168128,6,0,1798,248937,0


Converting to forward existential form...Done !
original formula: (EF(EX(!(E(AX((p143==1)) U EX(TRUE))))) * EX(((!(A(E(((p339==0)||(p384==1)) U (p342==1)) U (p49==1))) * (p37==0)) + (AG(((p295==0)&&(p244...177
=> equivalent forward existential formula: (([((FwdU((EY((Init * E(TRUE U EX(!(E(!(EX(!((p143==1)))) U EX(TRUE))))))) * (p37==0)),!((p49==1))) * !((p49==1)...455
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t96, t97, t98, t131, t132, t134, t151, t160, t194, t196, t197, t231, t233, t249, t2...325
Detected timeout of ITS tools.
[2024-05-29 18:23:01] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:23:01] [INFO ] Applying decomposition
[2024-05-29 18:23:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4467451277608994633.txt' '-o' '/tmp/graph4467451277608994633.bin' '-w' '/tmp/graph4467451277608994633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4467451277608994633.bin' '-l' '-1' '-v' '-w' '/tmp/graph4467451277608994633.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:23:01] [INFO ] Decomposing Gal with order
[2024-05-29 18:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:23:02] [INFO ] Removed a total of 332 redundant transitions.
[2024-05-29 18:23:02] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-29 18:23:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality738611694481968900.gal : 4 ms
[2024-05-29 18:23:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10411241991076963057.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/CTLCardinality738611694481968900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10411241991076963057.ctl'

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 -...262
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,1.07953e+07,0.108677,7920,648,20,7284,469,608,8608,60,1012,0


Converting to forward existential form...Done !
original formula: (EF(EX(!(E(AX((i7.u46.p143==1)) U EX(TRUE))))) * EX(((!(A(E(((i16.u100.p339==0)||(i19.u116.p384==1)) U (i17.u102.p342==1)) U (i2.i1.i0.u1...262
=> equivalent forward existential formula: (([((FwdU((EY((Init * E(TRUE U EX(!(E(!(EX(!((i7.u46.p143==1)))) U EX(TRUE))))))) * (i2.i0.i0.u11.p37==0)),!((i2...593
Reverse transition relation is NOT exact ! Due to transitions t51, t97, t98, t131, t134, t196, t197, t231, t233, t294, t331, t333, t350, t351, t353, i0.t33...402
(forward)formula 0,1,0.955893,49368,1,0,92177,469,5331,144200,286,1012,341821
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 17 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:23:03] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 18:23:03] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:23:03] [INFO ] Invariant cache hit.
[2024-05-29 18:23:03] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:23:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:08] [INFO ] Deduced a trap composed of 164 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:23:08] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:23:08] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:23:09] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:23:10] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:23:10] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:23:10] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:23:10] [INFO ] Deduced a trap composed of 200 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:23:10] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:23:10] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:12] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:23:12] [INFO ] Deduced a trap composed of 163 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:23:12] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:18] [INFO ] Deduced a trap composed of 163 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:23:18] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:20] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:31] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:23:31] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:37] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 162 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 335/385 places, 426/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60366 ms. Remains : 335/385 places, 426/476 transitions.
[2024-05-29 18:24:03] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:24:03] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:24:03] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-29 18:24:03] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:24:03] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:24:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1951481940555683559.gal : 3 ms
[2024-05-29 18:24:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17864925103346632937.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/CTLCardinality1951481940555683559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17864925103346632937.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,1.04368e+07,1.45009,52712,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((p131==0)&&(p395==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((p131==0)&&(p395==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
(forward)formula 0,1,8.70919,270952,1,0,565,851970,873,400,10850,790463,864
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 359 transition count 450
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 359 transition count 450
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 345 transition count 436
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 345 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 343 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 343 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 342 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 342 transition count 433
Applied a total of 86 rules in 27 ms. Remains 342 /385 variables (removed 43) and now considering 433/476 (removed 43) transitions.
// Phase 1: matrix 433 rows 342 cols
[2024-05-29 18:24:12] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 18:24:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 18:24:12] [INFO ] Invariant cache hit.
[2024-05-29 18:24:12] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-05-29 18:24:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/342 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-29 18:24:17] [INFO ] Deduced a trap composed of 164 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:24:18] [INFO ] Deduced a trap composed of 170 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:24:18] [INFO ] Deduced a trap composed of 167 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:18] [INFO ] Deduced a trap composed of 167 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 168 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 168 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 167 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 164 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 163 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:24:20] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:24:20] [INFO ] Deduced a trap composed of 167 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:24:20] [INFO ] Deduced a trap composed of 162 places in 79 ms of which 4 ms to minimize.
[2024-05-29 18:24:20] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-29 18:24:21] [INFO ] Deduced a trap composed of 168 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:24:21] [INFO ] Deduced a trap composed of 167 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:24:21] [INFO ] Deduced a trap composed of 167 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:24:21] [INFO ] Deduced a trap composed of 167 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:24:22] [INFO ] Deduced a trap composed of 169 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:24:23] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 433/775 variables, 342/365 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (OVERLAPS) 0/775 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 432 unsolved
No progress, stopping.
After SMT solving in domain Real declared 775/775 variables, and 365 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/342 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/775 variables, 342/365 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 432/797 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-29 18:24:53] [INFO ] Deduced a trap composed of 168 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/775 variables, and 798 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 20/20 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 342/385 places, 433/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60374 ms. Remains : 342/385 places, 433/476 transitions.
[2024-05-29 18:25:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:25:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:25:12] [INFO ] Input system was already deterministic with 433 transitions.
[2024-05-29 18:25:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:25:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:25:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4881413276109365615.gal : 2 ms
[2024-05-29 18:25:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5101632654563154100.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/CTLCardinality4881413276109365615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5101632654563154100.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,1.08407e+07,1.50347,54868,2,5773,5,167122,6,0,1803,253522,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(AF(((p9==0)||(p47==1)))) * (EX(EX((p125==1))) + (A((p88==1) U ((p13==0)||(p55==1))) * EX((p19==0)))))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(!(EG(!(((p9==0)||(p47==1)))))))) * (EX(EX((p125==1))) + (!((E(!(((p13==0)||(p55==1))) U (!...255
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...313
Detected timeout of ITS tools.
[2024-05-29 18:25:42] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:25:42] [INFO ] Applying decomposition
[2024-05-29 18:25:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6586810701340222435.txt' '-o' '/tmp/graph6586810701340222435.bin' '-w' '/tmp/graph6586810701340222435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6586810701340222435.bin' '-l' '-1' '-v' '-w' '/tmp/graph6586810701340222435.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:25:42] [INFO ] Decomposing Gal with order
[2024-05-29 18:25:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:25:42] [INFO ] Removed a total of 340 redundant transitions.
[2024-05-29 18:25:42] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:25:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-29 18:25:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality4969568291148765074.gal : 3 ms
[2024-05-29 18:25:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17456869992276522000.ctl : 4 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/CTLCardinality4969568291148765074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17456869992276522000.ctl'

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 -...263
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,1.08407e+07,0.097518,7632,717,18,6264,409,692,8067,57,922,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(AF(((i0.i0.u3.p9==0)||(i3.i1.u19.p47==1)))) * (EX(EX((i2.i1.u42.p125==1))) + (A((i2.i0.u33.p88==1) U ((i0.i0.u5.p13==0)||(i4.u2...195
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(!(EG(!(((i0.i0.u3.p9==0)||(i3.i1.u19.p47==1)))))))) * (EX(EX((i2.i1.u42.p125==1))) + (!((E...351
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t129, t130, t132, t194, t227, t228, t230, t294, t295, t331, t333, t350, t351, t353,...388
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,4.03675,160488,1,0,312357,409,5032,454607,256,1021,840085
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 358 transition count 449
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 358 transition count 449
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 341 transition count 432
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 336 transition count 427
Applied a total of 98 rules in 21 ms. Remains 336 /385 variables (removed 49) and now considering 427/476 (removed 49) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-29 18:25:46] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 18:25:47] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 18:25:47] [INFO ] Invariant cache hit.
[2024-05-29 18:25:47] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-29 18:25:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:25:52] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-05-29 18:25:52] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:25:52] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:25:53] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 2 ms to minimize.
[2024-05-29 18:25:53] [INFO ] Deduced a trap composed of 163 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:25:53] [INFO ] Deduced a trap composed of 162 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 164 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 164 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 1 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 163 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:25:57] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:25:57] [INFO ] Deduced a trap composed of 164 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 165 places in 95 ms of which 5 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 163 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:26:02] [INFO ] Deduced a trap composed of 165 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 427/763 variables, 336/359 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 359 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/763 variables, 336/359 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 426/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (OVERLAPS) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 785 constraints, problems are : Problem set: 0 solved, 426 unsolved in 28549 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 19/19 constraints]
After SMT, in 58618ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 58623ms
Starting structural reductions in LTL mode, iteration 1 : 336/385 places, 427/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58921 ms. Remains : 336/385 places, 427/476 transitions.
[2024-05-29 18:26:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:45] [INFO ] Input system was already deterministic with 427 transitions.
[2024-05-29 18:26:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality108404508902880962.gal : 2 ms
[2024-05-29 18:26:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13426481964289200964.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/CTLCardinality108404508902880962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13426481964289200964.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,1.04791e+07,1.48365,51804,2,6734,5,162606,6,0,1773,236577,0


Converting to forward existential form...Done !
original formula: EF(AG(AX(((p397==0)||(p143==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((p397==0)||(p143==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t194, t195, t229, t231, t247, t2...313
(forward)formula 0,1,9.20149,278616,1,0,566,865054,876,402,10849,814231,868
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 25 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:26:55] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 18:26:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 18:26:55] [INFO ] Invariant cache hit.
[2024-05-29 18:26:55] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:00] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 3 ms to minimize.
[2024-05-29 18:27:00] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:27:00] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:27:01] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 200 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 165 places in 101 ms of which 2 ms to minimize.
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:04] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:27:04] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:27:04] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:10] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:27:10] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:12] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:23] [INFO ] Deduced a trap composed of 165 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:27:23] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:30] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:27:36] [INFO ] Deduced a trap composed of 162 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 335/385 places, 426/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60370 ms. Remains : 335/385 places, 426/476 transitions.
[2024-05-29 18:27:55] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:27:55] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:27:55] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-29 18:27:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:27:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:27:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6701626860423576325.gal : 2 ms
[2024-05-29 18:27:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9383422914469686921.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/CTLCardinality6701626860423576325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9383422914469686921.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,1.04368e+07,1.46694,52524,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: EX(A((p421==0) U ((p77==0)||(p309==1))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((p77==0)||(p309==1)))))) * !(E(!(((p77==0)||(p309==1))) U (!((p421==0)) * !(((p77==0)||(p3...177
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
(forward)formula 0,1,25.6639,770872,1,0,957,4.69676e+06,879,540,10542,3.22749e+06,1412
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 16 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
[2024-05-29 18:28:21] [INFO ] Invariant cache hit.
[2024-05-29 18:28:21] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 18:28:21] [INFO ] Invariant cache hit.
[2024-05-29 18:28:21] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:28:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:28:26] [INFO ] Deduced a trap composed of 164 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:28:27] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:28:27] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:28:27] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:28:28] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:28:28] [INFO ] Deduced a trap composed of 165 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:28:29] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:28:29] [INFO ] Deduced a trap composed of 200 places in 167 ms of which 4 ms to minimize.
[2024-05-29 18:28:29] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 4 ms to minimize.
[2024-05-29 18:28:29] [INFO ] Deduced a trap composed of 163 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 165 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:28:37] [INFO ] Deduced a trap composed of 163 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:28:37] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:28:39] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:28:51] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:28:56] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:29:02] [INFO ] Deduced a trap composed of 162 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 335/385 places, 426/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60353 ms. Remains : 335/385 places, 426/476 transitions.
[2024-05-29 18:29:21] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:29:21] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:29:21] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-29 18:29:21] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:29:21] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:29:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality10322462181910961705.gal : 2 ms
[2024-05-29 18:29:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6553985376199619604.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/CTLCardinality10322462181910961705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6553985376199619604.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,1.04368e+07,1.42869,52464,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: AF(EX((EX(((p215==0)&&(p75==1))) + ((p171==0)&&(p365==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((EX(((p215==0)&&(p75==1))) + ((p171==0)&&(p365==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2024-05-29 18:29:51] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:29:51] [INFO ] Applying decomposition
[2024-05-29 18:29:51] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3624696403207885584.txt' '-o' '/tmp/graph3624696403207885584.bin' '-w' '/tmp/graph3624696403207885584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3624696403207885584.bin' '-l' '-1' '-v' '-w' '/tmp/graph3624696403207885584.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:29:51] [INFO ] Decomposing Gal with order
[2024-05-29 18:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:29:52] [INFO ] Removed a total of 335 redundant transitions.
[2024-05-29 18:29:52] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:29:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-29 18:29:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5255473539381925570.gal : 3 ms
[2024-05-29 18:29:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14962522583361489517.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/CTLCardinality5255473539381925570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14962522583361489517.ctl'

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 -...263
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,1.04368e+07,0.106404,7792,686,25,7066,568,693,8072,71,1160,0


Converting to forward existential form...Done !
original formula: AF(EX((EX(((i11.i1.u63.p215==0)&&(i4.i0.u23.p75==1))) + ((i9.i1.u50.p171==0)&&(i22.i1.u112.p365==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((EX(((i11.i1.u63.p215==0)&&(i4.i0.u23.p75==1))) + ((i9.i1.u50.p171==0)&&(i22.i1.u112.p365==1))))...166
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t129, t130, t132, t149, t194, t227, t228, t230, t290, t291, t325, t327, t344, t345,...387
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,1.57173,75640,1,0,157791,568,4143,202028,279,1232,470945
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 360 transition count 451
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 360 transition count 451
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 66 place count 344 transition count 435
Iterating global reduction 0 with 16 rules applied. Total rules applied 82 place count 344 transition count 435
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 341 transition count 432
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 341 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 339 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 339 transition count 430
Applied a total of 92 rules in 16 ms. Remains 339 /385 variables (removed 46) and now considering 430/476 (removed 46) transitions.
// Phase 1: matrix 430 rows 339 cols
[2024-05-29 18:29:53] [INFO ] Computed 4 invariants in 8 ms
[2024-05-29 18:29:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 18:29:53] [INFO ] Invariant cache hit.
[2024-05-29 18:29:53] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2024-05-29 18:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:29:59] [INFO ] Deduced a trap composed of 165 places in 99 ms of which 3 ms to minimize.
[2024-05-29 18:29:59] [INFO ] Deduced a trap composed of 165 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:29:59] [INFO ] Deduced a trap composed of 167 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:29:59] [INFO ] Deduced a trap composed of 164 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:30:00] [INFO ] Deduced a trap composed of 166 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:30:00] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:30:00] [INFO ] Deduced a trap composed of 166 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:30:01] [INFO ] Deduced a trap composed of 166 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:30:01] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:30:01] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:30:01] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:30:01] [INFO ] Deduced a trap composed of 167 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:30:02] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:30:03] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 430/769 variables, 339/357 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:30:15] [INFO ] Deduced a trap composed of 165 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 358 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:30:27] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:30:28] [INFO ] Deduced a trap composed of 165 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 430/769 variables, 339/360 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 429/789 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-29 18:30:37] [INFO ] Deduced a trap composed of 168 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 790 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 18/18 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 339/385 places, 430/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60353 ms. Remains : 339/385 places, 430/476 transitions.
[2024-05-29 18:30:53] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:30:53] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:54] [INFO ] Input system was already deterministic with 430 transitions.
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality321868130963634910.gal : 2 ms
[2024-05-29 18:30:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality125726230523434344.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/CTLCardinality321868130963634910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality125726230523434344.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 -...281
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,1.06901e+07,1.39399,53004,2,6425,5,160336,6,0,1788,235697,0


Converting to forward existential form...Done !
original formula: AF((AX(E(!(((p164==0)&&(p296==1))) U AG(((p139==0)||(p231==1))))) * ((p250==0)||(p101==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(E(!(((p164==0)&&(p296==1))) U !(E(TRUE U !(((p139==0)||(p231==1))))))))) * ((p250==0)||(p10...173
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t166, t194, t195, t196, t230, t231, t2...325
Detected timeout of ITS tools.
[2024-05-29 18:31:24] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:31:24] [INFO ] Applying decomposition
[2024-05-29 18:31:24] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8422995384587190626.txt' '-o' '/tmp/graph8422995384587190626.bin' '-w' '/tmp/graph8422995384587190626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8422995384587190626.bin' '-l' '-1' '-v' '-w' '/tmp/graph8422995384587190626.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:31:24] [INFO ] Decomposing Gal with order
[2024-05-29 18:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:31:24] [INFO ] Removed a total of 342 redundant transitions.
[2024-05-29 18:31:24] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-29 18:31:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1228999969498595187.gal : 3 ms
[2024-05-29 18:31:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality5699358268021211693.ctl : 7 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/CTLCardinality1228999969498595187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5699358268021211693.ctl'

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 -...262
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,1.06901e+07,0.104129,7436,776,20,6585,402,621,8379,67,847,0


Converting to forward existential form...Done !
original formula: AF((AX(E(!(((i8.u51.p164==0)&&(i16.u88.p296==1))) U AG(((i7.u43.p139==0)||(i11.i1.i1.u73.p231==1))))) * ((i12.u78.p250==0)||(i6.u33.p101=...161
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(E(!(((i8.u51.p164==0)&&(i16.u88.p296==1))) U !(E(TRUE U !(((i7.u43.p139==0)||(i11.i1.i1.u73...224
Reverse transition relation is NOT exact ! Due to transitions t96, t130, t132, t196, t230, t231, t233, t295, t328, t329, t331, t348, t349, t351, i0.t258, i...425
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,1.07231,52052,1,0,92116,402,4986,145177,322,847,404220
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 383 edges and 385 vertex of which 56 / 385 are part of one of the 9 SCC in 5 ms
Free SCC test removed 47 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 337 transition count 190
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 104 transition count 184
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 477 place count 101 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 100 transition count 183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 478 place count 100 transition count 174
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 496 place count 91 transition count 174
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 508 place count 79 transition count 162
Iterating global reduction 4 with 12 rules applied. Total rules applied 520 place count 79 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 520 place count 79 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 78 transition count 161
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 526 place count 74 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 530 place count 74 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 534 place count 74 transition count 127
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 554 place count 64 transition count 117
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 561 place count 57 transition count 97
Iterating global reduction 5 with 7 rules applied. Total rules applied 568 place count 57 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 571 place count 57 transition count 94
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 573 place count 55 transition count 90
Iterating global reduction 6 with 2 rules applied. Total rules applied 575 place count 55 transition count 90
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 577 place count 53 transition count 88
Iterating global reduction 6 with 2 rules applied. Total rules applied 579 place count 53 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 583 place count 53 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 591 place count 49 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 592 place count 48 transition count 79
Applied a total of 592 rules in 61 ms. Remains 48 /385 variables (removed 337) and now considering 79/476 (removed 397) transitions.
[2024-05-29 18:31:25] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 48 cols
[2024-05-29 18:31:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:31:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 18:31:25] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-05-29 18:31:25] [INFO ] Invariant cache hit.
[2024-05-29 18:31:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:31:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 18:31:25] [INFO ] Redundant transitions in 4 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 18:31:25] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-05-29 18:31:25] [INFO ] Invariant cache hit.
[2024-05-29 18:31:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 4/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:31:25] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:31:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/121 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:31:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/122 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 68 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 4/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/121 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 72/139 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:31:27] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 12/12 constraints]
After SMT, in 3979ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3980ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/385 places, 79/476 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4136 ms. Remains : 48/385 places, 79/476 transitions.
[2024-05-29 18:31:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:31:29] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:31:29] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-29 18:31:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:31:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:31:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality703074087538516497.gal : 1 ms
[2024-05-29 18:31:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8166944009726651322.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/CTLCardinality703074087538516497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8166944009726651322.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,8628,0.033722,4724,2,844,5,4871,6,0,263,5752,0


Converting to forward existential form...Done !
original formula: AF(((EG((((p426==0)||(p64==1))&&(p252==0))) * (p63==1)) * ((p382==0)||(p423==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((EG((((p426==0)||(p64==1))&&(p252==0))) * (p63==1)) * ((p382==0)||(p423==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t7, t13, t15, t16, t22, t37, t38, t39, t47, t54, t55, t56, t57, t58, t59, t60, t66, t...257
(forward)formula 0,0,0.600855,27968,1,0,355,129100,180,180,1912,134526,376
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 358 transition count 449
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 358 transition count 449
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 70 place count 342 transition count 433
Iterating global reduction 0 with 16 rules applied. Total rules applied 86 place count 342 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 339 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 337 transition count 428
Applied a total of 96 rules in 48 ms. Remains 337 /385 variables (removed 48) and now considering 428/476 (removed 48) transitions.
// Phase 1: matrix 428 rows 337 cols
[2024-05-29 18:31:30] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 18:31:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 18:31:30] [INFO ] Invariant cache hit.
[2024-05-29 18:31:30] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-29 18:31:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:35] [INFO ] Deduced a trap composed of 162 places in 98 ms of which 3 ms to minimize.
[2024-05-29 18:31:35] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:31:35] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:31:35] [INFO ] Deduced a trap composed of 166 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:31:35] [INFO ] Deduced a trap composed of 162 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:31:36] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:31:36] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:31:36] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:31:37] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:31:37] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:31:37] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:31:37] [INFO ] Deduced a trap composed of 165 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:31:38] [INFO ] Deduced a trap composed of 165 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:38] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:31:39] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:31:39] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:31:40] [INFO ] Deduced a trap composed of 165 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:31:41] [INFO ] Deduced a trap composed of 166 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 165 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/765 variables, and 360 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:32:04] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/361 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 427/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 788 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 20/20 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 337/385 places, 428/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 337/385 places, 428/476 transitions.
[2024-05-29 18:32:30] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:32:30] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:32:30] [INFO ] Input system was already deterministic with 428 transitions.
[2024-05-29 18:32:30] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:32:30] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:32:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality158391264602700242.gal : 2 ms
[2024-05-29 18:32:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10014709938362722607.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/CTLCardinality158391264602700242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10014709938362722607.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,1.05662e+07,1.49466,52724,2,6532,5,161452,6,0,1778,242125,0


Converting to forward existential form...Done !
original formula: (AX(EX((EG((p159==0)) * ((p288==0)||(p353==1))))) * EF(EX(((p318==0) + AX((p170==0))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((EG((p159==0)) * ((p288==0)||(p353==1))))))] = FALSE * [(Init * !(E(TRUE U EX(((p318==0) + !(...187
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t131, t132, t134, t151, t160, t194, t195, t196, t229, t230, t232, t2...319
Detected timeout of ITS tools.
[2024-05-29 18:33:00] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:33:00] [INFO ] Applying decomposition
[2024-05-29 18:33:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11475907508540365283.txt' '-o' '/tmp/graph11475907508540365283.bin' '-w' '/tmp/graph11475907508540365283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11475907508540365283.bin' '-l' '-1' '-v' '-w' '/tmp/graph11475907508540365283.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:33:00] [INFO ] Decomposing Gal with order
[2024-05-29 18:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:33:00] [INFO ] Removed a total of 322 redundant transitions.
[2024-05-29 18:33:00] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-29 18:33:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6402008254265027128.gal : 3 ms
[2024-05-29 18:33:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality7197200454844761571.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/CTLCardinality6402008254265027128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7197200454844761571.ctl'

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 -...262
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,1.05662e+07,0.094604,7276,626,20,5999,356,659,7200,61,818,0


Converting to forward existential form...Done !
original formula: (AX(EX((EG((i7.i1.u45.p159==0)) * ((i15.i0.u85.p288==0)||(i20.i1.u106.p353==1))))) * EF(EX(((i17.i1.u97.p318==0) + AX((i8.i2.u51.p170==0)...160
=> equivalent forward existential formula: ([(EY(Init) * !(EX((EG((i7.i1.u45.p159==0)) * ((i15.i0.u85.p288==0)||(i20.i1.u106.p353==1))))))] = FALSE * [(Ini...241
Reverse transition relation is NOT exact ! Due to transitions t51, t95, t96, t132, t134, t151, t196, t229, t230, t232, t293, t326, t327, t329, t346, t347, ...399
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,1,2.20352,94660,1,0,188147,458,4843,277871,280,1010,467587
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 36 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:33:02] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 18:33:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 18:33:02] [INFO ] Invariant cache hit.
[2024-05-29 18:33:03] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:33:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:08] [INFO ] Deduced a trap composed of 164 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:33:08] [INFO ] Deduced a trap composed of 163 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:33:08] [INFO ] Deduced a trap composed of 164 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:33:09] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 165 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 200 places in 83 ms of which 4 ms to minimize.
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 1 ms to minimize.
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:12] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:33:12] [INFO ] Deduced a trap composed of 163 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:33:12] [INFO ] Deduced a trap composed of 165 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:17] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:33:18] [INFO ] Deduced a trap composed of 163 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:31] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:33:31] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:37] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:33:44] [INFO ] Deduced a trap composed of 162 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 335/385 places, 426/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60352 ms. Remains : 335/385 places, 426/476 transitions.
[2024-05-29 18:34:03] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:34:03] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:34:03] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-29 18:34:03] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:34:03] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:34:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1839277061004863447.gal : 2 ms
[2024-05-29 18:34:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality332940718818559667.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/CTLCardinality1839277061004863447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality332940718818559667.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,1.04368e+07,1.56186,52716,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: AX(A(!(((p386==1)&&(!((p90==0)||(p173==1))))) U !(((p26==0)||(p250==1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!(!(((p26==0)||(p250==1))))) * (!(!(((p386==1)&&(!((p90==0)||(p173==1)))))) * !(!(((p26==0)||(p...232
Hit Full ! (commute/partial/dont) 414/0/12
(forward)formula 0,0,18.5383,572208,1,0,96,2.89915e+06,19,4,8611,2.72444e+06,92
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 389 edges and 385 vertex of which 56 / 385 are part of one of the 8 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 336 transition count 186
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 241 rules applied. Total rules applied 477 place count 101 transition count 180
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 481 place count 98 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 482 place count 97 transition count 179
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 482 place count 97 transition count 169
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 502 place count 87 transition count 169
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 515 place count 74 transition count 156
Iterating global reduction 4 with 13 rules applied. Total rules applied 528 place count 74 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 528 place count 74 transition count 154
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 532 place count 72 transition count 154
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 537 place count 67 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 542 place count 67 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 545 place count 67 transition count 120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 563 place count 58 transition count 111
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 571 place count 50 transition count 89
Iterating global reduction 5 with 8 rules applied. Total rules applied 579 place count 50 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 582 place count 50 transition count 86
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 585 place count 47 transition count 80
Iterating global reduction 6 with 3 rules applied. Total rules applied 588 place count 47 transition count 80
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 591 place count 44 transition count 77
Iterating global reduction 6 with 3 rules applied. Total rules applied 594 place count 44 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 597 place count 44 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 603 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 604 place count 40 transition count 70
Applied a total of 604 rules in 41 ms. Remains 40 /385 variables (removed 345) and now considering 70/476 (removed 406) transitions.
[2024-05-29 18:34:22] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2024-05-29 18:34:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:34:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:34:22] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-29 18:34:22] [INFO ] Invariant cache hit.
[2024-05-29 18:34:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:34:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-29 18:34:22] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-29 18:34:22] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-29 18:34:22] [INFO ] Invariant cache hit.
[2024-05-29 18:34:22] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 65/105 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:34:22] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 57 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 65/105 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 63/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-29 18:34:23] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:34:23] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 122 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 9/9 constraints]
After SMT, in 2652ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2653ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/385 places, 70/476 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2764 ms. Remains : 40/385 places, 70/476 transitions.
[2024-05-29 18:34:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:34:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:34:24] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-29 18:34:24] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:34:24] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:34:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10537797921159787223.gal : 1 ms
[2024-05-29 18:34:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4474105364565060324.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/CTLCardinality10537797921159787223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4474105364565060324.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,3082,0.028586,4480,2,591,5,3413,6,0,224,3590,0


Converting to forward existential form...Done !
original formula: EG(((p101==0)||(p310==1)))
=> equivalent forward existential formula: [FwdG(Init,((p101==0)||(p310==1)))] != FALSE
Hit Full ! (commute/partial/dont) 66/0/4
(forward)formula 0,1,0.118766,8704,1,0,19,21899,19,4,1233,22524,18
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 386 edges and 385 vertex of which 48 / 385 are part of one of the 8 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 344 transition count 191
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 248 rules applied. Total rules applied 489 place count 104 transition count 183
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 495 place count 100 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 497 place count 98 transition count 181
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 497 place count 98 transition count 171
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 517 place count 88 transition count 171
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 530 place count 75 transition count 158
Iterating global reduction 4 with 13 rules applied. Total rules applied 543 place count 75 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 543 place count 75 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 547 place count 73 transition count 156
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 552 place count 68 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 557 place count 68 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 561 place count 68 transition count 121
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 579 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 584 place count 54 transition count 95
Iterating global reduction 5 with 5 rules applied. Total rules applied 589 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 592 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 593 place count 53 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 594 place count 53 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 595 place count 52 transition count 89
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 52 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 600 place count 52 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 608 place count 48 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 609 place count 47 transition count 80
Applied a total of 609 rules in 46 ms. Remains 47 /385 variables (removed 338) and now considering 80/476 (removed 396) transitions.
[2024-05-29 18:34:24] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
// Phase 1: matrix 75 rows 47 cols
[2024-05-29 18:34:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:34:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 18:34:24] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2024-05-29 18:34:24] [INFO ] Invariant cache hit.
[2024-05-29 18:34:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:34:25] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 18:34:25] [INFO ] Redundant transitions in 3 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-29 18:34:25] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2024-05-29 18:34:25] [INFO ] Invariant cache hit.
[2024-05-29 18:34:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:34:25] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 74/121 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-29 18:34:26] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-29 18:34:26] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/122 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 70 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 73/142 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-29 18:34:28] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 144 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1860 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 15/15 constraints]
After SMT, in 4148ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 4150ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/385 places, 80/476 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4288 ms. Remains : 47/385 places, 80/476 transitions.
[2024-05-29 18:34:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:34:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:34:29] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-29 18:34:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:34:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:34:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality5437844160079367776.gal : 0 ms
[2024-05-29 18:34:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12714819169667402930.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/CTLCardinality5437844160079367776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12714819169667402930.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,3770,0.041302,4996,2,906,5,5397,6,0,261,6080,0


Converting to forward existential form...Done !
original formula: AF((EF(EG((p67==0))) + ((p149==0)&&(p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG((p67==0))) + ((p149==0)&&(p105==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t8, t13, t14, t32, t37, t38, t52, t54, t55, t56, t57, t58, t59, t60, t66, t68, t7...256
(forward)formula 0,1,0.593827,28420,1,0,280,134710,186,128,1931,125263,312
FORMULA StigmergyElection-PT-03b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 18:34:29] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:34:29] [INFO ] Flatten gal took : 8 ms
Total runtime 907542 ms.

BK_STOP 1717007669876

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-03b"
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-03b, 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-171690532000273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b 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 ;