Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074400746.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HirschbergSinclair-PT-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400746
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 173K Mar 3 18:30 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 HirschbergSinclair-PT-15-CTLFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-15-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779750789782

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 23:13:10] [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]
[2026-05-25 23:13:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:13:11] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-25 23:13:11] [INFO ] Transformed 330 places.
[2026-05-25 23:13:11] [INFO ] Transformed 296 transitions.
[2026-05-25 23:13:11] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 97 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 24 place count 306 transition count 287
Iterating global reduction 1 with 9 rules applied. Total rules applied 33 place count 306 transition count 287
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 301 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 301 transition count 282
Applied a total of 43 rules in 72 ms. Remains 301 /330 variables (removed 29) and now considering 282/296 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-311782679922267548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12099465868579239032.kers'
[2026-05-25 23:13:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-311782679922267548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12099465868579239032.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 301 cols 845 entries
Finished phase 1 with 278 SingleSign rule and 4 generalized
[2026-05-25 23:13:11] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12099465868579239032.kers
Total runtime 2 ms.
[2026-05-25 23:13:11] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-25 23:13:11] [INFO ] Invariant cache hit.
[2026-05-25 23:13:12] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-25 23:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 15/301 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 282/583 variables, 301/320 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 320 constraints, problems are : Problem set: 0 solved, 267 unsolved in 29527 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 15/301 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 282/583 variables, 301/320 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 267/587 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 587 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59657ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 59675ms
Starting structural reductions in LTL mode, iteration 1 : 301/330 places, 282/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 301/330 places, 282/296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2026-05-25 23:14:11] [INFO ] Invariant cache hit.
[2026-05-25 23:14:12] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-25 23:14:12] [INFO ] Invariant cache hit.
[2026-05-25 23:14:12] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 301/301 places, 282/282 transitions.
Support contains 97 out of 301 places after structural reductions.
[2026-05-25 23:14:12] [INFO ] Flatten gal took : 57 ms
[2026-05-25 23:14:12] [INFO ] Flatten gal took : 22 ms
[2026-05-25 23:14:12] [INFO ] Input system was already deterministic with 282 transitions.
RANDOM walk for 40000 steps (132 resets) in 1322 ms. (30 steps per ms) remains 4/64 properties
BEST_FIRST walk for 40004 steps (19 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (18 resets) in 126 ms. (314 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 116 ms. (341 steps per ms) remains 2/3 properties
[2026-05-25 23:14:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 250/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/265 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (OVERLAPS) 282/547 variables, 265/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/583 variables, 36/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/583 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 320 constraints, problems are : Problem set: 1 solved, 1 unsolved in 348 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/196 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/265 variables, 14/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/547 variables, 265/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/583 variables, 36/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/583 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 321 constraints, problems are : Problem set: 1 solved, 1 unsolved in 391 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 744ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 282/282 transitions.
Graph (complete) has 562 edges and 301 vertex of which 290 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 290 transition count 163
Reduce places removed 108 places and 0 transitions.
Graph (complete) has 310 edges and 182 vertex of which 160 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 109 rules applied. Total rules applied 229 place count 160 transition count 163
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 251 place count 160 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 257 place count 154 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 263 place count 154 transition count 135
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 3 with 4 rules applied. Total rules applied 267 place count 154 transition count 131
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 255 edges and 150 vertex of which 144 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 272 place count 144 transition count 131
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 278 place count 144 transition count 125
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 280 place count 142 transition count 123
Iterating global reduction 6 with 2 rules applied. Total rules applied 282 place count 142 transition count 123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 141 transition count 122
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 141 transition count 122
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 288 place count 141 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 292 place count 137 transition count 118
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 305 place count 124 transition count 105
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 7 with 41 rules applied. Total rules applied 346 place count 115 transition count 73
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 378 place count 83 transition count 73
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 19 Pre rules applied. Total rules applied 378 place count 83 transition count 54
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 416 place count 64 transition count 54
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 417 place count 63 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 417 place count 63 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 419 place count 62 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 425 place count 59 transition count 50
Applied a total of 425 rules in 69 ms. Remains 59 /301 variables (removed 242) and now considering 50/282 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 59/301 places, 50/282 transitions.
RANDOM walk for 40000 steps (748 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (272 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1083 states, properties seen :0
Probabilistic random walk after 3585 steps, saw 1083 distinct states, run finished after 14 ms. (steps per millisecond=256 ) properties seen :0
Explored full state space saw : 1083 states, properties seen :0
Exhaustive walk after 3585 steps, saw 1083 distinct states, run finished after 6 ms. (steps per millisecond=597 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-25 23:14:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 23:14:14] [INFO ] Flatten gal took : 17 ms
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 23:14:14] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:14:14] [INFO ] Input system was already deterministic with 282 transitions.
Support contains 81 out of 301 places (down from 93) after GAL structural reductions.
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 301 stabilizing places and 282 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 282
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 286 transition count 150
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 169 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 244 place count 159 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 254 place count 159 transition count 140
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 2 with 4 rules applied. Total rules applied 258 place count 159 transition count 136
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 262 place count 155 transition count 136
Applied a total of 262 rules in 21 ms. Remains 155 /301 variables (removed 146) and now considering 136/282 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3697034810988727349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10621627681350325638.kers'
[2026-05-25 23:14:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3697034810988727349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10621627681350325638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 155 cols 282 entries
Finished phase 1 with 132 SingleSign rule and 4 generalized
[2026-05-25 23:14:14] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10621627681350325638.kers
Total runtime 2 ms.
[2026-05-25 23:14:14] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 23:14:14] [INFO ] Invariant cache hit.
[2026-05-25 23:14:15] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2026-05-25 23:14:15] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-25 23:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 110/238 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 3/241 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/291 variables, and 149 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6327 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 110/238 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 97/244 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 3/241 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 10/256 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/291 variables, and 256 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14259 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/155 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20595ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 20596ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/301 places, 136/282 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21155 ms. Remains : 155/301 places, 136/282 transitions.
[2026-05-25 23:14:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:14:35] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:14:35] [INFO ] Input system was already deterministic with 136 transitions.
[2026-05-25 23:14:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:14:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:14:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11681308505740014006.gal : 3 ms
[2026-05-25 23:14:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14963660904271077234.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11681308505740014006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14963660904271077234.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,5.5979e+12,0.098119,7636,2,2434,5,16199,6,0,729,12839,0


Converting to forward existential form...Done !
original formula: EG((rcv_right_election_2_0_1_1<1))
=> equivalent forward existential formula: [FwdG(Init,(rcv_right_election_2_0_1_1<1))] != FALSE
Hit Full ! (commute/partial/dont) 134/0/2
(forward)formula 0,1,2.51424,96984,1,0,161,462922,18,4,3704,364606,158
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 286 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 286 transition count 267
Applied a total of 30 rules in 27 ms. Remains 286 /301 variables (removed 15) and now considering 267/282 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-48744448759443612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8393543394687364876.kers'
[2026-05-25 23:14:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-48744448759443612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8393543394687364876.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 286 cols 805 entries
Finished phase 1 with 263 SingleSign rule and 4 generalized
[2026-05-25 23:14:38] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8393543394687364876.kers
Total runtime 1 ms.
[2026-05-25 23:14:38] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-25 23:14:38] [INFO ] Invariant cache hit.
[2026-05-25 23:14:40] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 23:14:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 26845 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56888ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 56891ms
Starting structural reductions in LTL mode, iteration 1 : 286/301 places, 267/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58603 ms. Remains : 286/301 places, 267/282 transitions.
[2026-05-25 23:15:37] [INFO ] Flatten gal took : 12 ms
[2026-05-25 23:15:37] [INFO ] Flatten gal took : 12 ms
[2026-05-25 23:15:37] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-25 23:15:37] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:15:37] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:15:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5818112473353695426.gal : 3 ms
[2026-05-25 23:15:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12039794863774369042.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5818112473353695426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12039794863774369042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07539e+17,0.793816,32356,2,25559,5,111735,6,0,1399,115129,0


Converting to forward existential form...Done !
original formula: (AG((AF(((init1<1)&&((newmsg10<1)||(reply_15_3_to_right_9<1)))) + A(((newmsg15>=1)&&(election_1_0_1_to_left_1>=1)) U AF(((newmsg11>=1)&&(...240
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(((newmsg11>=1)&&(elected_15_to_left_12>=1)))))) U (!(((newmsg15>=1)&&(...458
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t24...390
Detected timeout of ITS tools.
[2026-05-25 23:16:07] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:16:07] [INFO ] Applying decomposition
[2026-05-25 23:16:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15153184178182955353.txt' '-o' '/tmp/graph15153184178182955353.bin' '-w' '/tmp/graph15153184178182955353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15153184178182955353.bin' '-l' '-1' '-v' '-w' '/tmp/graph15153184178182955353.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:16:07] [INFO ] Decomposing Gal with order
[2026-05-25 23:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:16:07] [INFO ] Removed a total of 27 redundant transitions.
[2026-05-25 23:16:07] [INFO ] Flatten gal took : 69 ms
[2026-05-25 23:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-25 23:16:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7725059977868530975.gal : 7 ms
[2026-05-25 23:16:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10882051965207152414.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7725059977868530975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10882051965207152414.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07539e+17,1.95558,70548,2732,3621,89007,60765,764,201248,270,315183,0


Converting to forward existential form...Done !
original formula: (AG((AF(((i7.u1.init1<1)&&((i8.u15.newmsg10<1)||(i8.u15.reply_15_3_to_right_9<1)))) + A(((i0.u11.newmsg15>=1)&&(i0.u11.election_1_0_1_to_...301
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(((i5.u8.newmsg11>=1)&&(i5.u31.elected_15_to_left_12>=1)))))) U (!(((i0...545
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t9, t10, t12, t13, t14, t20, t32, t221, t266, i0.u11.t15, i0.u11....584
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 292 transition count 205
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 224 transition count 205
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 144 place count 216 transition count 197
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 216 transition count 197
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 154 place count 216 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 214 transition count 195
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 212 transition count 193
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 212 transition count 193
Applied a total of 160 rules in 41 ms. Remains 212 /301 variables (removed 89) and now considering 193/282 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16572102491566476973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5872271691122169144.kers'
[2026-05-25 23:16:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16572102491566476973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5872271691122169144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 212 cols 506 entries
Finished phase 1 with 189 SingleSign rule and 4 generalized
[2026-05-25 23:16:37] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5872271691122169144.kers
Total runtime 1 ms.
[2026-05-25 23:16:37] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-25 23:16:37] [INFO ] Invariant cache hit.
[2026-05-25 23:16:38] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2026-05-25 23:16:38] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-25 23:16:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 7/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 182/383 variables, 201/220 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 2/385 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/405 variables, and 221 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14710 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 202/212 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 7/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 182/383 variables, 201/220 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 163/383 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 2/385 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/405 variables, and 396 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 202/212 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44743ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44744ms
Starting structural reductions in SI_CTL mode, iteration 1 : 212/301 places, 193/282 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45476 ms. Remains : 212/301 places, 193/282 transitions.
[2026-05-25 23:17:23] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:17:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:17:23] [INFO ] Input system was already deterministic with 193 transitions.
[2026-05-25 23:17:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:17:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:17:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2210512754716962623.gal : 2 ms
[2026-05-25 23:17:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3477965859038013619.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2210512754716962623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3477965859038013619.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.76509e+14,0.19139,12640,2,6083,5,40005,6,0,1023,30029,0


Converting to forward existential form...Done !
original formula: EG((!(E(A(E(((newmsg12>=1)&&(elected_15_to_left_13>=1)) U (rcv_left_election_15_3_1_1>=1)) U A((rcv_right_election_15_4_3_12>=1) U ((newm...551
=> equivalent forward existential formula: [FwdG(Init,(!(E(!((E(!(!((E(!(((newmsg11>=1)&&(reply_11_0_to_right_10>=1))) U (!((rcv_right_election_15_4_3_12>=...1140
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t13, t14, t15, t17, t18, t20, t22, t25, t26, t28, t3...311
Detected timeout of ITS tools.
[2026-05-25 23:17:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:17:53] [INFO ] Applying decomposition
[2026-05-25 23:17:53] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9276322609871984427.txt' '-o' '/tmp/graph9276322609871984427.bin' '-w' '/tmp/graph9276322609871984427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9276322609871984427.bin' '-l' '-1' '-v' '-w' '/tmp/graph9276322609871984427.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:17:53] [INFO ] Decomposing Gal with order
[2026-05-25 23:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:17:53] [INFO ] Removed a total of 61 redundant transitions.
[2026-05-25 23:17:53] [INFO ] Flatten gal took : 15 ms
[2026-05-25 23:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-25 23:17:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2573377598490228680.gal : 2 ms
[2026-05-25 23:17:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4619714727035627217.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2573377598490228680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4619714727035627217.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.76509e+14,0.279627,17128,1011,1029,21377,9972,718,33832,167,42217,0


Converting to forward existential form...Done !
original formula: EG((!(E(A(E(((i4.u8.newmsg12>=1)&&(i5.i1.u52.elected_15_to_left_13>=1)) U (i0.u0.rcv_left_election_15_3_1_1>=1)) U A((i4.u8.rcv_right_ele...690
=> equivalent forward existential formula: [FwdG(Init,(!(E(!((E(!(!((E(!(((i4.u7.newmsg11>=1)&&(i1.u6.reply_11_0_to_right_10>=1))) U (!((i4.u8.rcv_right_el...1387
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t15, t26, t42, t60, t155, t192, i0.t9, i0.t6, i0.t0, i1.t31, i1.t2, i1.u5.t25, i1.u6....423
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 291 transition count 272
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 291 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 285 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 285 transition count 266
Applied a total of 32 rules in 14 ms. Remains 285 /301 variables (removed 16) and now considering 266/282 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6936816204042999233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12130399432820107996.kers'
[2026-05-25 23:18:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6936816204042999233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12130399432820107996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:18:23] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12130399432820107996.kers
Total runtime 5 ms.
[2026-05-25 23:18:23] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 23:18:23] [INFO ] Invariant cache hit.
[2026-05-25 23:18:24] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:18:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26960 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57005ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57006ms
Starting structural reductions in LTL mode, iteration 1 : 285/301 places, 266/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58502 ms. Remains : 285/301 places, 266/282 transitions.
[2026-05-25 23:19:21] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:19:21] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:19:21] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-25 23:19:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:19:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:19:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10781181078542683997.gal : 2 ms
[2026-05-25 23:19:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3489835981856143825.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10781181078542683997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3489835981856143825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.70338e+16,0.623277,29956,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: EF((AG((AG(((newmsg5<1)||(election_15_4_10_to_left_6<1))) * EG(((newmsg15<1)||(reply_15_3_to_right_14<1))))) + (AX(((rcv_left_election_15...248
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((newmsg5<1)||(election_15_4_10_to_left_6<1))))) * EG(((newmsg15...361
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2026-05-25 23:19:51] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:19:51] [INFO ] Applying decomposition
[2026-05-25 23:19:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16028867457973143823.txt' '-o' '/tmp/graph16028867457973143823.bin' '-w' '/tmp/graph16028867457973143823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16028867457973143823.bin' '-l' '-1' '-v' '-w' '/tmp/graph16028867457973143823.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:19:52] [INFO ] Decomposing Gal with order
[2026-05-25 23:19:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:19:52] [INFO ] Removed a total of 35 redundant transitions.
[2026-05-25 23:19:52] [INFO ] Flatten gal took : 13 ms
[2026-05-25 23:19:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 23:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability629420431789203797.gal : 2 ms
[2026-05-25 23:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11031100570149545211.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability629420431789203797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11031100570149545211.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70338e+16,1.27392,51048,2455,2598,71864,35911,781,152380,265,143728,0


Converting to forward existential form...Done !
original formula: EF((AG((AG(((i2.u3.newmsg5<1)||(i2.u3.election_15_4_10_to_left_6<1))) * EG(((i6.u12.newmsg15<1)||(i6.u28.reply_15_3_to_right_14<1))))) + ...301
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((i2.u3.newmsg5<1)||(i2.u3.election_15_4_10_to_left_6<1))))) * E...414
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t5, t7, t9, t10, t12, t13, t14, t220, t265, i0.t1, i0.u0.t20, i0.u1.t18, i0.u1.t2...552
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 291 transition count 202
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 221 transition count 202
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 149 place count 212 transition count 193
Iterating global reduction 2 with 9 rules applied. Total rules applied 158 place count 212 transition count 193
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 212 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 210 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 209 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 209 transition count 190
Applied a total of 164 rules in 31 ms. Remains 209 /301 variables (removed 92) and now considering 190/282 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-78266930969654336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3319101318594602621.kers'
[2026-05-25 23:20:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-78266930969654336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3319101318594602621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 209 cols 496 entries
Finished phase 1 with 186 SingleSign rule and 4 generalized
[2026-05-25 23:20:22] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3319101318594602621.kers
Total runtime 2 ms.
[2026-05-25 23:20:22] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 23:20:22] [INFO ] Invariant cache hit.
[2026-05-25 23:20:22] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2026-05-25 23:20:22] [INFO ] Redundant transitions in 8 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-25 23:20:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 5/195 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 176/371 variables, 195/214 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/371 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/399 variables, and 214 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11828 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 195/209 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 5/195 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 176/371 variables, 195/214 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 171/385 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/399 variables, and 385 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 195/209 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41855ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 41856ms
Starting structural reductions in SI_CTL mode, iteration 1 : 209/301 places, 190/282 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42633 ms. Remains : 209/301 places, 190/282 transitions.
[2026-05-25 23:21:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:21:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:21:04] [INFO ] Input system was already deterministic with 190 transitions.
[2026-05-25 23:21:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:21:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:21:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7074223641594333730.gal : 1 ms
[2026-05-25 23:21:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6377091200119604796.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7074223641594333730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6377091200119604796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.41285e+13,0.220588,14048,2,7481,5,41817,6,0,1009,37555,0


Converting to forward existential form...Done !
original formula: (!(A((rcv_right_election_15_4_15_15>=1) U EF(EG(((newmsg2>=1)&&(election_15_4_2_to_right_1>=1)))))) + AG(!(E(!(A(((newmsg6>=1)&&(election...435
=> equivalent forward existential formula: (([(FwdU(FwdU((Init * !(!(!((E(!(E(TRUE U EG(((newmsg2>=1)&&(election_15_4_2_to_right_1>=1))))) U (!((rcv_right_...1769
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t10, t11, t13, t15, t16, t17, t19, t21, t22, t23, t25, t26, t28, ...298
(forward)formula 0,1,22.0192,701268,1,0,1203,4.19243e+06,428,582,6293,3.78767e+06,1383
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Reduce places removed 7 places and 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 294 transition count 199
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 218 transition count 199
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 161 place count 209 transition count 190
Iterating global reduction 2 with 9 rules applied. Total rules applied 170 place count 209 transition count 190
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 2 with 1 rules applied. Total rules applied 171 place count 209 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 208 transition count 189
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 206 transition count 187
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 206 transition count 187
Applied a total of 176 rules in 21 ms. Remains 206 /301 variables (removed 95) and now considering 187/282 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2648527508401603361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13721449484623893811.kers'
[2026-05-25 23:21:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2648527508401603361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13721449484623893811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 206 cols 485 entries
Finished phase 1 with 183 SingleSign rule and 4 generalized
[2026-05-25 23:21:26] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13721449484623893811.kers
Total runtime 1 ms.
[2026-05-25 23:21:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 23:21:27] [INFO ] Invariant cache hit.
[2026-05-25 23:21:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-25 23:21:28] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2026-05-25 23:21:28] [INFO ] Redundant transitions in 2 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-25 23:21:28] [INFO ] Invariant cache hit.
[2026-05-25 23:21:28] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 179/377 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 19/236 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/393 variables, and 236 constraints, problems are : Problem set: 0 solved, 171 unsolved in 29402 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 198/206 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 179/377 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 19/236 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 171/407 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/393 variables, and 407 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 198/206 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59428ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 59429ms
Starting structural reductions in SI_CTL mode, iteration 1 : 206/301 places, 187/282 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60494 ms. Remains : 206/301 places, 187/282 transitions.
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:22:27] [INFO ] Input system was already deterministic with 187 transitions.
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:22:27] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:22:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5876197070320059056.gal : 1 ms
[2026-05-25 23:22:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8891763747863597039.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5876197070320059056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8891763747863597039.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.91367e+13,0.266729,15880,2,8607,5,49985,6,0,994,43791,0


Converting to forward existential form...Done !
original formula: EG(!(E(((EG(((newmsg9>=1)&&(election_10_0_1_to_left_10>=1))) * (A(((newmsg15>=1)&&(reply_15_2_to_right_14>=1)) U ((newmsg9>=1)&&(election...333
=> equivalent forward existential formula: [FwdG(Init,!(E(((EG(((newmsg9>=1)&&(election_10_0_1_to_left_10>=1))) * (!((E(!(((newmsg9>=1)&&(election_15_4_6_t...505
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t12, t13, t15, t17, t20, t21, t22, t24, t25, t28, t2...321
Detected timeout of ITS tools.
[2026-05-25 23:22:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:22:57] [INFO ] Applying decomposition
[2026-05-25 23:22:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14246903746512739606.txt' '-o' '/tmp/graph14246903746512739606.bin' '-w' '/tmp/graph14246903746512739606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14246903746512739606.bin' '-l' '-1' '-v' '-w' '/tmp/graph14246903746512739606.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:22:57] [INFO ] Decomposing Gal with order
[2026-05-25 23:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:22:57] [INFO ] Removed a total of 58 redundant transitions.
[2026-05-25 23:22:57] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 23:22:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7124048594538857775.gal : 2 ms
[2026-05-25 23:22:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10368177161840566163.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7124048594538857775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10368177161840566163.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.91367e+13,0.208807,14092,1036,778,17301,6269,641,27976,194,18618,0


Converting to forward existential form...Done !
original formula: EG(!(E(((EG(((i2.u1.newmsg9>=1)&&(i2.u1.election_10_0_1_to_left_10>=1))) * (A(((i4.u4.newmsg15>=1)&&(i3.u3.reply_15_2_to_right_14>=1)) U ...411
=> equivalent forward existential formula: [FwdG(Init,!(E(((EG(((i2.u1.newmsg9>=1)&&(i2.u1.election_10_0_1_to_left_10>=1))) * (!((E(!(((i2.u1.newmsg9>=1)&&...609
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t7, t10, t17, t22, t30, t39, t151, t186, i0.t38, i0.t34, i0.t33, i0.t6, i0.t5, i0...412
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Reduce places removed 11 places and 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 290 transition count 191
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 210 transition count 191
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 169 place count 201 transition count 182
Iterating global reduction 2 with 9 rules applied. Total rules applied 178 place count 201 transition count 182
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 2 with 3 rules applied. Total rules applied 181 place count 201 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 184 place count 198 transition count 179
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 197 transition count 178
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 197 transition count 178
Applied a total of 186 rules in 22 ms. Remains 197 /301 variables (removed 104) and now considering 178/282 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13490243772209985404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15807249623336780764.kers'
[2026-05-25 23:23:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13490243772209985404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15807249623336780764.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 197 cols 448 entries
Finished phase 1 with 174 SingleSign rule and 4 generalized
[2026-05-25 23:23:27] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15807249623336780764.kers
Total runtime 1 ms.
[2026-05-25 23:23:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 23:23:27] [INFO ] Invariant cache hit.
[2026-05-25 23:23:28] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2026-05-25 23:23:28] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2026-05-25 23:23:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 6/184 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 165/349 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/349 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/375 variables, and 203 constraints, problems are : Problem set: 0 solved, 159 unsolved in 9578 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 184/197 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 6/184 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 165/349 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 159/362 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/375 variables, and 362 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 184/197 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39600ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 39600ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/301 places, 178/282 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40288 ms. Remains : 197/301 places, 178/282 transitions.
[2026-05-25 23:24:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:24:08] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:24:08] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-25 23:24:08] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:24:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14103614346765277467.gal : 1 ms
[2026-05-25 23:24:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11193272345336464924.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14103614346765277467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11193272345336464924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,6.11111e+13,0.128783,10068,2,4512,5,23903,6,0,947,20754,0


Converting to forward existential form...Done !
original formula: EF(((rcv_right_election_15_3_4_11>=1) * ((E(((newmsg13>=1)&&(election_15_3_2_to_left_14>=1)) U (rcv_right_election_15_4_13_2>=1)) + EG(((...349
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * (rcv_right_election_15_3_4_11>=1)),((newmsg13>=1)&&(election_15_3_2_to_left_14>=1)))...606
Hit Full ! (commute/partial/dont) 157/20/21
dead was empty
dead was empty
Hit Full ! (commute/partial/dont) 176/0/2
(forward)formula 0,1,6.45448,222060,1,0,214,1.02698e+06,31,7,4800,829925,211
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 273
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 287 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 287 transition count 268
Applied a total of 28 rules in 10 ms. Remains 287 /301 variables (removed 14) and now considering 268/282 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7751676358568888860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17811737248163360348.kers'
[2026-05-25 23:24:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7751676358568888860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17811737248163360348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 287 cols 807 entries
Finished phase 1 with 264 SingleSign rule and 4 generalized
[2026-05-25 23:24:14] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17811737248163360348.kers
Total runtime 4 ms.
[2026-05-25 23:24:14] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 23:24:14] [INFO ] Invariant cache hit.
[2026-05-25 23:24:16] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-25 23:24:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27217 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57258ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57259ms
Starting structural reductions in LTL mode, iteration 1 : 287/301 places, 268/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58758 ms. Remains : 287/301 places, 268/282 transitions.
[2026-05-25 23:25:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:25:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:25:13] [INFO ] Input system was already deterministic with 268 transitions.
[2026-05-25 23:25:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:25:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:25:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9406826152091924264.gal : 1 ms
[2026-05-25 23:25:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14511785609028524229.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9406826152091924264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14511785609028524229.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.78803e+16,0.677291,29760,2,22661,5,101325,6,0,1404,100513,0


Converting to forward existential form...Done !
original formula: A(AX(!((((newmsg1>=1)&&(reply_15_2_to_left_2>=1))||((newmsg3>=1)&&(elected_15_to_left_4>=1))))) U (rcv_left_election_6_0_1_7>=1))
=> equivalent forward existential formula: [((Init * !(EG(!((rcv_left_election_6_0_1_7>=1))))) * !(E(!((rcv_left_election_6_0_1_7>=1)) U (!(!(EX(!(!((((new...290
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2026-05-25 23:25:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:25:43] [INFO ] Applying decomposition
[2026-05-25 23:25:43] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16636865265392345004.txt' '-o' '/tmp/graph16636865265392345004.bin' '-w' '/tmp/graph16636865265392345004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16636865265392345004.bin' '-l' '-1' '-v' '-w' '/tmp/graph16636865265392345004.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:25:43] [INFO ] Decomposing Gal with order
[2026-05-25 23:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:25:43] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-25 23:25:43] [INFO ] Flatten gal took : 19 ms
[2026-05-25 23:25:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-25 23:25:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11020853085244390237.gal : 3 ms
[2026-05-25 23:25:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4356550596995363208.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11020853085244390237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4356550596995363208.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.78803e+16,2.11116,75896,2286,4553,86308,87456,695,167475,281,450834,0


Converting to forward existential form...Done !
original formula: A(AX(!((((i0.u0.newmsg1>=1)&&(i0.u1.reply_15_2_to_left_2>=1))||((i1.u2.newmsg3>=1)&&(i1.u28.elected_15_to_left_4>=1))))) U (i3.u6.rcv_lef...178
=> equivalent forward existential formula: [((Init * !(EG(!((i3.u6.rcv_left_election_6_0_1_7>=1))))) * !(E(!((i3.u6.rcv_left_election_6_0_1_7>=1)) U (!(!(E...333
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t7, t8, t10, t12, t13, t14, t24, t50, t222, t267, i0.t20, i0.u1.t18, ...548
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 291 transition count 272
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 291 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 285 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 285 transition count 266
Applied a total of 32 rules in 17 ms. Remains 285 /301 variables (removed 16) and now considering 266/282 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17259491885504986259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3875499311720204860.kers'
[2026-05-25 23:26:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17259491885504986259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3875499311720204860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:26:13] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3875499311720204860.kers
Total runtime 2 ms.
[2026-05-25 23:26:13] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 23:26:13] [INFO ] Invariant cache hit.
[2026-05-25 23:26:15] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:26:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26933 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56966ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56967ms
Starting structural reductions in LTL mode, iteration 1 : 285/301 places, 266/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58564 ms. Remains : 285/301 places, 266/282 transitions.
[2026-05-25 23:27:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:27:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:27:12] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-25 23:27:12] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:27:12] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:27:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8925621902278251700.gal : 1 ms
[2026-05-25 23:27:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14377015194862011108.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8925621902278251700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14377015194862011108.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.70338e+16,0.658216,29928,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: E(((newmsg13>=1)&&(elected_15_to_left_14>=1)) U AX(AF((rcv_left_election_15_3_8_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((newmsg13>=1)&&(elected_15_to_left_14>=1))) * !(EX(!(!(EG(!((rcv_left_election_15_3_8_8>=1))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2026-05-25 23:27:42] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:27:42] [INFO ] Applying decomposition
[2026-05-25 23:27:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12741017404760443921.txt' '-o' '/tmp/graph12741017404760443921.bin' '-w' '/tmp/graph12741017404760443921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12741017404760443921.bin' '-l' '-1' '-v' '-w' '/tmp/graph12741017404760443921.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:27:42] [INFO ] Decomposing Gal with order
[2026-05-25 23:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:27:42] [INFO ] Removed a total of 27 redundant transitions.
[2026-05-25 23:27:42] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 23:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16289419189990172786.gal : 2 ms
[2026-05-25 23:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2886830085368910320.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16289419189990172786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2886830085368910320.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70338e+16,2.82977,96984,2703,3348,135110,64365,733,349170,264,322781,0


Converting to forward existential form...Done !
original formula: E(((i5.u11.newmsg13>=1)&&(i5.u30.elected_15_to_left_14>=1)) U AX(AF((i7.i0.u17.rcv_left_election_15_3_8_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((i5.u11.newmsg13>=1)&&(i5.u30.elected_15_to_left_14>=1))) * !(EX(!(!(EG(!((i7.i0.u17.rcv_left_elect...188
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t8, t10, t12, t13, t20, t250, t265, i0.t14, i0.u0.t220, i0.u13.t16, i1.t2...575
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 286 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 286 transition count 267
Applied a total of 30 rules in 9 ms. Remains 286 /301 variables (removed 15) and now considering 267/282 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1194703212875747720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2910244409387706985.kers'
[2026-05-25 23:28:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1194703212875747720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2910244409387706985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 286 cols 805 entries
Finished phase 1 with 263 SingleSign rule and 4 generalized
[2026-05-25 23:28:12] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2910244409387706985.kers
Total runtime 2 ms.
[2026-05-25 23:28:12] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 23:28:12] [INFO ] Invariant cache hit.
[2026-05-25 23:28:13] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 23:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 26470 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56513ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 56514ms
Starting structural reductions in LTL mode, iteration 1 : 286/301 places, 267/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58071 ms. Remains : 286/301 places, 267/282 transitions.
[2026-05-25 23:29:10] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:29:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:29:10] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-25 23:29:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:29:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:29:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18092557429577216546.gal : 1 ms
[2026-05-25 23:29:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3915216825011483422.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18092557429577216546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3915216825011483422.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.18786e+16,0.690328,30084,2,22792,5,102896,6,0,1399,102449,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:29:40] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:29:40] [INFO ] Applying decomposition
[2026-05-25 23:29:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9148405733781605717.txt' '-o' '/tmp/graph9148405733781605717.bin' '-w' '/tmp/graph9148405733781605717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9148405733781605717.bin' '-l' '-1' '-v' '-w' '/tmp/graph9148405733781605717.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:29:40] [INFO ] Decomposing Gal with order
[2026-05-25 23:29:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:29:40] [INFO ] Removed a total of 27 redundant transitions.
[2026-05-25 23:29:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:29:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 23:29:40] [INFO ] Time to serialize gal into /tmp/CTLFireability607252287336521864.gal : 2 ms
[2026-05-25 23:29:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10198070738718005236.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability607252287336521864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10198070738718005236.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.18786e+16,2.2282,83716,2887,3067,122304,63704,777,260316,267,278326,0


Converting to forward existential form...Done !
original formula: AX(A(EF((((i4.i1.u25.rcv_right_reply_15_2_15>=1)&&(i1.u12.newmsg6>=1))&&(i1.u12.election_5_0_1_to_right_5>=1))) U ((i1.u4.newmsg5>=1)&&(i...188
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(((i1.u4.newmsg5>=1)&&(i2.u32.elected_15_to_left_6>=1)))) * !(((i1.u4.newmsg5>=1)&&(i2.u32.el...394
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 291 transition count 272
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 291 transition count 272
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 286 transition count 267
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 286 transition count 267
Applied a total of 30 rules in 9 ms. Remains 286 /301 variables (removed 15) and now considering 267/282 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-918085856007870348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8211638719647076362.kers'
[2026-05-25 23:30:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-918085856007870348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8211638719647076362.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 286 cols 805 entries
Finished phase 1 with 263 SingleSign rule and 4 generalized
[2026-05-25 23:30:10] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8211638719647076362.kers
Total runtime 2 ms.
[2026-05-25 23:30:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 23:30:10] [INFO ] Invariant cache hit.
[2026-05-25 23:30:12] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 286/301 places, 267/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1552 ms. Remains : 286/301 places, 267/282 transitions.
[2026-05-25 23:30:12] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:30:12] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:30:12] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-25 23:30:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:30:12] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:30:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9810521838078148455.gal : 1 ms
[2026-05-25 23:30:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9736377976726979412.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9810521838078148455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9736377976726979412.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.18594e+16,0.677346,29920,2,22699,5,101980,6,0,1399,101589,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 23:30:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:30:42] [INFO ] Applying decomposition
[2026-05-25 23:30:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14599197702203345290.txt' '-o' '/tmp/graph14599197702203345290.bin' '-w' '/tmp/graph14599197702203345290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14599197702203345290.bin' '-l' '-1' '-v' '-w' '/tmp/graph14599197702203345290.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:30:42] [INFO ] Decomposing Gal with order
[2026-05-25 23:30:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:30:42] [INFO ] Removed a total of 34 redundant transitions.
[2026-05-25 23:30:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 23:30:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14893768110822130255.gal : 7 ms
[2026-05-25 23:30:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10454952666199536512.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14893768110822130255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10454952666199536512.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.18594e+16,2.90801,103116,3690,2517,158791,29751,745,463351,260,164307,0


Converting to forward existential form...Done !
original formula: AX((AG(A(AF(!(((i3.i0.u16.newmsg10<1)||(i6.u7.election_15_4_10_to_right_9<1)))) U (i7.u15.rcv_right_election_15_3_8_7>=1))) * ((i7.u15.ne...198
=> equivalent forward existential formula: (([FwdG((FwdU(FwdU(EY(Init),TRUE),!((i7.u15.rcv_right_election_15_3_8_7>=1))) * !((i7.u15.rcv_right_election_15_...410
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 286 transition count 155
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 174 transition count 155
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 234 place count 164 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 244 place count 164 transition count 145
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 2 with 4 rules applied. Total rules applied 248 place count 164 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 252 place count 160 transition count 141
Applied a total of 252 rules in 22 ms. Remains 160 /301 variables (removed 141) and now considering 141/282 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16201844660095805750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6437376689994784017.kers'
[2026-05-25 23:31:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16201844660095805750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6437376689994784017.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 160 cols 302 entries
Finished phase 1 with 137 SingleSign rule and 4 generalized
[2026-05-25 23:31:12] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6437376689994784017.kers
Total runtime 1 ms.
[2026-05-25 23:31:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 23:31:12] [INFO ] Invariant cache hit.
[2026-05-25 23:31:12] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2026-05-25 23:31:12] [INFO ] Redundant transitions in 0 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-25 23:31:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 2/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 115/248 variables, 133/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 3/251 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/301 variables, and 154 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6241 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/160 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 2/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 115/248 variables, 133/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 104/256 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 3/251 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/301 variables, and 266 constraints, problems are : Problem set: 0 solved, 112 unsolved in 25702 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/160 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31948ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 31948ms
Starting structural reductions in SI_CTL mode, iteration 1 : 160/301 places, 141/282 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32444 ms. Remains : 160/301 places, 141/282 transitions.
[2026-05-25 23:31:44] [INFO ] Flatten gal took : 2 ms
[2026-05-25 23:31:44] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:31:44] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-25 23:31:44] [INFO ] Flatten gal took : 2 ms
[2026-05-25 23:31:44] [INFO ] Flatten gal took : 2 ms
[2026-05-25 23:31:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13144703932247599124.gal : 0 ms
[2026-05-25 23:31:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1496550016229704800.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13144703932247599124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1496550016229704800.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,5.41626e+12,0.092924,7928,2,2433,5,16404,6,0,758,13232,0


Converting to forward existential form...Done !
original formula: E(!(EG((((rcv_right_election_15_3_8_7>=1) + (AF((rcv_right_election_13_0_1_12>=1)) * (rcv_left_reply_15_0_15>=1))) * EG(((rcv_left_electi...241
=> equivalent forward existential formula: [(FwdU(Init,!(EG((((rcv_right_election_15_3_8_7>=1) + (!(EG(!((rcv_right_election_13_0_1_12>=1)))) * (rcv_left_r...293
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t26, t109, t125, t140, Intersect...245
(forward)formula 0,1,3.11359,116452,1,0,408,570436,311,145,4561,469022,446
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 282/282 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 291 transition count 272
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 291 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 285 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 285 transition count 266
Applied a total of 32 rules in 18 ms. Remains 285 /301 variables (removed 16) and now considering 266/282 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6414714296169101211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9676495186970096767.kers'
[2026-05-25 23:31:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6414714296169101211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9676495186970096767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:31:47] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9676495186970096767.kers
Total runtime 2 ms.
[2026-05-25 23:31:48] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 23:31:48] [INFO ] Invariant cache hit.
[2026-05-25 23:31:49] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:31:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26500 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56545ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56546ms
Starting structural reductions in LTL mode, iteration 1 : 285/301 places, 266/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57967 ms. Remains : 285/301 places, 266/282 transitions.
[2026-05-25 23:32:45] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:32:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:32:45] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-25 23:32:45] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:32:45] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:32:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9206367209401573683.gal : 1 ms
[2026-05-25 23:32:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2238956583166484553.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9206367209401573683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2238956583166484553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,7.70338e+16,0.671277,29992,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: EG(((A((rcv_left_election_15_3_2_2>=1) U !((A(((newmsg11>=1)&&(elected_15_to_left_12>=1)) U (rcv_right_reply_15_3_2>=1)) * !(((newmsg4>=1...347
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!((!((E(!((rcv_right_reply_15_3_2>=1)) U (!(((newmsg11>=1)&&(elected_15_to_left_12>=1))) * !...1051
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2026-05-25 23:33:16] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:33:16] [INFO ] Applying decomposition
[2026-05-25 23:33:16] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12105045614632224907.txt' '-o' '/tmp/graph12105045614632224907.bin' '-w' '/tmp/graph12105045614632224907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12105045614632224907.bin' '-l' '-1' '-v' '-w' '/tmp/graph12105045614632224907.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:33:16] [INFO ] Decomposing Gal with order
[2026-05-25 23:33:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:33:16] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-25 23:33:16] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 23:33:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10725025402665963975.gal : 3 ms
[2026-05-25 23:33:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10001289414238600057.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10725025402665963975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10001289414238600057.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,7.70338e+16,2.13341,74696,2787,2843,113008,44260,733,219780,262,258353,0


Converting to forward existential form...Done !
original formula: EG(((A((i1.u1.rcv_left_election_15_3_2_2>=1) U !((A(((i6.u16.newmsg11>=1)&&(i6.u32.elected_15_to_left_12>=1)) U (i1.u1.rcv_right_reply_15...426
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!((!((E(!((i1.u1.rcv_right_reply_15_3_2>=1)) U (!(((i6.u16.newmsg11>=1)&&(i6.u32.elected_15_...1258
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t9, t10, t12, t13, t14, t24, t220, t265, i0.u13.t16, i1.t20, i1.u1.t18, i...548
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 23:33:46] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:33:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:33:46] [INFO ] Applying decomposition
[2026-05-25 23:33:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7345829754616252077.txt' '-o' '/tmp/graph7345829754616252077.bin' '-w' '/tmp/graph7345829754616252077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7345829754616252077.bin' '-l' '-1' '-v' '-w' '/tmp/graph7345829754616252077.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:33:46] [INFO ] Decomposing Gal with order
[2026-05-25 23:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:33:46] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-25 23:33:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:33:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 23:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15528072724713089668.gal : 2 ms
[2026-05-25 23:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5436282331251965373.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15528072724713089668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5436282331251965373.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 9 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,6.18059e+17,1.9601,74200,3177,3000,103563,55754,735,265910,288,242453,0


Converting to forward existential form...Done !
original formula: (AG((AF(((i7.u1.init1<1)&&((i3.u8.newmsg10<1)||(i3.u8.reply_15_3_to_right_9<1)))) + A(((i0.u12.newmsg15>=1)&&(i0.u12.election_1_0_1_to_le...302
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(((i6.u16.newmsg11>=1)&&(i8.i0.u31.elected_15_to_left_12>=1)))))) U (!(...554
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t36, t77, t281, i0.u12.t15, i0.u...559
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-25 23:37:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2977629643940796955.gal : 1 ms
[2026-05-25 23:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10121977424323120975.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2977629643940796955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10121977424323120975.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 9 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,6.18059e+17,0.879902,35512,2,26705,5,127806,6,0,1474,130957,0


Converting to forward existential form...Done !
original formula: (AG((AF(((init1<1)&&((newmsg10<1)||(reply_15_3_to_right_9<1)))) + A(((newmsg15>=1)&&(election_1_0_1_to_left_1>=1)) U AF(((newmsg11>=1)&&(...240
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(((newmsg11>=1)&&(elected_15_to_left_12>=1)))))) U (!(((newmsg15>=1)&&(...458
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t26...390
dead was empty
(forward)formula 0,1,70.5882,2124340,1,0,953,1.09039e+07,594,388,8922,9.45136e+06,1041
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG((!(E(A(E(((newmsg12>=1)&&(elected_15_to_left_13>=1)) U (rcv_left_election_15_3_1_1>=1)) U A((rcv_right_election_15_4_3_12>=1) U ((newm...551
=> equivalent forward existential formula: [FwdG(Init,(!(E(!((E(!(!((E(!(((newmsg11>=1)&&(reply_11_0_to_right_10>=1))) U (!((rcv_right_election_15_4_3_12>=...1140
(forward)formula 1,1,345.34,2978372,1,0,1015,1.74299e+07,11,654,4329,2.2277e+07,351
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF((AG((AG(((newmsg5<1)||(election_15_4_10_to_left_6<1))) * EG(((newmsg15<1)||(reply_15_3_to_right_14<1))))) + (AX(((rcv_left_election_15...248
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((newmsg5<1)||(election_15_4_10_to_left_6<1))))) * EG(((newmsg15...361
(forward)formula 2,1,421.451,3298084,1,0,1088,1.99228e+07,14,654,4895,2.2277e+07,26
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG(!(E(((EG(((newmsg9>=1)&&(election_10_0_1_to_left_10>=1))) * (A(((newmsg15>=1)&&(reply_15_2_to_right_14>=1)) U ((newmsg9>=1)&&(election...333
=> equivalent forward existential formula: [FwdG(Init,!(E(((EG(((newmsg9>=1)&&(election_10_0_1_to_left_10>=1))) * (!((E(!(((newmsg9>=1)&&(election_15_4_6_t...505
(forward)formula 3,0,491.165,3573416,1,0,1575,2.2208e+07,36,873,5607,2.558e+07,1459
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(AX(!((((newmsg1>=1)&&(reply_15_2_to_left_2>=1))||((newmsg3>=1)&&(elected_15_to_left_4>=1))))) U (rcv_left_election_6_0_1_7>=1))
=> equivalent forward existential formula: [((Init * !(EG(!((rcv_left_election_6_0_1_7>=1))))) * !(E(!((rcv_left_election_6_0_1_7>=1)) U (!(!(EX(!(!((((new...290
(forward)formula 4,0,651.858,4004060,1,0,1759,2.5635e+07,12,883,4752,3.03781e+07,180
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(((newmsg13>=1)&&(elected_15_to_left_14>=1)) U AX(AF((rcv_left_election_15_3_8_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((newmsg13>=1)&&(elected_15_to_left_14>=1))) * !(EX(!(!(EG(!((rcv_left_election_15_3_8_8>=1))))))))]...164
Hit Full ! (commute/partial/dont) 261/20/21
(forward)formula 5,1,677.142,4004060,1,0,1759,2.5635e+07,24,883,4788,3.03781e+07,844
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX(A(EF((((rcv_right_reply_15_2_15>=1)&&(newmsg6>=1))&&(election_5_0_1_to_right_5>=1))) U ((newmsg5>=1)&&(elected_15_to_left_6>=1))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(((newmsg5>=1)&&(elected_15_to_left_6>=1)))) * !(((newmsg5>=1)&&(elected_15_to_left_6>=1)))) ...331
Hit Full ! (commute/partial/dont) 267/0/15
Hit Full ! (commute/partial/dont) 267/0/15
(forward)formula 6,0,683.655,4004060,1,0,1759,2.5635e+07,44,883,6033,3.03781e+07,902
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX((AG(A(AF(!(((newmsg10<1)||(election_15_4_10_to_right_9<1)))) U (rcv_right_election_15_3_8_7>=1))) * ((newmsg7<1)||(reply_7_0_to_right_...162
=> equivalent forward existential formula: (([FwdG((FwdU(FwdU(EY(Init),TRUE),!((rcv_right_election_15_3_8_7>=1))) * !((rcv_right_election_15_3_8_7>=1))),!(...360
Hit Full ! (commute/partial/dont) 280/0/2
(forward)formula 7,0,684.008,4004060,1,0,1759,2.5635e+07,58,883,6579,3.03781e+07,908
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG(((A((rcv_left_election_15_3_2_2>=1) U !((A(((newmsg11>=1)&&(elected_15_to_left_12>=1)) U (rcv_right_reply_15_3_2>=1)) * !(((newmsg4>=1...347
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!((!((E(!((rcv_right_reply_15_3_2>=1)) U (!(((newmsg11>=1)&&(elected_15_to_left_12>=1))) * !...1051
(forward)formula 8,0,720.835,4004060,1,0,1779,2.5635e+07,83,1107,6596,3.03781e+07,1878
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2156755 ms.

BK_STOP 1779752947727

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="HirschbergSinclair-PT-15"
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-5973"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-15, 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 r146-tall-177961074400746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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