Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1749138250658

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 15:44:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:44:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:44:13] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-06-05 15:44:13] [INFO ] Transformed 563 places.
[2025-06-05 15:44:13] [INFO ] Transformed 780 transitions.
[2025-06-05 15:44:13] [INFO ] Found NUPN structural information;
[2025-06-05 15:44:13] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 131 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 511 transition count 728
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 511 transition count 728
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 124 place count 491 transition count 708
Iterating global reduction 0 with 20 rules applied. Total rules applied 144 place count 491 transition count 708
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 148 place count 487 transition count 704
Iterating global reduction 0 with 4 rules applied. Total rules applied 152 place count 487 transition count 704
Applied a total of 152 rules in 216 ms. Remains 487 /563 variables (removed 76) and now considering 704/780 (removed 76) transitions.
// Phase 1: matrix 704 rows 487 cols
[2025-06-05 15:44:13] [INFO ] Computed 5 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:44:14] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-06-05 15:44:14] [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 933 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
Running 703 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
(s168 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
SMT process timed out in 30625ms, After SMT, problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 30653ms
Starting structural reductions in LTL mode, iteration 1 : 487/563 places, 704/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32413 ms. Remains : 487/563 places, 704/780 transitions.
Support contains 131 out of 487 places after structural reductions.
[2025-06-05 15:44:46] [INFO ] Flatten gal took : 190 ms
[2025-06-05 15:44:46] [INFO ] Flatten gal took : 105 ms
[2025-06-05 15:44:46] [INFO ] Input system was already deterministic with 704 transitions.
RANDOM walk for 40000 steps (544 resets) in 2537 ms. (15 steps per ms) remains 52/102 properties
BEST_FIRST walk for 4003 steps (9 resets) in 72 ms. (54 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (10 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (9 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (10 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (10 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
[2025-06-05 15:44:48] [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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 1 (OVERLAPS) 405/487 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:50] [INFO ] Deduced a trap composed of 172 places in 470 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 1/6 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 704/1191 variables, 487/493 constraints. Problems are: Problem set: 6 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:53] [INFO ] Deduced a trap composed of 171 places in 597 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:53] [INFO ] Deduced a trap composed of 172 places in 348 ms of which 59 ms to minimize.
SMT process timed out in 5368ms, After SMT, problems are : Problem set: 6 solved, 46 unsolved
Fused 46 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 73 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 369 edges and 487 vertex of which 42 / 487 are part of one of the 7 SCC in 6 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 824 edges and 452 vertex of which 450 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 450 transition count 446
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 219 rules applied. Total rules applied 434 place count 238 transition count 439
Reduce places removed 4 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 2 with 36 rules applied. Total rules applied 470 place count 234 transition count 407
Reduce places removed 32 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 34 rules applied. Total rules applied 504 place count 202 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 505 place count 201 transition count 405
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 505 place count 201 transition count 389
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 537 place count 185 transition count 389
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 543 place count 179 transition count 383
Iterating global reduction 5 with 6 rules applied. Total rules applied 549 place count 179 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 550 place count 178 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 551 place count 178 transition count 382
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 583 place count 162 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 162 transition count 365
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 586 place count 160 transition count 363
Iterating global reduction 6 with 2 rules applied. Total rules applied 588 place count 160 transition count 363
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 604 place count 152 transition count 379
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 608 place count 152 transition count 375
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 620 place count 152 transition count 363
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 632 place count 140 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 633 place count 140 transition count 362
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 636 place count 140 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 637 place count 139 transition count 361
Applied a total of 637 rules in 344 ms. Remains 139 /487 variables (removed 348) and now considering 361/704 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 139/487 places, 361/704 transitions.
RANDOM walk for 40000 steps (2443 resets) in 791 ms. (50 steps per ms) remains 29/46 properties
BEST_FIRST walk for 4002 steps (44 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (37 resets) in 17 ms. (222 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (40 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (39 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (39 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (51 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 24/25 properties
// Phase 1: matrix 361 rows 139 cols
[2025-06-05 15:44:54] [INFO ] Computed 4 invariants in 4 ms
[2025-06-05 15:44:54] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 73/123 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 351/474 variables, 123/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 22/496 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 18/163 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 4/500 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:55] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 8 ms to minimize.
Problem AtomicPropp86 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:56] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/500 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 169 constraints, problems are : Problem set: 1 solved, 23 unsolved in 3199 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 139/139 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp97 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/122 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 349/471 variables, 122/128 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 6/134 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 8/142 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 24/495 variables, 12/154 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 18/172 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 13/185 constraints. Problems are: Problem set: 3 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:44:59] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 1/186 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 5/500 variables, 5/191 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/500 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 191 constraints, problems are : Problem set: 3 solved, 21 unsolved in 7872 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 139/139 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 21/24 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11110ms problems are : Problem set: 3 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 1249 ms.
Support contains 41 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 361/361 transitions.
Graph (trivial) has 72 edges and 139 vertex of which 12 / 139 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 132 transition count 331
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 115 transition count 329
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 42 place count 114 transition count 325
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 45 place count 111 transition count 325
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 45 place count 111 transition count 322
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 51 place count 108 transition count 322
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 105 transition count 319
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 105 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 57 place count 105 transition count 318
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 59 place count 104 transition count 318
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 4 with 8 rules applied. Total rules applied 67 place count 100 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 71 place count 100 transition count 310
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 72 place count 99 transition count 309
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 99 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 75 place count 98 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 77 place count 97 transition count 308
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 97 place count 97 transition count 288
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 117 place count 77 transition count 288
Applied a total of 117 rules in 63 ms. Remains 77 /139 variables (removed 62) and now considering 288/361 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 77/139 places, 288/361 transitions.
RANDOM walk for 40000 steps (1315 resets) in 695 ms. (57 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40002 steps (561 resets) in 251 ms. (158 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (672 resets) in 149 ms. (266 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (558 resets) in 62 ms. (634 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (360 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (470 resets) in 50 ms. (784 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (591 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (786 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (574 resets) in 41 ms. (952 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (13 resets) in 34 ms. (1142 steps per ms) remains 3/4 properties
// Phase 1: matrix 288 rows 77 cols
[2025-06-05 15:45:07] [INFO ] Computed 4 invariants in 9 ms
[2025-06-05 15:45:07] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 277/342 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 23/365 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 21/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 277/342 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/365 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 21/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 288/288 transitions.
Graph (trivial) has 42 edges and 77 vertex of which 2 / 77 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 314 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 75 transition count 275
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 65 transition count 271
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 62 transition count 271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 29 place count 62 transition count 269
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 60 transition count 269
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 36 place count 57 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 57 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 57 transition count 195
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 49 place count 53 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 53 transition count 189
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 54 place count 50 transition count 183
Iterating global reduction 5 with 3 rules applied. Total rules applied 57 place count 50 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 59 place count 49 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 49 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 63 place count 48 transition count 179
Free-agglomeration rule applied 15 times with reduction of 30 identical transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 78 place count 48 transition count 134
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 102 place count 33 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 105 place count 33 transition count 122
Applied a total of 105 rules in 76 ms. Remains 33 /77 variables (removed 44) and now considering 122/288 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 33/77 places, 122/288 transitions.
RANDOM walk for 40000 steps (99 resets) in 110 ms. (360 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (58 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (66 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
// Phase 1: matrix 122 rows 33 cols
[2025-06-05 15:45:08] [INFO ] Computed 4 invariants in 1 ms
[2025-06-05 15:45:08] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 115/144 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/155 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 33/33 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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 9 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:45:08] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 3 ms to minimize.
Problem AtomicPropp74 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 115/144 variables, 29/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 39/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/155 variables, 4/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 34/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
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 17 places in 97 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 114 constraints, problems are : Problem set: 1 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 33/33 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 122/122 transitions.
Graph (trivial) has 12 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 124 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 3 rules applied. Total rules applied 5 place count 31 transition count 117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 28 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 27 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 27 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 26 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 26 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 25 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 25 transition count 111
Free-agglomeration rule applied 6 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 25 transition count 93
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 52 place count 19 transition count 72
Applied a total of 52 rules in 30 ms. Remains 19 /33 variables (removed 14) and now considering 72/122 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 19/33 places, 72/122 transitions.
RANDOM walk for 40000 steps (2840 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (207 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Probably explored full state space saw : 194 states, properties seen :0
Probabilistic random walk after 661 steps, saw 194 distinct states, run finished after 18 ms. (steps per millisecond=36 ) properties seen :0
Explored full state space saw : 194 states, properties seen :0
Exhaustive walk after 661 steps, saw 194 distinct states, run finished after 4 ms. (steps per millisecond=165 ) properties seen :0
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 15:45:09] [INFO ] Flatten gal took : 75 ms
[2025-06-05 15:45:09] [INFO ] Flatten gal took : 73 ms
[2025-06-05 15:45:09] [INFO ] Input system was already deterministic with 704 transitions.
Support contains 107 out of 487 places (down from 108) after GAL structural reductions.
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 70 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 462 transition count 679
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 462 transition count 679
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 449 transition count 666
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 449 transition count 666
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 445 transition count 662
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 444 transition count 661
Applied a total of 86 rules in 144 ms. Remains 444 /487 variables (removed 43) and now considering 661/704 (removed 43) transitions.
// Phase 1: matrix 661 rows 444 cols
[2025-06-05 15:45:09] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:45:10] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-05 15:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:45:10] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-05 15:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:45:41] [INFO ] Deduced a trap composed of 162 places in 584 ms of which 115 ms to minimize.
SMT process timed out in 30747ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 30751ms
Starting structural reductions in LTL mode, iteration 1 : 444/487 places, 661/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31867 ms. Remains : 444/487 places, 661/704 transitions.
[2025-06-05 15:45:41] [INFO ] Flatten gal took : 54 ms
[2025-06-05 15:45:41] [INFO ] Flatten gal took : 50 ms
[2025-06-05 15:45:41] [INFO ] Input system was already deterministic with 661 transitions.
[2025-06-05 15:45:41] [INFO ] Flatten gal took : 32 ms
[2025-06-05 15:45:41] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15999414399536049147.gal : 41 ms
[2025-06-05 15:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5772938513570845848.ctl : 6 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/CTLFireability15999414399536049147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5772938513570845848.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.05323e+08,9.72565,208844,2,14895,5,625400,6,0,2439,916166,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:46:12] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:46:12] [INFO ] Applying decomposition
[2025-06-05 15:46:12] [INFO ] Flatten gal took : 22 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/graph15974628145691318809.txt' '-o' '/tmp/graph15974628145691318809.bin' '-w' '/tmp/graph15974628145691318809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15974628145691318809.bin' '-l' '-1' '-v' '-w' '/tmp/graph15974628145691318809.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:46:12] [INFO ] Decomposing Gal with order
[2025-06-05 15:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:46:12] [INFO ] Removed a total of 794 redundant transitions.
[2025-06-05 15:46:12] [INFO ] Flatten gal took : 188 ms
[2025-06-05 15:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 26 ms.
[2025-06-05 15:46:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12861598416167775459.gal : 22 ms
[2025-06-05 15:46:12] [INFO ] Time to serialize properties into /tmp/CTLFireability13586135030412335188.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/CTLFireability12861598416167775459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13586135030412335188.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.05323e+08,5.57164,149692,1621,13,263645,790,924,755833,46,2455,0


Converting to forward existential form...Done !
original formula: EG((((EG((i0.i1.i0.u20.p70==0)) + (i16.u102.p312==0)) + ((i8.i0.i0.u51.p158==1)||(i0.i0.i1.u2.p22==0))) + ((i14.u85.p264==0) * (EX((((i3....312
=> equivalent forward existential formula: [FwdG(Init,(((EG((i0.i1.i0.u20.p70==0)) + (i16.u102.p312==0)) + ((i8.i0.i0.u51.p158==1)||(i0.i0.i1.u2.p22==0))) ...355
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t140, t157, t202, t236, t238, t255, t300, t335, t353, t399, t433, t456, t458...498
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 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 : 487/487 places, 704/704 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 464 transition count 681
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 464 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 454 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 454 transition count 671
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 451 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 451 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 450 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 450 transition count 667
Applied a total of 74 rules in 74 ms. Remains 450 /487 variables (removed 37) and now considering 667/704 (removed 37) transitions.
// Phase 1: matrix 667 rows 450 cols
[2025-06-05 15:46:43] [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:43] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-06-05 15:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:46:43] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2025-06-05 15:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:10] [INFO ] Deduced a trap composed of 163 places in 497 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:11] [INFO ] Deduced a trap composed of 164 places in 341 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:12] [INFO ] Deduced a trap composed of 164 places in 525 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:13] [INFO ] Deduced a trap composed of 166 places in 416 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:13] [INFO ] Deduced a trap composed of 166 places in 421 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:47:14] [INFO ] Deduced a trap composed of 165 places in 380 ms of which 78 ms to minimize.
SMT process timed out in 30605ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30611ms
Starting structural reductions in LTL mode, iteration 1 : 450/487 places, 667/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31538 ms. Remains : 450/487 places, 667/704 transitions.
[2025-06-05 15:47:14] [INFO ] Flatten gal took : 36 ms
[2025-06-05 15:47:14] [INFO ] Flatten gal took : 38 ms
[2025-06-05 15:47:14] [INFO ] Input system was already deterministic with 667 transitions.
[2025-06-05 15:47:14] [INFO ] Flatten gal took : 48 ms
[2025-06-05 15:47:14] [INFO ] Flatten gal took : 36 ms
[2025-06-05 15:47:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4327314811058964996.gal : 9 ms
[2025-06-05 15:47:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8050489059211326994.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/CTLFireability4327314811058964996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8050489059211326994.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.23137e+08,9.39365,201128,2,14876,5,615437,6,0,2469,875426,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:47:44] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:47:44] [INFO ] Applying decomposition
[2025-06-05 15:47:44] [INFO ] Flatten gal took : 18 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/graph17094627049795858153.txt' '-o' '/tmp/graph17094627049795858153.bin' '-w' '/tmp/graph17094627049795858153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17094627049795858153.bin' '-l' '-1' '-v' '-w' '/tmp/graph17094627049795858153.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:47:44] [INFO ] Decomposing Gal with order
[2025-06-05 15:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:47:45] [INFO ] Removed a total of 795 redundant transitions.
[2025-06-05 15:47:45] [INFO ] Flatten gal took : 51 ms
[2025-06-05 15:47:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 17 ms.
[2025-06-05 15:47:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4021900850300314145.gal : 9 ms
[2025-06-05 15:47:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5727397289912867073.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/CTLFireability4021900850300314145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5727397289912867073.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.23137e+08,23.3684,594652,1469,19,990825,1163,1058,3.40905e+06,44,5116,0


Converting to forward existential form...Done !
original formula: EG(((AF(E((i2.i1.u17.p48!=1) U EX((i5.i0.u4.p12==1)))) + (i0.i1.u47.p257==0)) * (((EG(((i18.u110.p328==1)&&(i0.i1.u79.p236==1))) + EF((i1...824
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(E((i2.i1.u17.p48!=1) U EX((i5.i0.u4.p12==1)))))) + (i0.i1.u47.p257==0)) * (((EG(((i18.u110.p...958
Reverse transition relation is NOT exact ! Due to transitions t60, t105, t139, t141, t158, t205, t240, t242, t260, t305, t341, t357, t402, t438, t440, t461...469
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 a local SCC at level 1
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
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 488 edges and 487 vertex of which 76 / 487 are part of one of the 12 SCC in 2 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 292 transitions
Trivial Post-agglo rules discarded 292 transitions
Performed 292 trivial Post agglomeration. Transition count delta: 292
Iterating post reduction 0 with 292 rules applied. Total rules applied 293 place count 422 transition count 339
Reduce places removed 292 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 300 rules applied. Total rules applied 593 place count 130 transition count 331
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 598 place count 126 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 599 place count 125 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 599 place count 125 transition count 318
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 623 place count 113 transition count 318
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 636 place count 100 transition count 304
Iterating global reduction 4 with 13 rules applied. Total rules applied 649 place count 100 transition count 304
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 650 place count 100 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 651 place count 99 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 651 place count 99 transition count 301
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 655 place count 97 transition count 301
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 660 place count 92 transition count 262
Iterating global reduction 6 with 5 rules applied. Total rules applied 665 place count 92 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 667 place count 92 transition count 260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 668 place count 91 transition count 259
Iterating global reduction 7 with 1 rules applied. Total rules applied 669 place count 91 transition count 259
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 7 with 26 rules applied. Total rules applied 695 place count 78 transition count 246
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 708 place count 65 transition count 134
Iterating global reduction 7 with 13 rules applied. Total rules applied 721 place count 65 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 727 place count 65 transition count 128
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 728 place count 64 transition count 126
Iterating global reduction 8 with 1 rules applied. Total rules applied 729 place count 64 transition count 126
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 730 place count 63 transition count 125
Iterating global reduction 8 with 1 rules applied. Total rules applied 731 place count 63 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 737 place count 63 transition count 119
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 8 with 8 rules applied. Total rules applied 745 place count 59 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 747 place count 57 transition count 113
Applied a total of 747 rules in 72 ms. Remains 57 /487 variables (removed 430) and now considering 113/704 (removed 591) transitions.
[2025-06-05 15:48:15] [INFO ] Flow matrix only has 108 transitions (discarded 5 similar events)
// Phase 1: matrix 108 rows 57 cols
[2025-06-05 15:48:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-05 15:48:15] [INFO ] Flow matrix only has 108 transitions (discarded 5 similar events)
[2025-06-05 15:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:48:15] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:48:15] [INFO ] Redundant transitions in 5 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-05 15:48:15] [INFO ] Flow matrix only has 108 transitions (discarded 5 similar events)
[2025-06-05 15:48:15] [INFO ] Invariant cache hit.
[2025-06-05 15:48:15] [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/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:16] [INFO ] Deduced a trap composed of 14 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:48:16] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:16] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:16] [INFO ] Deduced a trap composed of 20 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:48:16] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:16] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:16] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:17] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:17] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:17] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:17] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:18] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:18] [INFO ] Deduced a trap composed of 23 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:48:18] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:18] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:18] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:18] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 107/164 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/165 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/165 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 92 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/164 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 104/195 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/165 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:48:32] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/165 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 197 constraints, problems are : Problem set: 0 solved, 104 unsolved in 16583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25145ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 25146ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/487 places, 113/704 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25464 ms. Remains : 57/487 places, 113/704 transitions.
[2025-06-05 15:48:40] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:48:40] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:48:40] [INFO ] Input system was already deterministic with 113 transitions.
[2025-06-05 15:48:40] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:48:40] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:48:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2441200865246627351.gal : 2 ms
[2025-06-05 15:48:40] [INFO ] Time to serialize properties into /tmp/CTLFireability742533281860876229.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/CTLFireability2441200865246627351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability742533281860876229.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,42856,0.233405,8768,2,2416,5,16848,6,0,333,15145,0


Converting to forward existential form...Done !
original formula: AG(!(E(EF((p210==1)) U !((!(((p95==1)||(p341==1))) * AF((p476==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),E(TRUE U (p210==1))) * ((p95==1)||(p341==1)))] = FALSE * [FwdG(FwdU(FwdU(Init,TRUE),E(TR...195
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t9, t10, t12, t13, t14, t17, t18, t52, t53, t54, t62, t63, t64, t75, t76, t77, t7...302
Hit Full ! (commute/partial/dont) 111/0/2
(forward)formula 0,0,3.64472,83316,1,0,280,417885,256,119,3184,299936,293
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 464 transition count 681
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 464 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 454 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 454 transition count 671
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 450 transition count 667
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 450 transition count 667
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 449 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 449 transition count 666
Applied a total of 76 rules in 87 ms. Remains 449 /487 variables (removed 38) and now considering 666/704 (removed 38) transitions.
// Phase 1: matrix 666 rows 449 cols
[2025-06-05 15:48:44] [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:44] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-05 15:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:48:45] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2025-06-05 15:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:11] [INFO ] Deduced a trap composed of 164 places in 463 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:11] [INFO ] Deduced a trap composed of 165 places in 318 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:12] [INFO ] Deduced a trap composed of 164 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:49:13] [INFO ] Deduced a trap composed of 164 places in 366 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:15] [INFO ] Deduced a trap composed of 163 places in 302 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/1115 variables, and 10 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:27] [INFO ] Deduced a trap composed of 165 places in 442 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:29] [INFO ] Deduced a trap composed of 165 places in 317 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:33] [INFO ] Deduced a trap composed of 166 places in 333 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:34] [INFO ] Deduced a trap composed of 167 places in 385 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:34] [INFO ] Deduced a trap composed of 168 places in 378 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:35] [INFO ] Deduced a trap composed of 168 places in 392 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:36] [INFO ] Deduced a trap composed of 167 places in 400 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:37] [INFO ] Deduced a trap composed of 163 places in 472 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:37] [INFO ] Deduced a trap composed of 164 places in 402 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:38] [INFO ] Deduced a trap composed of 165 places in 613 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:38] [INFO ] Deduced a trap composed of 167 places in 353 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:39] [INFO ] Deduced a trap composed of 167 places in 460 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:40] [INFO ] Deduced a trap composed of 164 places in 561 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:40] [INFO ] Deduced a trap composed of 163 places in 573 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:41] [INFO ] Deduced a trap composed of 164 places in 428 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:41] [INFO ] Deduced a trap composed of 164 places in 343 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:42] [INFO ] Deduced a trap composed of 163 places in 419 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:42] [INFO ] Deduced a trap composed of 164 places in 402 ms of which 75 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/1115 variables, and 28 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/665 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 449/487 places, 666/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61298 ms. Remains : 449/487 places, 666/704 transitions.
[2025-06-05 15:49:45] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:49:45] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:49:45] [INFO ] Input system was already deterministic with 666 transitions.
[2025-06-05 15:49:45] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:49:45] [INFO ] Flatten gal took : 28 ms
[2025-06-05 15:49:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12701745184061938260.gal : 7 ms
[2025-06-05 15:49:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15402782065269908463.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/CTLFireability12701745184061938260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15402782065269908463.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.23771e+08,10.669,218852,2,14689,5,659980,6,0,2464,948971,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:50:16] [INFO ] Flatten gal took : 17 ms
[2025-06-05 15:50:16] [INFO ] Applying decomposition
[2025-06-05 15:50:16] [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/graph16680028855479641987.txt' '-o' '/tmp/graph16680028855479641987.bin' '-w' '/tmp/graph16680028855479641987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16680028855479641987.bin' '-l' '-1' '-v' '-w' '/tmp/graph16680028855479641987.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:50:16] [INFO ] Decomposing Gal with order
[2025-06-05 15:50:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:50:16] [INFO ] Removed a total of 795 redundant transitions.
[2025-06-05 15:50:16] [INFO ] Flatten gal took : 50 ms
[2025-06-05 15:50:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-05 15:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14813359107600645581.gal : 9 ms
[2025-06-05 15:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16063234204201958730.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/CTLFireability14813359107600645581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16063234204201958730.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.23771e+08,24.9685,620500,1703,19,1.01868e+06,1135,1081,3.64565e+06,47,5003,0


Converting to forward existential form...Done !
original formula: (AG(AF((AX(EX((i9.i1.u48.p149==1))) + !(A((i0.i1.u6.p19==1) U (i20.i1.u119.p372==1)))))) + A(EF(((i12.i0.u72.p226==1) * AF(AG((i4.i1.u27....313
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!(!(!(EX(!(((!((((i8.i0.u9.p27==1)&&(i8.i0.u52.p162==1))&&((i8.i1.u88.p309==1)&&(i8.i1...800
Reverse transition relation is NOT exact ! Due to transitions t60, t105, t139, t141, t158, t204, t238, t240, t258, t303, t340, t356, t401, t437, t460, t464...491
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 465 transition count 682
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 465 transition count 682
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 453 transition count 670
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 453 transition count 670
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 449 transition count 666
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 449 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 448 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 448 transition count 665
Applied a total of 78 rules in 51 ms. Remains 448 /487 variables (removed 39) and now considering 665/704 (removed 39) transitions.
// Phase 1: matrix 665 rows 448 cols
[2025-06-05 15:50:46] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:50:46] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-06-05 15:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:50:47] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Running 664 sub problems to find dead transitions.
[2025-06-05 15:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:15] [INFO ] Deduced a trap composed of 165 places in 262 ms of which 18 ms to minimize.
(s416 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.0)
(s74 1.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 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 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 0.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 1.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 1.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 0.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 0.0)
(s416 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1113 variables, and 6 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:33] [INFO ] Deduced a trap composed of 165 places in 454 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:33] [INFO ] Deduced a trap composed of 165 places in 399 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:34] [INFO ] Deduced a trap composed of 166 places in 401 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:36] [INFO ] Deduced a trap composed of 165 places in 480 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:36] [INFO ] Deduced a trap composed of 165 places in 313 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:38] [INFO ] Deduced a trap composed of 167 places in 522 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:39] [INFO ] Deduced a trap composed of 165 places in 480 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:39] [INFO ] Deduced a trap composed of 167 places in 494 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:40] [INFO ] Deduced a trap composed of 164 places in 629 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:41] [INFO ] Deduced a trap composed of 165 places in 417 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:41] [INFO ] Deduced a trap composed of 165 places in 456 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:42] [INFO ] Deduced a trap composed of 164 places in 602 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:42] [INFO ] Deduced a trap composed of 164 places in 386 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:43] [INFO ] Deduced a trap composed of 164 places in 434 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:43] [INFO ] Deduced a trap composed of 164 places in 354 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:43] [INFO ] Deduced a trap composed of 165 places in 268 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:44] [INFO ] Deduced a trap composed of 164 places in 533 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:45] [INFO ] Deduced a trap composed of 165 places in 459 ms of which 97 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/1113 variables, and 24 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/664 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Starting structural reductions in LTL mode, iteration 1 : 448/487 places, 665/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61498 ms. Remains : 448/487 places, 665/704 transitions.
[2025-06-05 15:51:47] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:51:47] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:51:47] [INFO ] Input system was already deterministic with 665 transitions.
[2025-06-05 15:51:47] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:51:47] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:51:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6308976841583312904.gal : 6 ms
[2025-06-05 15:51:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1512593669880346937.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/CTLFireability6308976841583312904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1512593669880346937.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.23127e+08,9.98196,211096,2,14684,5,623221,6,0,2459,921019,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:52:18] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:52:18] [INFO ] Applying decomposition
[2025-06-05 15:52:18] [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/graph16058631922791217452.txt' '-o' '/tmp/graph16058631922791217452.bin' '-w' '/tmp/graph16058631922791217452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16058631922791217452.bin' '-l' '-1' '-v' '-w' '/tmp/graph16058631922791217452.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:52:18] [INFO ] Decomposing Gal with order
[2025-06-05 15:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:52:18] [INFO ] Removed a total of 792 redundant transitions.
[2025-06-05 15:52:18] [INFO ] Flatten gal took : 42 ms
[2025-06-05 15:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2025-06-05 15:52:18] [INFO ] Time to serialize gal into /tmp/CTLFireability434014047370882463.gal : 7 ms
[2025-06-05 15:52:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7336065755384374765.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/CTLFireability434014047370882463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7336065755384374765.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 -...261
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.23127e+08,5.85612,180780,1754,21,321426,1405,987,922377,57,4882,0


Converting to forward existential form...Done !
original formula: A(A((((i21.i1.u133.p394==1) * EX((i12.i1.u48.p151==1))) + ((i6.i0.u2.p5==1) * ((i3.u72.p220==1) + EF((((i3.u29.p39==1)&&(i3.u56.p174==1))...537
=> equivalent forward existential formula: [((Init * !(EG(!((i24.i0.u143.p426==1))))) * !(E(!((i24.i0.u143.p426==1)) U (!(!((E(!((((!(E(TRUE U !(((((i22.i0...1361
Reverse transition relation is NOT exact ! Due to transitions t24, t61, t106, t140, t204, t239, t258, t304, t338, t356, t436, t438, t461, t463, t464, i3.t2...488
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 496 edges and 487 vertex of which 76 / 487 are part of one of the 12 SCC in 5 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 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 295 place count 422 transition count 337
Reduce places removed 294 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 302 rules applied. Total rules applied 597 place count 128 transition count 329
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 602 place count 124 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 123 transition count 328
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 603 place count 123 transition count 314
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 631 place count 109 transition count 314
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 644 place count 96 transition count 300
Iterating global reduction 4 with 13 rules applied. Total rules applied 657 place count 96 transition count 300
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 658 place count 96 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 659 place count 95 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 659 place count 95 transition count 297
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 663 place count 93 transition count 297
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 668 place count 88 transition count 258
Iterating global reduction 6 with 5 rules applied. Total rules applied 673 place count 88 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 675 place count 88 transition count 256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 676 place count 87 transition count 255
Iterating global reduction 7 with 1 rules applied. Total rules applied 677 place count 87 transition count 255
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 7 with 26 rules applied. Total rules applied 703 place count 74 transition count 242
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 716 place count 61 transition count 130
Iterating global reduction 7 with 13 rules applied. Total rules applied 729 place count 61 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 736 place count 61 transition count 123
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 739 place count 58 transition count 117
Iterating global reduction 8 with 3 rules applied. Total rules applied 742 place count 58 transition count 117
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 745 place count 55 transition count 114
Iterating global reduction 8 with 3 rules applied. Total rules applied 748 place count 55 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 752 place count 55 transition count 110
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 8 with 8 rules applied. Total rules applied 760 place count 51 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 762 place count 49 transition count 104
Applied a total of 762 rules in 51 ms. Remains 49 /487 variables (removed 438) and now considering 104/704 (removed 600) transitions.
[2025-06-05 15:52:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 49 cols
[2025-06-05 15:52:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 15:52:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-05 15:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:52:48] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:52:48] [INFO ] Redundant transitions in 4 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-05 15:52:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-05 15:52:48] [INFO ] Invariant cache hit.
[2025-06-05 15:52: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:52:49] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:49] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:49] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:49] [INFO ] Deduced a trap composed of 12 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:52:49] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:50] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:50] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:50] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/10 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:52:50] [INFO ] Deduced a trap composed of 18 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:52:50] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:50] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:50] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/147 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 14/77 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:52:52] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:52] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 2/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:52:53] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:53] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 1/148 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/148 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 82 constraints, problems are : Problem set: 0 solved, 95 unsolved in 10071 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: 16/16 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, 16/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/176 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 177 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8965 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: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19086ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 19087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/487 places, 104/704 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19362 ms. Remains : 49/487 places, 104/704 transitions.
[2025-06-05 15:53:07] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:53:07] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:53:07] [INFO ] Input system was already deterministic with 104 transitions.
RANDOM walk for 187 steps (16 resets) in 8 ms. (20 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 15:53:07] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:53:07] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:53:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10745024342900776964.gal : 1 ms
[2025-06-05 15:53:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2151980698163301711.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10745024342900776964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2151980698163301711.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 462 transition count 679
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 462 transition count 679
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 452 transition count 669
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 452 transition count 669
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 450 transition count 667
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 450 transition count 667
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 449 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 449 transition count 666
Applied a total of 76 rules in 61 ms. Remains 449 /487 variables (removed 38) and now considering 666/704 (removed 38) transitions.
// Phase 1: matrix 666 rows 449 cols
[2025-06-05 15:53:07] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:53:08] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-05 15:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:53:08] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2025-06-05 15:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:32] [INFO ] Deduced a trap composed of 163 places in 354 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:32] [INFO ] Deduced a trap composed of 163 places in 369 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:32] [INFO ] Deduced a trap composed of 164 places in 286 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:33] [INFO ] Deduced a trap composed of 164 places in 408 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:33] [INFO ] Deduced a trap composed of 164 places in 503 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:34] [INFO ] Deduced a trap composed of 164 places in 441 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:34] [INFO ] Deduced a trap composed of 164 places in 491 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:35] [INFO ] Deduced a trap composed of 165 places in 488 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:35] [INFO ] Deduced a trap composed of 166 places in 340 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:35] [INFO ] Deduced a trap composed of 164 places in 420 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:36] [INFO ] Deduced a trap composed of 165 places in 362 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:37] [INFO ] Deduced a trap composed of 164 places in 348 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:38] [INFO ] Deduced a trap composed of 164 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:53:39] [INFO ] Deduced a trap composed of 164 places in 447 ms of which 90 ms to minimize.
SMT process timed out in 30589ms, After SMT, problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 30593ms
Starting structural reductions in LTL mode, iteration 1 : 449/487 places, 666/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31703 ms. Remains : 449/487 places, 666/704 transitions.
[2025-06-05 15:53:39] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:53:39] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:53:39] [INFO ] Input system was already deterministic with 666 transitions.
[2025-06-05 15:53:39] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:53:39] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:53:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14534246722113011918.gal : 5 ms
[2025-06-05 15:53:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14779609115597893140.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/CTLFireability14534246722113011918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14779609115597893140.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.716e+08,11.9973,253592,2,21267,5,759399,6,0,2464,1.16039e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:54:09] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:54:09] [INFO ] Applying decomposition
[2025-06-05 15:54:09] [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/graph6288282036686167110.txt' '-o' '/tmp/graph6288282036686167110.bin' '-w' '/tmp/graph6288282036686167110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6288282036686167110.bin' '-l' '-1' '-v' '-w' '/tmp/graph6288282036686167110.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:54:09] [INFO ] Decomposing Gal with order
[2025-06-05 15:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:54:09] [INFO ] Removed a total of 797 redundant transitions.
[2025-06-05 15:54:09] [INFO ] Flatten gal took : 55 ms
[2025-06-05 15:54:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 15:54:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1087341728183873992.gal : 5 ms
[2025-06-05 15:54:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12465871039434753069.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/CTLFireability1087341728183873992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12465871039434753069.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.716e+08,6.21254,184596,2070,16,325318,974,922,968567,51,3251,0


Converting to forward existential form...Done !
original formula: EF((((EF((i29.u177.p533==1)) + AX(((i13.u51.p152==0) * EX((i6.u38.p107==1))))) + ((A(AG((((i3.u20.p99==1)&&(i3.u64.p234==1))&&((i3.u113.p...815
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * ((E(TRUE U (i29.u177.p533==1)) + !(EX(!(((i13.u51.p152==0) * EX((i6.u38.p107==1))))))...2849
Reverse transition relation is NOT exact ! Due to transitions t8, t62, t107, t141, t143, t160, t205, t239, t241, t258, t304, t305, t339, t341, t357, t403, ...509
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 490 edges and 487 vertex of which 76 / 487 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 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 289 place count 422 transition count 343
Reduce places removed 288 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 296 rules applied. Total rules applied 585 place count 134 transition count 335
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 591 place count 130 transition count 333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 593 place count 128 transition count 333
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 593 place count 128 transition count 318
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 623 place count 113 transition count 318
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 635 place count 101 transition count 305
Iterating global reduction 4 with 12 rules applied. Total rules applied 647 place count 101 transition count 305
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 648 place count 101 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 649 place count 100 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 649 place count 100 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 653 place count 98 transition count 302
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 657 place count 94 transition count 264
Iterating global reduction 6 with 4 rules applied. Total rules applied 661 place count 94 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 663 place count 94 transition count 262
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 664 place count 93 transition count 261
Iterating global reduction 7 with 1 rules applied. Total rules applied 665 place count 93 transition count 261
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 7 with 26 rules applied. Total rules applied 691 place count 80 transition count 248
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 700 place count 71 transition count 201
Iterating global reduction 7 with 9 rules applied. Total rules applied 709 place count 71 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 712 place count 71 transition count 198
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 715 place count 68 transition count 192
Iterating global reduction 8 with 3 rules applied. Total rules applied 718 place count 68 transition count 192
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 721 place count 65 transition count 189
Iterating global reduction 8 with 3 rules applied. Total rules applied 724 place count 65 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 728 place count 65 transition count 185
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 8 with 8 rules applied. Total rules applied 736 place count 61 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 738 place count 59 transition count 179
Applied a total of 738 rules in 56 ms. Remains 59 /487 variables (removed 428) and now considering 179/704 (removed 525) transitions.
[2025-06-05 15:54:39] [INFO ] Flow matrix only has 174 transitions (discarded 5 similar events)
// Phase 1: matrix 174 rows 59 cols
[2025-06-05 15:54:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-05 15:54:40] [INFO ] Flow matrix only has 174 transitions (discarded 5 similar events)
[2025-06-05 15:54:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:54:40] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:54:40] [INFO ] Redundant transitions in 12 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-05 15:54:40] [INFO ] Flow matrix only has 174 transitions (discarded 5 similar events)
[2025-06-05 15:54:40] [INFO ] Invariant cache hit.
[2025-06-05 15:54:40] [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/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:42] [INFO ] Deduced a trap composed of 14 places in 94 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:42] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:42] [INFO ] Deduced a trap composed of 15 places in 86 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:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:42] [INFO ] Deduced a trap composed of 14 places in 90 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:42] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:42] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:42] [INFO ] Deduced a trap composed of 23 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:54:43] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:44] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:44] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:44] [INFO ] Deduced a trap composed of 26 places in 110 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:45] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 173/232 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:47] [INFO ] Deduced a trap composed of 25 places in 100 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:48] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:50] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 1/233 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 0/233 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 92 constraints, problems are : Problem set: 0 solved, 170 unsolved in 18804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 173/232 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 170/261 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 1/233 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:13] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:55:18] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 264 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48951ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 48952ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/487 places, 179/704 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49226 ms. Remains : 59/487 places, 179/704 transitions.
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:55:29] [INFO ] Input system was already deterministic with 179 transitions.
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:55:29] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:55:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9887140872993450028.gal : 3 ms
[2025-06-05 15:55:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2822131182281154425.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/CTLFireability9887140872993450028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2822131182281154425.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,59576,0.682931,15236,2,2975,5,32231,6,0,407,35538,0


Converting to forward existential form...Done !
original formula: !(E((!(AG((p109!=1))) + EF((p354==1))) U (((p86==1)&&(p234==1))&&((p369==1)&&(p504==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(!(!(E(TRUE U !((p109!=1))))) + E(TRUE U (p354==1)))) * (((p86==1)&&(p234==1))&&((p369==1)&&(p504==1...168
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t9, t10, t12, t13, t16, t40, t51, t52, t61, t62, t63, t76, t81, t82, t89, t90, t100, ...279
(forward)formula 0,0,9.59682,200072,1,0,387,918452,380,230,4620,697735,495
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 463 transition count 680
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 463 transition count 680
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 451 transition count 668
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 451 transition count 668
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 448 transition count 665
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 447 transition count 664
Applied a total of 80 rules in 52 ms. Remains 447 /487 variables (removed 40) and now considering 664/704 (removed 40) transitions.
// Phase 1: matrix 664 rows 447 cols
[2025-06-05 15:55:38] [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:39] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-05 15:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:39] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Running 663 sub problems to find dead transitions.
[2025-06-05 15:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:56:10] [INFO ] Deduced a trap composed of 162 places in 565 ms of which 114 ms to minimize.
SMT process timed out in 30712ms, After SMT, problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 30717ms
Starting structural reductions in LTL mode, iteration 1 : 447/487 places, 664/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31695 ms. Remains : 447/487 places, 664/704 transitions.
[2025-06-05 15:56:10] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:56:10] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:56:10] [INFO ] Input system was already deterministic with 664 transitions.
[2025-06-05 15:56:10] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:56:10] [INFO ] Flatten gal took : 35 ms
[2025-06-05 15:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4009157974277769660.gal : 6 ms
[2025-06-05 15:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4423392114749093848.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/CTLFireability4009157974277769660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4423392114749093848.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.16715e+08,10.9479,230532,2,13931,5,663418,6,0,2454,987573,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 15:56:40] [INFO ] Flatten gal took : 16 ms
[2025-06-05 15:56:40] [INFO ] Applying decomposition
[2025-06-05 15:56:40] [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/graph14578693652965366271.txt' '-o' '/tmp/graph14578693652965366271.bin' '-w' '/tmp/graph14578693652965366271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14578693652965366271.bin' '-l' '-1' '-v' '-w' '/tmp/graph14578693652965366271.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:56:40] [INFO ] Decomposing Gal with order
[2025-06-05 15:56:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:56:40] [INFO ] Removed a total of 797 redundant transitions.
[2025-06-05 15:56:40] [INFO ] Flatten gal took : 44 ms
[2025-06-05 15:56:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2025-06-05 15:56:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3890446006192964630.gal : 10 ms
[2025-06-05 15:56:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10184908849976478967.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/CTLFireability3890446006192964630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10184908849976478967.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.16715e+08,12.803,332212,1946,15,602930,1134,893,1.66821e+06,45,4049,0


Converting to forward existential form...Done !
original formula: EX(E((EF((i13.i0.i1.u48.p155==1)) + A(AG((((i8.u5.p52==1)&&(i8.u47.p187==1))&&((i8.u101.p309==1)&&(i8.u136.p444==1)))) U ((i8.u54.p161==1...332
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(Init),(E(TRUE U (i13.i0.i1.u48.p155==1)) + !((E(!(((i8.u54.p161==1)&&(i29.u183.p546==1))) U (!(!...906
Reverse transition relation is NOT exact ! Due to transitions t59, t105, t141, t160, t239, t241, t258, t303, t338, t340, t356, t402, t436, t459, t461, t463...472
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 479 edges and 487 vertex of which 76 / 487 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 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 281 place count 422 transition count 351
Reduce places removed 280 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 288 rules applied. Total rules applied 569 place count 142 transition count 343
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 576 place count 138 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 579 place count 135 transition count 340
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 579 place count 135 transition count 326
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 607 place count 121 transition count 326
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 619 place count 109 transition count 313
Iterating global reduction 4 with 12 rules applied. Total rules applied 631 place count 109 transition count 313
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 632 place count 109 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 633 place count 108 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 633 place count 108 transition count 310
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 637 place count 106 transition count 310
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 641 place count 102 transition count 272
Iterating global reduction 6 with 4 rules applied. Total rules applied 645 place count 102 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 647 place count 102 transition count 270
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 648 place count 101 transition count 269
Iterating global reduction 7 with 1 rules applied. Total rules applied 649 place count 101 transition count 269
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 7 with 26 rules applied. Total rules applied 675 place count 88 transition count 256
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 684 place count 79 transition count 209
Iterating global reduction 7 with 9 rules applied. Total rules applied 693 place count 79 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 696 place count 79 transition count 206
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 698 place count 77 transition count 202
Iterating global reduction 8 with 2 rules applied. Total rules applied 700 place count 77 transition count 202
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 702 place count 75 transition count 200
Iterating global reduction 8 with 2 rules applied. Total rules applied 704 place count 75 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 709 place count 75 transition count 195
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 8 with 8 rules applied. Total rules applied 717 place count 71 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 719 place count 69 transition count 189
Applied a total of 719 rules in 49 ms. Remains 69 /487 variables (removed 418) and now considering 189/704 (removed 515) transitions.
[2025-06-05 15:57:11] [INFO ] Flow matrix only has 184 transitions (discarded 5 similar events)
// Phase 1: matrix 184 rows 69 cols
[2025-06-05 15:57:11] [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:11] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-05 15:57:11] [INFO ] Flow matrix only has 184 transitions (discarded 5 similar events)
[2025-06-05 15:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:57:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:57:11] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:57:11] [INFO ] Redundant transitions in 22 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-05 15:57:11] [INFO ] Flow matrix only has 184 transitions (discarded 5 similar events)
[2025-06-05 15:57:11] [INFO ] Invariant cache hit.
[2025-06-05 15:57:11] [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/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:13] [INFO ] Deduced a trap composed of 15 places in 123 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:13] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:13] [INFO ] Deduced a trap composed of 16 places in 115 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:13] [INFO ] Deduced a trap composed of 28 places in 127 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:14] [INFO ] Deduced a trap composed of 29 places in 106 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 19 places in 91 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:14] [INFO ] Deduced a trap composed of 27 places in 89 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:14] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:14] [INFO ] Deduced a trap composed of 27 places in 112 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:15] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
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 121 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:16] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 9 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 27 places in 108 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 28 places in 110 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 180 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 30 places in 113 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:17] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 183/252 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 14/101 constraints. Problems are: Problem set: 0 solved, 180 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 25 places in 97 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:24] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:24] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 1/253 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:57:31] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/253 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 253/253 variables, and 106 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 183/252 variables, 69/91 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 180/285 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 1/253 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 286 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/487 places, 189/704 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60479 ms. Remains : 69/487 places, 189/704 transitions.
[2025-06-05 15:58:11] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:58:11] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:58:11] [INFO ] Input system was already deterministic with 189 transitions.
[2025-06-05 15:58:11] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:58:11] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:58:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9624080116533907473.gal : 2 ms
[2025-06-05 15:58:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4925408902886012081.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/CTLFireability9624080116533907473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4925408902886012081.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,111140,0.463617,16800,2,3239,5,38611,6,0,457,38435,0


Converting to forward existential form...Done !
original formula: AF(EG((A((p476==1) U (p80==1)) * ((AF((p524==1)) + E((((p99==1)&&(p234==1))&&((p356==1)&&(p491==1))) U (((p99==1)&&(p209==1))&&((p369==1)...239
=> equivalent forward existential formula: [FwdG(Init,!(EG((!((E(!((p80==1)) U (!((p476==1)) * !((p80==1)))) + EG(!((p80==1))))) * ((!(EG(!((p524==1)))) + ...335
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t13, t17, t18, t22, t50, t51, t61, t62, t71, t72, t73, t86, t91, t92, t99, t100, t11...282
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,18.0012,422556,1,0,843,2.39235e+06,425,461,4947,1.72936e+06,1021
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 488 edges and 487 vertex of which 73 / 487 are part of one of the 11 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 289 place count 424 transition count 345
Reduce places removed 288 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 296 rules applied. Total rules applied 585 place count 136 transition count 337
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 590 place count 132 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 131 transition count 336
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 591 place count 131 transition count 321
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 621 place count 116 transition count 321
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 633 place count 104 transition count 308
Iterating global reduction 4 with 12 rules applied. Total rules applied 645 place count 104 transition count 308
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 646 place count 104 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 647 place count 103 transition count 307
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 647 place count 103 transition count 305
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 651 place count 101 transition count 305
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 656 place count 96 transition count 266
Iterating global reduction 6 with 5 rules applied. Total rules applied 661 place count 96 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 663 place count 96 transition count 264
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 664 place count 95 transition count 263
Iterating global reduction 7 with 1 rules applied. Total rules applied 665 place count 95 transition count 263
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 7 with 26 rules applied. Total rules applied 691 place count 82 transition count 250
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 703 place count 70 transition count 146
Iterating global reduction 7 with 12 rules applied. Total rules applied 715 place count 70 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 720 place count 70 transition count 141
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 723 place count 67 transition count 135
Iterating global reduction 8 with 3 rules applied. Total rules applied 726 place count 67 transition count 135
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 729 place count 64 transition count 132
Iterating global reduction 8 with 3 rules applied. Total rules applied 732 place count 64 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 736 place count 64 transition count 128
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 8 with 8 rules applied. Total rules applied 744 place count 60 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 746 place count 58 transition count 122
Applied a total of 746 rules in 30 ms. Remains 58 /487 variables (removed 429) and now considering 122/704 (removed 582) transitions.
[2025-06-05 15:58:29] [INFO ] Flow matrix only has 117 transitions (discarded 5 similar events)
// Phase 1: matrix 117 rows 58 cols
[2025-06-05 15:58:29] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 15:58:29] [INFO ] Flow matrix only has 117 transitions (discarded 5 similar events)
[2025-06-05 15:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:58:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:58:29] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:58:29] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-05 15:58:29] [INFO ] Flow matrix only has 117 transitions (discarded 5 similar events)
[2025-06-05 15:58:29] [INFO ] Invariant cache hit.
[2025-06-05 15:58:29] [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/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 4/58 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 23 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:58:31] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:31] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 116/174 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:33] [INFO ] Deduced a trap composed of 24 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:58:34] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:35] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:35] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/175 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 88 constraints, problems are : Problem set: 0 solved, 113 unsolved in 12453 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 4/58 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 116/174 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 113/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:58:49] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 202 constraints, problems are : Problem set: 0 solved, 113 unsolved in 15488 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27982ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 27984ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/487 places, 122/704 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28228 ms. Remains : 58/487 places, 122/704 transitions.
[2025-06-05 15:58:57] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:58:57] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:58:57] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-05 15:58:57] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:58:57] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:58:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15197064775443893754.gal : 1 ms
[2025-06-05 15:58:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7070259899125057844.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/CTLFireability15197064775443893754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7070259899125057844.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,54408,0.308679,9996,2,2407,5,22475,6,0,346,21142,0


Converting to forward existential form...Done !
original formula: A((p237==1) U !((!(EF((p188==1))) + EF(((p35==1)||(((p74==1)&&(p209==1))&&((p356==1)&&(p479==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U (p188==1))) + E(TRUE U ((p35==1)||(((p74==1)&&(p209==1))&&((p356==1)&&(p479==1)))...407
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t8, t9, t11, t17, t18, t50, t52, t53, t62, t63, t64, t76, t77, t78, t79, t80, t85, t8...275
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.9484,272352,1,0,491,1.66512e+06,270,274,3399,1.07716e+06,545
FORMULA StigmergyElection-PT-04b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Graph (trivial) has 496 edges and 487 vertex of which 74 / 487 are part of one of the 12 SCC in 1 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 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 424 transition count 337
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 127 transition count 329
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 607 place count 123 transition count 329
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 607 place count 123 transition count 315
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 635 place count 109 transition count 315
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 648 place count 96 transition count 301
Iterating global reduction 3 with 13 rules applied. Total rules applied 661 place count 96 transition count 301
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 662 place count 96 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 95 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 663 place count 95 transition count 298
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 667 place count 93 transition count 298
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 672 place count 88 transition count 259
Iterating global reduction 5 with 5 rules applied. Total rules applied 677 place count 88 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 679 place count 88 transition count 257
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 680 place count 87 transition count 256
Iterating global reduction 6 with 1 rules applied. Total rules applied 681 place count 87 transition count 256
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 707 place count 74 transition count 243
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 719 place count 62 transition count 133
Iterating global reduction 6 with 12 rules applied. Total rules applied 731 place count 62 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 738 place count 62 transition count 126
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 740 place count 60 transition count 122
Iterating global reduction 7 with 2 rules applied. Total rules applied 742 place count 60 transition count 122
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 744 place count 58 transition count 120
Iterating global reduction 7 with 2 rules applied. Total rules applied 746 place count 58 transition count 120
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 751 place count 58 transition count 115
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 761 place count 53 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 763 place count 51 transition count 108
Applied a total of 763 rules in 28 ms. Remains 51 /487 variables (removed 436) and now considering 108/704 (removed 596) transitions.
[2025-06-05 15:59:09] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
// Phase 1: matrix 102 rows 51 cols
[2025-06-05 15:59:09] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 15:59:09] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
[2025-06-05 15:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 15:59:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:59:09] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2025-06-05 15:59:09] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
[2025-06-05 15:59:09] [INFO ] Invariant cache hit.
[2025-06-05 15:59:09] [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/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:09] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:09] [INFO ] Deduced a trap composed of 16 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:59:10] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:10] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:10] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:10] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:10] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:10] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:11] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:11] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:11] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:11] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 101/152 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/153 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 80 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 101/152 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 99/178 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/153 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 179 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18424ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 18425ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/487 places, 108/704 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18642 ms. Remains : 51/487 places, 108/704 transitions.
[2025-06-05 15:59:27] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:59:27] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:59:27] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-05 15:59:27] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:59:27] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4459600658827796956.gal : 1 ms
[2025-06-05 15:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3081061888999876207.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/CTLFireability4459600658827796956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3081061888999876207.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,26208,0.140345,8540,2,2005,5,15032,6,0,303,16328,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((p330==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((p330==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t8, t11, t12, t13, t14, t15, t46, t47, t48, t56, t57, t58, t69, t70, t71, t72, t7...285
(forward)formula 0,1,2.28058,64076,1,0,365,316469,236,167,2823,267935,397
FORMULA StigmergyElection-PT-04b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 463 transition count 680
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 463 transition count 680
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 451 transition count 668
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 451 transition count 668
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 447 transition count 664
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 446 transition count 663
Applied a total of 82 rules in 44 ms. Remains 446 /487 variables (removed 41) and now considering 663/704 (removed 41) transitions.
// Phase 1: matrix 663 rows 446 cols
[2025-06-05 15:59:30] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:30] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-05 15:59:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:59:30] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 662 sub problems to find dead transitions.
[2025-06-05 15:59:30] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:57] [INFO ] Deduced a trap composed of 163 places in 365 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:57] [INFO ] Deduced a trap composed of 164 places in 316 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:59] [INFO ] Deduced a trap composed of 163 places in 480 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:59:59] [INFO ] Deduced a trap composed of 164 places in 495 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:00] [INFO ] Deduced a trap composed of 165 places in 355 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:00:01] [INFO ] Deduced a trap composed of 164 places in 484 ms of which 122 ms to minimize.
SMT process timed out in 30489ms, After SMT, problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 30492ms
Starting structural reductions in LTL mode, iteration 1 : 446/487 places, 663/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31252 ms. Remains : 446/487 places, 663/704 transitions.
[2025-06-05 16:00:01] [INFO ] Flatten gal took : 23 ms
[2025-06-05 16:00:01] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:00:01] [INFO ] Input system was already deterministic with 663 transitions.
[2025-06-05 16:00:01] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:00:01] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:00:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13963532919076305524.gal : 5 ms
[2025-06-05 16:00:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9336772586600910146.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/CTLFireability13963532919076305524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9336772586600910146.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.09732e+08,10.6047,216688,2,15062,5,651268,6,0,2449,944955,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 16:00:31] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:00:31] [INFO ] Applying decomposition
[2025-06-05 16:00:31] [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/graph5515130307374628419.txt' '-o' '/tmp/graph5515130307374628419.bin' '-w' '/tmp/graph5515130307374628419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5515130307374628419.bin' '-l' '-1' '-v' '-w' '/tmp/graph5515130307374628419.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:00:31] [INFO ] Decomposing Gal with order
[2025-06-05 16:00:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:00:31] [INFO ] Removed a total of 794 redundant transitions.
[2025-06-05 16:00:31] [INFO ] Flatten gal took : 55 ms
[2025-06-05 16:00:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2025-06-05 16:00:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14174611849208802127.gal : 9 ms
[2025-06-05 16:00:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2155194053380034357.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/CTLFireability14174611849208802127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2155194053380034357.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.09732e+08,7.28628,199688,1983,17,380798,1131,922,959174,47,4460,0


Converting to forward existential form...Done !
original formula: ((AF(((i4.u28.p84==1) + ((AX(((i8.i0.i0.u47.p140==1)&&(i2.u13.p36==1))) * (((i1.u3.p39==0)||(i1.u48.p187==0))||((i1.u98.p297==0)||(i1.u14...829
=> equivalent forward existential formula: ([FwdG((Init * !((E(TRUE U (i19.u118.p358==1)) * EX(EX(TRUE))))),!(((i4.u28.p84==1) + ((!(EX(!(((i8.i0.i0.u47.p1...1560
Reverse transition relation is NOT exact ! Due to transitions t60, t105, t139, t158, t237, t239, t257, t339, t355, t434, t436, t457, t461, t462, i0.t399, i...468
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 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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 704/704 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 460 transition count 677
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 460 transition count 677
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 447 transition count 664
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 447 transition count 664
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 443 transition count 660
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 442 transition count 659
Applied a total of 90 rules in 62 ms. Remains 442 /487 variables (removed 45) and now considering 659/704 (removed 45) transitions.
// Phase 1: matrix 659 rows 442 cols
[2025-06-05 16:01:01] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:01:02] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-05 16:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:01:02] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 16:01: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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:29] [INFO ] Deduced a trap composed of 162 places in 570 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:29] [INFO ] Deduced a trap composed of 162 places in 254 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:30] [INFO ] Deduced a trap composed of 163 places in 395 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:30] [INFO ] Deduced a trap composed of 164 places in 384 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:31] [INFO ] Deduced a trap composed of 163 places in 378 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:32] [INFO ] Deduced a trap composed of 163 places in 466 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:01:33] [INFO ] Deduced a trap composed of 163 places in 332 ms of which 22 ms to minimize.
SMT process timed out in 30328ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 30329ms
Starting structural reductions in LTL mode, iteration 1 : 442/487 places, 659/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31206 ms. Remains : 442/487 places, 659/704 transitions.
[2025-06-05 16:01:33] [INFO ] Flatten gal took : 24 ms
[2025-06-05 16:01:33] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:01:33] [INFO ] Input system was already deterministic with 659 transitions.
[2025-06-05 16:01:33] [INFO ] Flatten gal took : 24 ms
[2025-06-05 16:01:33] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:01:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11956582185025995372.gal : 6 ms
[2025-06-05 16:01:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5761291133023617551.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/CTLFireability11956582185025995372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5761291133023617551.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.7087,210192,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 16:02:03] [INFO ] Flatten gal took : 24 ms
[2025-06-05 16:02:03] [INFO ] Applying decomposition
[2025-06-05 16:02:03] [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/graph10497096385191393581.txt' '-o' '/tmp/graph10497096385191393581.bin' '-w' '/tmp/graph10497096385191393581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10497096385191393581.bin' '-l' '-1' '-v' '-w' '/tmp/graph10497096385191393581.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:02:03] [INFO ] Decomposing Gal with order
[2025-06-05 16:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:02:03] [INFO ] Removed a total of 793 redundant transitions.
[2025-06-05 16:02:03] [INFO ] Flatten gal took : 36 ms
[2025-06-05 16:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-06-05 16:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3494630804065470070.gal : 7 ms
[2025-06-05 16:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability30035776330923163.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/CTLFireability3494630804065470070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability30035776330923163.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 -...260
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,4.70074,137592,1566,13,242414,715,947,697503,44,2472,0


Converting to forward existential form...Done !
original formula: AX(EF((AF((i2.i0.u9.p31==1)) + ((EG((i29.i1.u181.p556==1)) * (i2.i0.u9.p31==1)) * (i26.u164.p501==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(EG(!((i2.i0.u9.p31==1)))) + ((EG((i29.i1.u181.p556==1)) * (i2.i0.u9.p31==1)) * (i26.u...181
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t140, t157, t236, t238, t255, t334, t336, t352, t397, t431, t454, t456, t458...479
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 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 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
Detected timeout of ITS tools.
[2025-06-05 16:02:33] [INFO ] Flatten gal took : 16 ms
[2025-06-05 16:02:33] [INFO ] Flatten gal took : 15 ms
[2025-06-05 16:02:33] [INFO ] Applying decomposition
[2025-06-05 16:02:33] [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/graph5323866202563043928.txt' '-o' '/tmp/graph5323866202563043928.bin' '-w' '/tmp/graph5323866202563043928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5323866202563043928.bin' '-l' '-1' '-v' '-w' '/tmp/graph5323866202563043928.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:02:33] [INFO ] Decomposing Gal with order
[2025-06-05 16:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:02:33] [INFO ] Removed a total of 804 redundant transitions.
[2025-06-05 16:02:33] [INFO ] Flatten gal took : 36 ms
[2025-06-05 16:02:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-05 16:02:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12871238793284542503.gal : 6 ms
[2025-06-05 16:02:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15111571819773922243.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/CTLFireability12871238793284542503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15111571819773922243.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 8 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.08819e+09,16.6822,435740,2706,24,661578,1089,950,2.88261e+06,50,3744,0


Converting to forward existential form...Done !
original formula: EG((((EG((i3.i1.i1.u24.p70==0)) + (i17.u117.p312==0)) + ((i14.u56.p158==1)||(i3.i0.i1.u2.p22==0))) + ((i15.u96.p264==0) * (EX((((i0.u14.p...317
=> equivalent forward existential formula: [FwdG(Init,(((EG((i3.i1.i1.u24.p70==0)) + (i17.u117.p312==0)) + ((i14.u56.p158==1)||(i3.i0.i1.u2.p22==0))) + ((i...360
Reverse transition relation is NOT exact ! Due to transitions t8, t27, t118, t119, t124, t156, t158, t159, t225, t226, t261, t263, t281, t330, t368, t370, ...562
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
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
(forward)formula 0,1,876.577,4895256,1,0,3.6707e+06,1089,2448,5.27414e+07,94,4728,563203
FORMULA StigmergyElection-PT-04b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-05 16:28:40] [INFO ] Applying decomposition
[2025-06-05 16:28:40] [INFO ] Flatten gal took : 20 ms
[2025-06-05 16:28:40] [INFO ] Decomposing Gal with order
[2025-06-05 16:28:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:28:40] [INFO ] Removed a total of 709 redundant transitions.
[2025-06-05 16:28:40] [INFO ] Flatten gal took : 41 ms
[2025-06-05 16:28:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 5 ms.
[2025-06-05 16:28:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11240782497028498641.gal : 4 ms
[2025-06-05 16:28:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17980798076264560902.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/CTLFireability11240782497028498641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17980798076264560902.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 7 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.08819e+09,1.14646,30432,290,6094,5132,55164,139,18428,984,322547,0


Converting to forward existential form...Done !
original formula: EG(((AF(E((i0.i0.i0.u4.p48!=1) U EX((i0.i0.i0.u4.p12==1)))) + (i0.i0.i0.u5.p257==0)) * (((EG(((i0.i0.u6.p328==1)&&(i0.i0.i0.u5.p236==1)))...826
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(E((i0.i0.i0.u4.p48!=1) U EX((i0.i0.i0.u4.p12==1)))))) + (i0.i0.i0.u5.p257==0)) * (((EG(((i0....964
Reverse transition relation is NOT exact ! Due to transitions t499, u8.t38, u8.t40, u8.t47, u8.t54, i0.u7.t36, i0.u7.t68, i0.u7.t69, i0.u7.t79, i0.u7.t86, ...826
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-04b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-04b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490900202"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;