Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is StigmergyElection-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 203K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2023-15
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-00
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-01
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-02
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-03
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-04
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-05
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-06
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-07
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-08
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-09
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-10
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749138083805

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 15:41:26] [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]
[2025-06-05 15:41:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:41:26] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2025-06-05 15:41:26] [INFO ] Transformed 563 places.
[2025-06-05 15:41:26] [INFO ] Transformed 780 transitions.
[2025-06-05 15:41:26] [INFO ] Found NUPN structural information;
[2025-06-05 15:41:26] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 506 transition count 723
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 506 transition count 723
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 134 place count 486 transition count 703
Iterating global reduction 0 with 20 rules applied. Total rules applied 154 place count 486 transition count 703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 485 transition count 702
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 485 transition count 702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 484 transition count 701
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 484 transition count 701
Applied a total of 158 rules in 295 ms. Remains 484 /563 variables (removed 79) and now considering 701/780 (removed 79) transitions.
// Phase 1: matrix 701 rows 484 cols
[2025-06-05 15:41:27] [INFO ] Computed 5 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:41:28] [INFO ] Implicit Places using invariants in 874 ms returned []
[2025-06-05 15:41:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:41:29] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-06-05 15:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1185 variables, and 5 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:22] [INFO ] Deduced a trap composed of 169 places in 610 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:23] [INFO ] Deduced a trap composed of 171 places in 613 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:23] [INFO ] Deduced a trap composed of 172 places in 497 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:24] [INFO ] Deduced a trap composed of 173 places in 362 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:25] [INFO ] Deduced a trap composed of 361 places in 465 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:26] [INFO ] Deduced a trap composed of 171 places in 547 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:27] [INFO ] Deduced a trap composed of 172 places in 755 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:28] [INFO ] Deduced a trap composed of 174 places in 563 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:30] [INFO ] Deduced a trap composed of 168 places in 596 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:30] [INFO ] Deduced a trap composed of 172 places in 567 ms of which 137 ms to minimize.
SMT process timed out in 61092ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 61132ms
Starting structural reductions in LTL mode, iteration 1 : 484/563 places, 701/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63798 ms. Remains : 484/563 places, 701/780 transitions.
Support contains 104 out of 484 places after structural reductions.
[2025-06-05 15:42:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 15:42:31] [INFO ] Flatten gal took : 183 ms
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 15:42:31] [INFO ] Flatten gal took : 100 ms
[2025-06-05 15:42:31] [INFO ] Input system was already deterministic with 701 transitions.
Support contains 78 out of 484 places (down from 104) after GAL structural reductions.
RANDOM walk for 40000 steps (542 resets) in 3239 ms. (12 steps per ms) remains 11/41 properties
BEST_FIRST walk for 40004 steps (108 resets) in 276 ms. (144 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (112 resets) in 346 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (111 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (109 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (107 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (107 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (111 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (110 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (109 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (106 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (114 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
[2025-06-05 15:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 465/484 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 701/1185 variables, 484/489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1185 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/1185 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1185/1185 variables, and 489 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 465/484 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:35] [INFO ] Deduced a trap composed of 169 places in 502 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:36] [INFO ] Deduced a trap composed of 173 places in 437 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:36] [INFO ] Deduced a trap composed of 171 places in 518 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:37] [INFO ] Deduced a trap composed of 174 places in 422 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:37] [INFO ] Deduced a trap composed of 174 places in 357 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:38] [INFO ] Deduced a trap composed of 168 places in 696 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:38] [INFO ] Deduced a trap composed of 169 places in 556 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:39] [INFO ] Deduced a trap composed of 169 places in 390 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:39] [INFO ] Deduced a trap composed of 171 places in 524 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:42:40] [INFO ] Deduced a trap composed of 173 places in 430 ms of which 70 ms to minimize.
SMT process timed out in 6820ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 701/701 transitions.
Graph (trivial) has 465 edges and 484 vertex of which 71 / 484 are part of one of the 11 SCC in 6 ms
Free SCC test removed 60 places
Drop transitions (Empty/Sink Transition effects.) removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 788 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 420 transition count 335
Reduce places removed 285 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 291 rules applied. Total rules applied 580 place count 135 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 590 place count 132 transition count 322
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 599 place count 125 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 600 place count 124 transition count 320
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 600 place count 124 transition count 306
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 628 place count 110 transition count 306
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 632 place count 106 transition count 302
Iterating global reduction 5 with 4 rules applied. Total rules applied 636 place count 106 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 636 place count 106 transition count 301
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 638 place count 105 transition count 301
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 639 place count 104 transition count 293
Iterating global reduction 5 with 1 rules applied. Total rules applied 640 place count 104 transition count 293
Performed 20 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 680 place count 84 transition count 268
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 681 place count 84 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 692 place count 73 transition count 134
Iterating global reduction 6 with 11 rules applied. Total rules applied 703 place count 73 transition count 134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 710 place count 73 transition count 127
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 722 place count 67 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 733 place count 67 transition count 129
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 753 place count 67 transition count 109
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 774 place count 47 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 775 place count 47 transition count 107
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 776 place count 47 transition count 107
Applied a total of 776 rules in 278 ms. Remains 47 /484 variables (removed 437) and now considering 107/701 (removed 594) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 47/484 places, 107/701 transitions.
RANDOM walk for 30307 steps (59 resets) in 376 ms. (80 steps per ms) remains 0/10 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-06-05 15:42:40] [INFO ] Flatten gal took : 80 ms
[2025-06-05 15:42:40] [INFO ] Flatten gal took : 72 ms
[2025-06-05 15:42:41] [INFO ] Input system was already deterministic with 701 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 459 transition count 676
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 459 transition count 676
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 450 transition count 667
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 450 transition count 667
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 446 transition count 663
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 445 transition count 662
Applied a total of 78 rules in 146 ms. Remains 445 /484 variables (removed 39) and now considering 662/701 (removed 39) transitions.
// Phase 1: matrix 662 rows 445 cols
[2025-06-05 15:42:41] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:42:41] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-06-05 15:42:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:42:42] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2025-06-05 15:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:43:12] [INFO ] Deduced a trap composed of 162 places in 552 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:43:12] [INFO ] Deduced a trap composed of 163 places in 389 ms of which 24 ms to minimize.
SMT process timed out in 30513ms, After SMT, problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 30519ms
Starting structural reductions in LTL mode, iteration 1 : 445/484 places, 662/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31699 ms. Remains : 445/484 places, 662/701 transitions.
[2025-06-05 15:43:12] [INFO ] Flatten gal took : 54 ms
[2025-06-05 15:43:12] [INFO ] Flatten gal took : 53 ms
[2025-06-05 15:43:13] [INFO ] Input system was already deterministic with 662 transitions.
[2025-06-05 15:43:13] [INFO ] Flatten gal took : 54 ms
[2025-06-05 15:43:13] [INFO ] Flatten gal took : 44 ms
[2025-06-05 15:43:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17760275564687778713.gal : 45 ms
[2025-06-05 15:43:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8923394386858419457.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17760275564687778713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8923394386858419457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.05838e+08,9.5647,194460,2,14819,5,576360,6,0,2444,836435,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:43:43] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:43:43] [INFO ] Applying decomposition
[2025-06-05 15:43:43] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2652534793672847952.txt' '-o' '/tmp/graph2652534793672847952.bin' '-w' '/tmp/graph2652534793672847952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2652534793672847952.bin' '-l' '-1' '-v' '-w' '/tmp/graph2652534793672847952.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:43:43] [INFO ] Decomposing Gal with order
[2025-06-05 15:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:43:44] [INFO ] Removed a total of 795 redundant transitions.
[2025-06-05 15:43:44] [INFO ] Flatten gal took : 230 ms
[2025-06-05 15:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 36 ms.
[2025-06-05 15:43:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4505961879021451786.gal : 20 ms
[2025-06-05 15:43:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3569706296609864460.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4505961879021451786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3569706296609864460.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,8.05838e+08,27.9753,647756,1421,13,1.00442e+06,842,1030,4.03573e+06,42,3233,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 458 transition count 675
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 458 transition count 675
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 448 transition count 665
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 448 transition count 665
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 443 transition count 660
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 443 transition count 660
Applied a total of 82 rules in 81 ms. Remains 443 /484 variables (removed 41) and now considering 660/701 (removed 41) transitions.
// Phase 1: matrix 660 rows 443 cols
[2025-06-05 15:44:14] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:44:15] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-06-05 15:44:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:44:15] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-05 15:44:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 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 443/1103 variables, and 5 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:06] [INFO ] Deduced a trap composed of 162 places in 608 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:06] [INFO ] Deduced a trap composed of 163 places in 388 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:07] [INFO ] Deduced a trap composed of 164 places in 405 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:08] [INFO ] Deduced a trap composed of 164 places in 319 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:08] [INFO ] Deduced a trap composed of 163 places in 257 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:09] [INFO ] Deduced a trap composed of 162 places in 602 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:10] [INFO ] Deduced a trap composed of 163 places in 425 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:10] [INFO ] Deduced a trap composed of 163 places in 424 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:11] [INFO ] Deduced a trap composed of 163 places in 446 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:12] [INFO ] Deduced a trap composed of 164 places in 496 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:12] [INFO ] Deduced a trap composed of 165 places in 463 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:14] [INFO ] Deduced a trap composed of 164 places in 465 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:14] [INFO ] Deduced a trap composed of 164 places in 523 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:15] [INFO ] Deduced a trap composed of 163 places in 532 ms of which 144 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1103 variables, and 19 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 0/659 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 443/484 places, 660/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61700 ms. Remains : 443/484 places, 660/701 transitions.
[2025-06-05 15:45:16] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:45:16] [INFO ] Flatten gal took : 32 ms
[2025-06-05 15:45:16] [INFO ] Input system was already deterministic with 660 transitions.
[2025-06-05 15:45:16] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:45:16] [INFO ] Flatten gal took : 32 ms
[2025-06-05 15:45:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5988450410052890537.gal : 9 ms
[2025-06-05 15:45:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality14293983521041507023.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5988450410052890537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14293983521041507023.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.99354e+08,9.82946,200128,2,14428,5,592370,6,0,2434,860242,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:45:46] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:45:46] [INFO ] Applying decomposition
[2025-06-05 15:45:46] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10229627687286378869.txt' '-o' '/tmp/graph10229627687286378869.bin' '-w' '/tmp/graph10229627687286378869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10229627687286378869.bin' '-l' '-1' '-v' '-w' '/tmp/graph10229627687286378869.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:45:46] [INFO ] Decomposing Gal with order
[2025-06-05 15:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:45:46] [INFO ] Removed a total of 796 redundant transitions.
[2025-06-05 15:45:46] [INFO ] Flatten gal took : 53 ms
[2025-06-05 15:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-05 15:45:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2447742410381046754.gal : 8 ms
[2025-06-05 15:45:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12659635112845212044.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2447742410381046754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12659635112845212044.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,7.99354e+08,5.88061,150160,1660,13,279139,929,907,711331,42,2844,0


Converting to forward existential form...Done !
original formula: EG(AX((EF((i16.u107.p318==0)) + (i13.u65.p194==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(TRUE U (i16.u107.p318==0)) + (i13.u65.p194==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t140, t157, t202, t236, t255, t335, t337, t353, t398, t432, t455, t457, t459...468
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 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 a local 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,29.4101,786500,1,0,979825,995,8498,6.70974e+06,226,4426,2227507
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Graph (trivial) has 481 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 2 ms
Free SCC test removed 51 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 298 place count 432 transition count 346
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 310 rules applied. Total rules applied 608 place count 135 transition count 333
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 12 rules applied. Total rules applied 620 place count 128 transition count 328
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 625 place count 123 transition count 328
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 625 place count 123 transition count 316
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 649 place count 111 transition count 316
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 656 place count 104 transition count 309
Iterating global reduction 4 with 7 rules applied. Total rules applied 663 place count 104 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 663 place count 104 transition count 308
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 665 place count 103 transition count 308
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 667 place count 101 transition count 299
Iterating global reduction 4 with 2 rules applied. Total rules applied 669 place count 101 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 670 place count 101 transition count 298
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 696 place count 88 transition count 285
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 709 place count 75 transition count 147
Iterating global reduction 5 with 13 rules applied. Total rules applied 722 place count 75 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 730 place count 75 transition count 139
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 733 place count 72 transition count 133
Iterating global reduction 6 with 3 rules applied. Total rules applied 736 place count 72 transition count 133
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 739 place count 69 transition count 130
Iterating global reduction 6 with 3 rules applied. Total rules applied 742 place count 69 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 747 place count 69 transition count 125
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 757 place count 64 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 758 place count 63 transition count 119
Applied a total of 758 rules in 97 ms. Remains 63 /484 variables (removed 421) and now considering 119/701 (removed 582) transitions.
[2025-06-05 15:46:16] [INFO ] Flow matrix only has 115 transitions (discarded 4 similar events)
// Phase 1: matrix 115 rows 63 cols
[2025-06-05 15:46:16] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 15:46:16] [INFO ] Flow matrix only has 115 transitions (discarded 4 similar events)
[2025-06-05 15:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:46:16] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:46:16] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-05 15:46:16] [INFO ] Flow matrix only has 115 transitions (discarded 4 similar events)
[2025-06-05 15:46:16] [INFO ] Invariant cache hit.
[2025-06-05 15:46:16] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:17] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:17] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:17] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:17] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:18] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:19] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:19] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:19] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:19] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:19] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 114/177 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 99 constraints, problems are : Problem set: 0 solved, 111 unsolved in 9473 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:27] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 114/177 variables, 63/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 111/210 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:32] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:32] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:46:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 216 constraints, problems are : Problem set: 0 solved, 111 unsolved in 14736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24244ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 24245ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/484 places, 119/701 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24546 ms. Remains : 63/484 places, 119/701 transitions.
[2025-06-05 15:46:41] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:46:41] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:46:41] [INFO ] Input system was already deterministic with 119 transitions.
[2025-06-05 15:46:41] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:46:41] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:46:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality18069722655861502872.gal : 1 ms
[2025-06-05 15:46:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality14716326769105039825.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18069722655861502872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14716326769105039825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,48972,0.220455,10008,2,2896,5,22249,6,0,364,20762,0


Converting to forward existential form...Done !
original formula: A((p246==0) U (!(E(((p117==0)||(p77==1)) U (EG(((p37==0)||(p282==1))) * ((p273==0)||(p343==1))))) + (p333==1)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(((p117==0)||(p77==1)) U (EG(((p37==0)||(p282==1))) * ((p273==0)||(p343==1))))) + (p333==1)...398
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t9, t10, t25, t33, t39, t49, t50, t52, t54, t55, t61, t62, t63, t70, t71, t75, t8...279
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,14.381,323340,1,0,722,2.01844e+06,269,406,3376,1.39638e+06,769
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 461 transition count 678
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 461 transition count 678
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 452 transition count 669
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 452 transition count 669
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 447 transition count 664
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 446 transition count 663
Applied a total of 76 rules in 69 ms. Remains 446 /484 variables (removed 38) and now considering 663/701 (removed 38) transitions.
// Phase 1: matrix 663 rows 446 cols
[2025-06-05 15:46:55] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:55] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-06-05 15:46:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:56] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 662 sub problems to find dead transitions.
[2025-06-05 15:46:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 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 0.0)
(s73 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1109 variables, and 5 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 662 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:48] [INFO ] Deduced a trap composed of 162 places in 584 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:49] [INFO ] Deduced a trap composed of 163 places in 364 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:50] [INFO ] Deduced a trap composed of 164 places in 415 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:51] [INFO ] Deduced a trap composed of 162 places in 590 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:52] [INFO ] Deduced a trap composed of 163 places in 427 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:52] [INFO ] Deduced a trap composed of 165 places in 514 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:53] [INFO ] Deduced a trap composed of 166 places in 306 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:54] [INFO ] Deduced a trap composed of 164 places in 369 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:55] [INFO ] Deduced a trap composed of 167 places in 443 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:55] [INFO ] Deduced a trap composed of 164 places in 338 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:56] [INFO ] Deduced a trap composed of 164 places in 551 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:57] [INFO ] Deduced a trap composed of 166 places in 389 ms of which 76 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1109 variables, and 17 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/662 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 446/484 places, 663/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61671 ms. Remains : 446/484 places, 663/701 transitions.
[2025-06-05 15:47:57] [INFO ] Flatten gal took : 30 ms
[2025-06-05 15:47:57] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:47:57] [INFO ] Input system was already deterministic with 663 transitions.
[2025-06-05 15:47:57] [INFO ] Flatten gal took : 36 ms
[2025-06-05 15:47:57] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:47:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality85725139729138766.gal : 7 ms
[2025-06-05 15:47:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8479754472461354983.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality85725139729138766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8479754472461354983.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,8.13373e+08,10.9929,208580,2,14885,5,616503,6,0,2449,905391,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:48:27] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:48:27] [INFO ] Applying decomposition
[2025-06-05 15:48:27] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6399645856911655816.txt' '-o' '/tmp/graph6399645856911655816.bin' '-w' '/tmp/graph6399645856911655816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6399645856911655816.bin' '-l' '-1' '-v' '-w' '/tmp/graph6399645856911655816.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:48:27] [INFO ] Decomposing Gal with order
[2025-06-05 15:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:48:27] [INFO ] Removed a total of 791 redundant transitions.
[2025-06-05 15:48:27] [INFO ] Flatten gal took : 59 ms
[2025-06-05 15:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-06-05 15:48:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality15379304958286693826.gal : 7 ms
[2025-06-05 15:48:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10935734389319358313.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15379304958286693826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10935734389319358313.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,8.13373e+08,6.65456,189488,1810,13,313807,749,910,1.07428e+06,45,2448,0


Converting to forward existential form...Done !
original formula: E(AF(AX((i3.u29.p92==1))) U EG(((!(EG((i18.u118.p349==1))) + A(!(EF(((i9.u32.p100==0)||(i6.u39.p126==1)))) U A(((i7.u51.p163==0)||(i12.i1...294
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(!(EX(!((i3.u29.p92==1)))))))),((!(EG((i18.u118.p349==1))) + !((E(!(!((E(!((i22.u140.p420=...714
Reverse transition relation is NOT exact ! Due to transitions t59, t138, t140, t157, t202, t236, t238, t255, t302, t336, t354, t433, t435, t456, t458, t460...485
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 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 a local 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
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 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 a local 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 460 transition count 677
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 460 transition count 677
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 451 transition count 668
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 451 transition count 668
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 446 transition count 663
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 445 transition count 662
Applied a total of 78 rules in 69 ms. Remains 445 /484 variables (removed 39) and now considering 662/701 (removed 39) transitions.
// Phase 1: matrix 662 rows 445 cols
[2025-06-05 15:48:58] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:58] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-05 15:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:59] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2025-06-05 15:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 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 445/1107 variables, and 5 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:49] [INFO ] Deduced a trap composed of 162 places in 459 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:50] [INFO ] Deduced a trap composed of 162 places in 331 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:50] [INFO ] Deduced a trap composed of 163 places in 383 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:51] [INFO ] Deduced a trap composed of 164 places in 345 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:52] [INFO ] Deduced a trap composed of 163 places in 342 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:52] [INFO ] Deduced a trap composed of 163 places in 400 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:53] [INFO ] Deduced a trap composed of 163 places in 413 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:53] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:54] [INFO ] Deduced a trap composed of 165 places in 310 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:55] [INFO ] Deduced a trap composed of 164 places in 532 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:55] [INFO ] Deduced a trap composed of 164 places in 454 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:55] [INFO ] Deduced a trap composed of 165 places in 401 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:56] [INFO ] Deduced a trap composed of 163 places in 338 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:57] [INFO ] Deduced a trap composed of 164 places in 418 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:57] [INFO ] Deduced a trap composed of 164 places in 327 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:58] [INFO ] Deduced a trap composed of 165 places in 409 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:58] [INFO ] Deduced a trap composed of 166 places in 329 ms of which 85 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1107 variables, and 22 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in LTL mode, iteration 1 : 445/484 places, 662/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61663 ms. Remains : 445/484 places, 662/701 transitions.
[2025-06-05 15:49:59] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:49:59] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:49:59] [INFO ] Input system was already deterministic with 662 transitions.
[2025-06-05 15:49:59] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:49:59] [INFO ] Flatten gal took : 18 ms
[2025-06-05 15:49:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8817539462865247870.gal : 4 ms
[2025-06-05 15:49:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7174143511022006464.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8817539462865247870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7174143511022006464.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.59672e+08,15.4736,261616,2,20226,5,762244,6,0,2444,1.18662e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:50:29] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:50:29] [INFO ] Applying decomposition
[2025-06-05 15:50:29] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17433457223408119052.txt' '-o' '/tmp/graph17433457223408119052.bin' '-w' '/tmp/graph17433457223408119052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17433457223408119052.bin' '-l' '-1' '-v' '-w' '/tmp/graph17433457223408119052.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:50:29] [INFO ] Decomposing Gal with order
[2025-06-05 15:50:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:50:30] [INFO ] Removed a total of 802 redundant transitions.
[2025-06-05 15:50:30] [INFO ] Flatten gal took : 79 ms
[2025-06-05 15:50:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-06-05 15:50:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality2307991750003811981.gal : 9 ms
[2025-06-05 15:50:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10446707851362265696.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2307991750003811981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10446707851362265696.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,8.59672e+08,7.52862,207292,1970,16,360971,872,933,1.08403e+06,44,2931,0


Converting to forward existential form...Done !
original formula: EG(((AF((((i7.u0.p0==0)||(i3.u99.p297==1))||((((i29.u184.p552==0)&&(i0.u7.p18==1))&&((i18.i1.i1.u114.p337==0)&&(i10.u59.p175==0)))&&(i7.u...315
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((((i7.u0.p0==0)||(i3.u99.p297==1))||((((i29.u184.p552==0)&&(i0.u7.p18==1))&&((i18.i1.i1.u114...370
Reverse transition relation is NOT exact ! Due to transitions t61, t106, t140, t159, t204, t238, t240, t257, t302, t336, t338, t354, t433, t435, t456, t458...544
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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 458 transition count 675
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 458 transition count 675
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 448 transition count 665
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 448 transition count 665
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 443 transition count 660
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 442 transition count 659
Applied a total of 84 rules in 42 ms. Remains 442 /484 variables (removed 42) and now considering 659/701 (removed 42) transitions.
// Phase 1: matrix 659 rows 442 cols
[2025-06-05 15:51:00] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-05 15:51:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:51:01] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 15:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 5 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:52] [INFO ] Deduced a trap composed of 162 places in 560 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:52] [INFO ] Deduced a trap composed of 162 places in 370 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:53] [INFO ] Deduced a trap composed of 163 places in 399 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:53] [INFO ] Deduced a trap composed of 164 places in 369 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:55] [INFO ] Deduced a trap composed of 163 places in 390 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:56] [INFO ] Deduced a trap composed of 163 places in 414 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:56] [INFO ] Deduced a trap composed of 163 places in 329 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:57] [INFO ] Deduced a trap composed of 164 places in 442 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:57] [INFO ] Deduced a trap composed of 164 places in 451 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:59] [INFO ] Deduced a trap composed of 163 places in 444 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:00] [INFO ] Deduced a trap composed of 162 places in 409 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:00] [INFO ] Deduced a trap composed of 164 places in 354 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:01] [INFO ] Deduced a trap composed of 165 places in 496 ms of which 126 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 18 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 442/484 places, 659/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61207 ms. Remains : 442/484 places, 659/701 transitions.
[2025-06-05 15:52:01] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:52:01] [INFO ] Flatten gal took : 27 ms
[2025-06-05 15:52:01] [INFO ] Input system was already deterministic with 659 transitions.
[2025-06-05 15:52:01] [INFO ] Flatten gal took : 41 ms
[2025-06-05 15:52:01] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:52:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2877702713426842311.gal : 6 ms
[2025-06-05 15:52:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11805355374051239663.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2877702713426842311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11805355374051239663.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96896e+08,10.491,210520,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
original formula: EX(EF(((p397==1)||((p286==0)&&(p388==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((p397==1)||((p286==0)&&(p388==1))))] != FALSE
(forward)formula 0,1,16.0765,214488,1,0,9,624578,9,1,5413,915926,4
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 459 transition count 676
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 459 transition count 676
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 450 transition count 667
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 450 transition count 667
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 446 transition count 663
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 445 transition count 662
Applied a total of 78 rules in 45 ms. Remains 445 /484 variables (removed 39) and now considering 662/701 (removed 39) transitions.
// Phase 1: matrix 662 rows 445 cols
[2025-06-05 15:52:17] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:18] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-06-05 15:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:18] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2025-06-05 15:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:43] [INFO ] Deduced a trap composed of 162 places in 540 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:43] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:44] [INFO ] Deduced a trap composed of 163 places in 281 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:44] [INFO ] Deduced a trap composed of 164 places in 383 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:45] [INFO ] Deduced a trap composed of 165 places in 304 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:46] [INFO ] Deduced a trap composed of 163 places in 526 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:47] [INFO ] Deduced a trap composed of 162 places in 419 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:47] [INFO ] Deduced a trap composed of 163 places in 435 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:48] [INFO ] Deduced a trap composed of 163 places in 495 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:48] [INFO ] Deduced a trap composed of 164 places in 486 ms of which 107 ms to minimize.
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 0.0)
(s73 1.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 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.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 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1107 variables, and 15 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:02] [INFO ] Deduced a trap composed of 164 places in 352 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:03] [INFO ] Deduced a trap composed of 164 places in 527 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:04] [INFO ] Deduced a trap composed of 165 places in 503 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:05] [INFO ] Deduced a trap composed of 164 places in 395 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:07] [INFO ] Deduced a trap composed of 164 places in 349 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:08] [INFO ] Deduced a trap composed of 165 places in 447 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:10] [INFO ] Deduced a trap composed of 165 places in 498 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:10] [INFO ] Deduced a trap composed of 165 places in 464 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:11] [INFO ] Deduced a trap composed of 164 places in 586 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:12] [INFO ] Deduced a trap composed of 164 places in 542 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:13] [INFO ] Deduced a trap composed of 166 places in 571 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:13] [INFO ] Deduced a trap composed of 164 places in 583 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:14] [INFO ] Deduced a trap composed of 166 places in 560 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:14] [INFO ] Deduced a trap composed of 167 places in 483 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:15] [INFO ] Deduced a trap composed of 167 places in 355 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:15] [INFO ] Deduced a trap composed of 165 places in 349 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1107 variables, and 31 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 445/484 places, 662/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61360 ms. Remains : 445/484 places, 662/701 transitions.
[2025-06-05 15:53:19] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:53:19] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:53:19] [INFO ] Input system was already deterministic with 662 transitions.
[2025-06-05 15:53:19] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:53:19] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:53:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11116938126017004294.gal : 7 ms
[2025-06-05 15:53:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17276481256539201177.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11116938126017004294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17276481256539201177.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.08029e+08,11.6625,199768,2,13838,5,579250,6,0,2444,855002,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:53:49] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:53:49] [INFO ] Applying decomposition
[2025-06-05 15:53:49] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3863557506500238853.txt' '-o' '/tmp/graph3863557506500238853.bin' '-w' '/tmp/graph3863557506500238853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3863557506500238853.bin' '-l' '-1' '-v' '-w' '/tmp/graph3863557506500238853.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:53:49] [INFO ] Decomposing Gal with order
[2025-06-05 15:53:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:53:49] [INFO ] Removed a total of 795 redundant transitions.
[2025-06-05 15:53:49] [INFO ] Flatten gal took : 40 ms
[2025-06-05 15:53:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-06-05 15:53:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1865824929890309477.gal : 6 ms
[2025-06-05 15:53:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16060707011727008684.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1865824929890309477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16060707011727008684.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,8.08029e+08,5.51212,141304,1600,17,252276,851,893,714890,48,2634,0


Converting to forward existential form...Done !
original formula: EG(AX(A(E((i14.u91.p271==1) U (i15.u96.p295==1)) U ((i17.u104.p311!=1)&&(!(((i3.u14.p42==0)||(i22.u137.p412==1))&&(i0.u64.p189==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(((i17.u104.p311!=1)&&(!(((i3.u14.p42==0)||(i22.u137.p412==1))&&(i0.u64.p189==1))))) U (...396
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t105, t142, t143, t160, t205, t239, t241, t258, t303, t337, t339, t355, t434, t436...455
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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Graph (trivial) has 478 edges and 484 vertex of which 68 / 484 are part of one of the 11 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 294 place count 426 transition count 343
Reduce places removed 293 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 299 rules applied. Total rules applied 593 place count 133 transition count 337
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 602 place count 130 transition count 331
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 610 place count 124 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 611 place count 123 transition count 329
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 611 place count 123 transition count 316
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 637 place count 110 transition count 316
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 645 place count 102 transition count 308
Iterating global reduction 5 with 8 rules applied. Total rules applied 653 place count 102 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 653 place count 102 transition count 307
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 655 place count 101 transition count 307
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 657 place count 99 transition count 298
Iterating global reduction 5 with 2 rules applied. Total rules applied 659 place count 99 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 660 place count 99 transition count 297
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 686 place count 86 transition count 284
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 700 place count 72 transition count 145
Iterating global reduction 6 with 14 rules applied. Total rules applied 714 place count 72 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 719 place count 72 transition count 140
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 721 place count 70 transition count 136
Iterating global reduction 7 with 2 rules applied. Total rules applied 723 place count 70 transition count 136
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 725 place count 68 transition count 134
Iterating global reduction 7 with 2 rules applied. Total rules applied 727 place count 68 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 732 place count 68 transition count 129
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 742 place count 63 transition count 124
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 744 place count 63 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 745 place count 62 transition count 123
Applied a total of 745 rules in 69 ms. Remains 62 /484 variables (removed 422) and now considering 123/701 (removed 578) transitions.
[2025-06-05 15:54:19] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
// Phase 1: matrix 118 rows 62 cols
[2025-06-05 15:54:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 15:54:19] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
[2025-06-05 15:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:54:20] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:54:20] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-05 15:54:20] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
[2025-06-05 15:54:20] [INFO ] Invariant cache hit.
[2025-06-05 15:54:20] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:21] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:22] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:22] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:22] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:22] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:22] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:23] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:23] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 117/179 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:25] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:26] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (OVERLAPS) 1/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (OVERLAPS) 0/180 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 100 constraints, problems are : Problem set: 0 solved, 115 unsolved in 14366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 117/179 variables, 62/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 115/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:41] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 216 constraints, problems are : Problem set: 0 solved, 115 unsolved in 17024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31414ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 31415ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/484 places, 123/701 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31724 ms. Remains : 62/484 places, 123/701 transitions.
[2025-06-05 15:54:51] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:54:51] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:54:51] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-05 15:54:51] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:54:51] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:54:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3500318640138560182.gal : 1 ms
[2025-06-05 15:54:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality1933089423158272417.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3500318640138560182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1933089423158272417.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,49954,0.369515,10544,2,2393,5,21194,6,0,363,23937,0


Converting to forward existential form...Done !
original formula: A(EF((p410==0)) U !((((!(EG(((p538==0)||(p422==1)))) * EF(((p440==0)||(p96==1)))) * ((p325==0)||(p506==1))) + (p236!=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((((!(EG(((p538==0)||(p422==1)))) * E(TRUE U ((p440==0)||(p96==1)))) * ((p325==0)||(p506==1)))...447
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t13, t14, t17, t21, t22, t29, t30, t36, t52, t53, t55, t57, t63, t64, t65, t69, t...303
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.16027,171200,1,0,616,1.00814e+06,277,317,3408,805179,663
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Graph (trivial) has 485 edges and 484 vertex of which 72 / 484 are part of one of the 11 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 298 place count 422 transition count 335
Reduce places removed 297 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 305 rules applied. Total rules applied 603 place count 125 transition count 327
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 608 place count 121 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 609 place count 120 transition count 326
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 609 place count 120 transition count 312
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 637 place count 106 transition count 312
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 643 place count 100 transition count 306
Iterating global reduction 4 with 6 rules applied. Total rules applied 649 place count 100 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 649 place count 100 transition count 305
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 651 place count 99 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 652 place count 98 transition count 297
Iterating global reduction 4 with 1 rules applied. Total rules applied 653 place count 98 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 654 place count 98 transition count 296
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 680 place count 85 transition count 283
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 693 place count 72 transition count 152
Iterating global reduction 5 with 13 rules applied. Total rules applied 706 place count 72 transition count 152
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 713 place count 72 transition count 145
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 716 place count 69 transition count 139
Iterating global reduction 6 with 3 rules applied. Total rules applied 719 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 722 place count 66 transition count 136
Iterating global reduction 6 with 3 rules applied. Total rules applied 725 place count 66 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 730 place count 66 transition count 131
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 740 place count 61 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 741 place count 60 transition count 125
Applied a total of 741 rules in 92 ms. Remains 60 /484 variables (removed 424) and now considering 125/701 (removed 576) transitions.
[2025-06-05 15:54:59] [INFO ] Flow matrix only has 119 transitions (discarded 6 similar events)
// Phase 1: matrix 119 rows 60 cols
[2025-06-05 15:54:59] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:59] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 15:54:59] [INFO ] Flow matrix only has 119 transitions (discarded 6 similar events)
[2025-06-05 15:54:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:55:00] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:55:00] [INFO ] Redundant transitions in 6 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-05 15:55:00] [INFO ] Flow matrix only has 119 transitions (discarded 6 similar events)
[2025-06-05 15:55:00] [INFO ] Invariant cache hit.
[2025-06-05 15:55:00] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:01] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:02] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:02] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:02] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:02] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:03] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 118/178 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 91 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10739 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 118/178 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 116/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:14] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/179 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:19] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:19] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:19] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 0/179 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 211 constraints, problems are : Problem set: 0 solved, 116 unsolved in 18274 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29055ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 29056ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/484 places, 125/701 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29396 ms. Remains : 60/484 places, 125/701 transitions.
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:55:29] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:55:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3639744351766109720.gal : 1 ms
[2025-06-05 15:55:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality5632197908268994885.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3639744351766109720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5632197908268994885.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,46094,0.209136,10300,2,2381,5,22223,6,0,356,22113,0


Converting to forward existential form...Done !
original formula: EF((((AG((p507==1)) * (p107==1)) + ((p77==0)&&(p61==1))) + ((p76==0)&&(p504==1))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (p107==1)) * !(E(TRUE U !((p507==1)))))] != FALSE + [(FwdU(Init,TRUE) * ((p77==0)&&(p61==...226
Reverse transition relation is NOT exact ! Due to transitions t2, t11, t13, t14, t20, t21, t28, t35, t49, t50, t52, t55, t56, t60, t61, t62, t66, t70, t83,...278
(forward)formula 0,1,1.54365,46468,1,0,233,195592,266,111,3425,126695,254
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 458 transition count 675
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 458 transition count 675
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 448 transition count 665
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 448 transition count 665
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 443 transition count 660
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 442 transition count 659
Applied a total of 84 rules in 45 ms. Remains 442 /484 variables (removed 42) and now considering 659/701 (removed 42) transitions.
// Phase 1: matrix 659 rows 442 cols
[2025-06-05 15:55:30] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:31] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-05 15:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:31] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 15:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:01] [INFO ] Deduced a trap composed of 162 places in 563 ms of which 113 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 6 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:14] [INFO ] Deduced a trap composed of 162 places in 277 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:15] [INFO ] Deduced a trap composed of 163 places in 393 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:15] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:16] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:17] [INFO ] Deduced a trap composed of 163 places in 364 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:18] [INFO ] Deduced a trap composed of 163 places in 582 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:18] [INFO ] Deduced a trap composed of 163 places in 463 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:19] [INFO ] Deduced a trap composed of 163 places in 273 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:19] [INFO ] Deduced a trap composed of 164 places in 474 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:20] [INFO ] Deduced a trap composed of 164 places in 473 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:21] [INFO ] Deduced a trap composed of 165 places in 434 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:22] [INFO ] Deduced a trap composed of 163 places in 416 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:22] [INFO ] Deduced a trap composed of 164 places in 376 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:23] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:23] [INFO ] Deduced a trap composed of 165 places in 311 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:24] [INFO ] Deduced a trap composed of 166 places in 484 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:25] [INFO ] Deduced a trap composed of 163 places in 511 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:26] [INFO ] Deduced a trap composed of 164 places in 490 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:26] [INFO ] Deduced a trap composed of 165 places in 396 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:27] [INFO ] Deduced a trap composed of 164 places in 590 ms of which 148 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:28] [INFO ] Deduced a trap composed of 163 places in 320 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:29] [INFO ] Deduced a trap composed of 164 places in 330 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:31] [INFO ] Deduced a trap composed of 164 places in 320 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 29 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 442/484 places, 659/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 442/484 places, 659/701 transitions.
[2025-06-05 15:56:31] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:56:31] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:56:32] [INFO ] Input system was already deterministic with 659 transitions.
[2025-06-05 15:56:32] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:56:32] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:56:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5079709566410782106.gal : 5 ms
[2025-06-05 15:56:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12078760979340639315.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5079709566410782106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12078760979340639315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96896e+08,10.4739,210340,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
original formula: EX(EF((((p385==1)&&(p49==1))&&(p547==0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (((p385==1)&&(p49==1))&&(p547==0)))] != FALSE
(forward)formula 0,1,16.1688,213540,1,0,9,632473,9,1,5413,916195,4
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Graph (trivial) has 493 edges and 484 vertex of which 76 / 484 are part of one of the 12 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 302 place count 419 transition count 327
Reduce places removed 301 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 309 rules applied. Total rules applied 611 place count 118 transition count 319
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 616 place count 114 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 113 transition count 318
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 617 place count 113 transition count 306
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 641 place count 101 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 649 place count 93 transition count 298
Iterating global reduction 4 with 8 rules applied. Total rules applied 657 place count 93 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 657 place count 93 transition count 297
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 659 place count 92 transition count 297
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 661 place count 90 transition count 288
Iterating global reduction 4 with 2 rules applied. Total rules applied 663 place count 90 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 664 place count 90 transition count 287
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 690 place count 77 transition count 274
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 705 place count 62 transition count 133
Iterating global reduction 5 with 15 rules applied. Total rules applied 720 place count 62 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 728 place count 62 transition count 125
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 732 place count 58 transition count 117
Iterating global reduction 6 with 4 rules applied. Total rules applied 736 place count 58 transition count 117
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 740 place count 54 transition count 113
Iterating global reduction 6 with 4 rules applied. Total rules applied 744 place count 54 transition count 113
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 748 place count 54 transition count 109
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 756 place count 50 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 757 place count 49 transition count 104
Applied a total of 757 rules in 34 ms. Remains 49 /484 variables (removed 435) and now considering 104/701 (removed 597) transitions.
[2025-06-05 15:56:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 49 cols
[2025-06-05 15:56:48] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:56:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-05 15:56:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-05 15:56:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:56:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:56:48] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:56:48] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-05 15:56:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-05 15:56:48] [INFO ] Invariant cache hit.
[2025-06-05 15:56:48] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:49] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:49] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:49] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:49] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:50] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:52] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:52] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:53] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/148 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 81 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/175 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/148 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:05] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/148 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (OVERLAPS) 0/148 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 178 constraints, problems are : Problem set: 0 solved, 95 unsolved in 13568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23043ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 23045ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/484 places, 104/701 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23472 ms. Remains : 49/484 places, 104/701 transitions.
[2025-06-05 15:57:11] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:57:11] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:57:11] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-05 15:57:11] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:57:11] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:57:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality18334680920512610106.gal : 1 ms
[2025-06-05 15:57:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality9330000815369871924.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18334680920512610106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9330000815369871924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24160,0.237606,8136,2,2209,5,15179,6,0,292,14033,0


Converting to forward existential form...Done !
original formula: AG(EF((p535==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p535==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t8, t10, t11, t17, t18, t24, t25, t30, t39, t40, t41, t42, t48, t49, t50, t54, t58, t...278
(forward)formula 0,0,1.02751,25464,1,0,203,89613,223,93,2840,61969,212
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Graph (trivial) has 482 edges and 484 vertex of which 74 / 484 are part of one of the 12 SCC in 2 ms
Free SCC test removed 62 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 292 place count 421 transition count 340
Reduce places removed 291 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 299 rules applied. Total rules applied 591 place count 130 transition count 332
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 597 place count 126 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 599 place count 124 transition count 330
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 599 place count 124 transition count 317
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 625 place count 111 transition count 317
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 632 place count 104 transition count 310
Iterating global reduction 4 with 7 rules applied. Total rules applied 639 place count 104 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 639 place count 104 transition count 309
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 641 place count 103 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 643 place count 101 transition count 300
Iterating global reduction 4 with 2 rules applied. Total rules applied 645 place count 101 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 646 place count 101 transition count 299
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 672 place count 88 transition count 286
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 684 place count 76 transition count 156
Iterating global reduction 5 with 12 rules applied. Total rules applied 696 place count 76 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 703 place count 76 transition count 149
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 706 place count 73 transition count 143
Iterating global reduction 6 with 3 rules applied. Total rules applied 709 place count 73 transition count 143
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 712 place count 70 transition count 140
Iterating global reduction 6 with 3 rules applied. Total rules applied 715 place count 70 transition count 140
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 719 place count 70 transition count 136
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 727 place count 66 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 728 place count 65 transition count 131
Applied a total of 728 rules in 59 ms. Remains 65 /484 variables (removed 419) and now considering 131/701 (removed 570) transitions.
[2025-06-05 15:57:12] [INFO ] Flow matrix only has 125 transitions (discarded 6 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-06-05 15:57:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-05 15:57:13] [INFO ] Flow matrix only has 125 transitions (discarded 6 similar events)
[2025-06-05 15:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:57:13] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:57:13] [INFO ] Redundant transitions in 6 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-05 15:57:13] [INFO ] Flow matrix only has 125 transitions (discarded 6 similar events)
[2025-06-05 15:57:13] [INFO ] Invariant cache hit.
[2025-06-05 15:57:13] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:14] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:14] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:15] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:16] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:16] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:16] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:17] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:17] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:18] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:19] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 124/189 variables, 65/84 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:21] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 1/190 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (OVERLAPS) 0/190 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 100 constraints, problems are : Problem set: 0 solved, 122 unsolved in 18584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 124/189 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 122/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/190 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:44] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/190 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 223 constraints, problems are : Problem set: 0 solved, 122 unsolved in 24719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43351ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 43353ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/484 places, 131/701 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43751 ms. Remains : 65/484 places, 131/701 transitions.
[2025-06-05 15:57:56] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:57:56] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:57:56] [INFO ] Input system was already deterministic with 131 transitions.
[2025-06-05 15:57:56] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:57:56] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17595387915397481072.gal : 1 ms
[2025-06-05 15:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality8351801862841225134.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17595387915397481072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8351801862841225134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,61226,0.221613,9408,2,2544,5,18131,6,0,382,17335,0


Converting to forward existential form...Done !
original formula: AG(A((!(AF(((p143==0)||(p195==1)))) * ((p187==0)||(p76==1))) U AG(((p241==0)&&((p79==0)||(p163==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !(((p241==0)&&((p79==0)||(p163==1)))))))) * !((!(!(EG(!(((p143==0)||(...340
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t8, t10, t11, t18, t19, t33, t34, t40, t54, t56, t59, t60, t66, t67, t68, t75, t77, t...286
(forward)formula 0,0,4.34113,103792,1,0,281,470104,283,130,3557,388835,311
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 701/701 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 458 transition count 675
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 458 transition count 675
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 448 transition count 665
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 448 transition count 665
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 443 transition count 660
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 442 transition count 659
Applied a total of 84 rules in 44 ms. Remains 442 /484 variables (removed 42) and now considering 659/701 (removed 42) transitions.
// Phase 1: matrix 659 rows 442 cols
[2025-06-05 15:58:01] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:01] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-05 15:58:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:02] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 15:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 5 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:53] [INFO ] Deduced a trap composed of 162 places in 583 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:53] [INFO ] Deduced a trap composed of 162 places in 341 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:54] [INFO ] Deduced a trap composed of 163 places in 374 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:54] [INFO ] Deduced a trap composed of 164 places in 368 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:56] [INFO ] Deduced a trap composed of 163 places in 368 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:57] [INFO ] Deduced a trap composed of 163 places in 433 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:57] [INFO ] Deduced a trap composed of 163 places in 333 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:58] [INFO ] Deduced a trap composed of 164 places in 438 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:58] [INFO ] Deduced a trap composed of 164 places in 422 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:00] [INFO ] Deduced a trap composed of 163 places in 439 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:01] [INFO ] Deduced a trap composed of 162 places in 451 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:01] [INFO ] Deduced a trap composed of 164 places in 357 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:02] [INFO ] Deduced a trap composed of 165 places in 459 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:02] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 21 ms to minimize.
SMT process timed out in 60399ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 442/484 places, 659/701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61523 ms. Remains : 442/484 places, 659/701 transitions.
[2025-06-05 15:59:02] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:59:02] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:59:02] [INFO ] Input system was already deterministic with 659 transitions.
[2025-06-05 15:59:02] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:59:02] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:59:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality4795554771789277784.gal : 5 ms
[2025-06-05 15:59:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10980112720540259648.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4795554771789277784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10980112720540259648.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96896e+08,10.9428,209532,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:59:32] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:59:32] [INFO ] Applying decomposition
[2025-06-05 15:59:32] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16745455797088820522.txt' '-o' '/tmp/graph16745455797088820522.bin' '-w' '/tmp/graph16745455797088820522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16745455797088820522.bin' '-l' '-1' '-v' '-w' '/tmp/graph16745455797088820522.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:59:32] [INFO ] Decomposing Gal with order
[2025-06-05 15:59:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:59:33] [INFO ] Removed a total of 794 redundant transitions.
[2025-06-05 15:59:33] [INFO ] Flatten gal took : 84 ms
[2025-06-05 15:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2025-06-05 15:59:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6360210962239609278.gal : 9 ms
[2025-06-05 15:59:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3344454613442914849.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6360210962239609278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3344454613442914849.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,7.96896e+08,13.7123,374328,1714,13,628037,836,888,2.14249e+06,47,2892,0


Converting to forward existential form...Done !
original formula: EX(EX(AG(EX(((i22.u142.p446==0)||(i9.u57.p177==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !(EX(((i22.u142.p446==0)||(i9.u57.p177==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t157, t202, t236, t238, t255, t300, t334, t352, t397, t431, t454, t456, t458...459
(forward)formula 0,0,19.3517,374328,1,0,628037,900,6857,2.14249e+06,219,3341,1618264
FORMULA StigmergyElection-PT-04b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-06-05 15:59:52] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:59:52] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:59:52] [INFO ] Applying decomposition
[2025-06-05 15:59:52] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12401117904581549416.txt' '-o' '/tmp/graph12401117904581549416.bin' '-w' '/tmp/graph12401117904581549416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12401117904581549416.bin' '-l' '-1' '-v' '-w' '/tmp/graph12401117904581549416.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:59:52] [INFO ] Decomposing Gal with order
[2025-06-05 15:59:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:59:52] [INFO ] Removed a total of 798 redundant transitions.
[2025-06-05 15:59:52] [INFO ] Flatten gal took : 39 ms
[2025-06-05 15:59:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 15:59:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14006096606539101669.gal : 14 ms
[2025-06-05 15:59:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4836717289465858759.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14006096606539101669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4836717289465858759.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 4 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.02932e+09,17.2858,459492,2192,16,853313,1095,1033,2.19229e+06,46,5002,0


Converting to forward existential form...Done !
original formula: (EG(((EF((((i7.i1.u46.p130==0)||(i11.u18.p52==1))&&(i18.i0.u108.p301==1))) * (((i20.i0.u119.p327==0)||(i5.i0.u34.p92==1))||(i27.u158.p446...258
=> equivalent forward existential formula: ([(Init * !(EG(((E(TRUE U (((i7.i1.u46.p130==0)||(i11.u18.p52==1))&&(i18.i0.u108.p301==1))) * (((i20.i0.u119.p32...333
Reverse transition relation is NOT exact ! Due to transitions t8, t64, t111, t113, t151, t152, t169, t218, t220, t256, t258, t275, t286, t324, t325, t361, ...431
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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
(forward)formula 0,1,223.278,2560344,1,0,1.64001e+06,1095,2522,2.97529e+07,98,5002,1950113
FORMULA StigmergyElection-PT-04b-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AF(AX((i5.i0.u34.p92==1))) U EG(((!(EG((i21.u126.p349==1))) + A(!(EF(((i11.u37.p100==0)||(i7.i1.u45.p126==1)))) U A(((i9.u60.p163==0)||...304
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(!(EX(!((i5.i0.u34.p92==1)))))))),((!(EG((i21.u126.p349==1))) + !((E(!(!((E(!((i25.i1.u151...742
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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
[2025-06-05 16:26:01] [INFO ] Applying decomposition
[2025-06-05 16:26:01] [INFO ] Flatten gal took : 16 ms
[2025-06-05 16:26:01] [INFO ] Decomposing Gal with order
[2025-06-05 16:26:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:26:01] [INFO ] Removed a total of 709 redundant transitions.
[2025-06-05 16:26:01] [INFO ] Flatten gal took : 33 ms
[2025-06-05 16:26:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 5 ms.
[2025-06-05 16:26:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15649486704098146885.gal : 2 ms
[2025-06-05 16:26:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6810680203493956964.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15649486704098146885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6810680203493956964.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 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.02932e+09,0.501887,19796,196,4004,3274,34040,140,11124,950,171734,0


Converting to forward existential form...Done !
original formula: E(AF(AX((i0.i0.i0.u4.p92==1))) U EG(((!(EG((i0.i0.u6.p349==1))) + A(!(EF(((i0.i0.i0.u4.p100==0)||(i0.i0.i0.u4.p126==1)))) U A(((i0.i0.i0....314
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(!(EX(!((i0.i0.i0.u4.p92==1)))))))),((!(EG((i0.i0.u6.p349==1))) + !((E(!(!((E(!((i0.u7.p42...716
Reverse transition relation is NOT exact ! Due to transitions t490, u8.t36, u8.t43, u8.t50, i0.u7.t64, i0.u7.t73, i0.u7.t109, i0.u7.t111, i0.u7.t112, i0.u7...653
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-04b"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-04b, 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 r226-smll-174903490900201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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